Mathematical Theory and Modeling
The Fast Fourier Transform Algorithm and Its Application in Digital Image Processing
Abstract
Transforms are new image processing tools that are being applied to a wide variety of image processing problems. Fourier Transform and similar frequency transform techniques are widely used in image understanding and image enhancement techniques. Fast Fourier Transform (FFT) is the variation of Fourier transform in which the computing complexity is largely reduced. FFT is a mathematical technique for transforming a time domain digital signal into a frequency domain representation of the relative amplitude of different regions in the signal. The objective of this paper is to develop FFT based image processing algorithm. FFT can be computed faster than the Discrete Fourier Transform (DFT) on the same machine.
Key words: Fast Fourier Transform, Discrete Fourier Transform, Radix-2 FFT algorithm, Decimation in Time FFT, Time complexity.
To list your conference here. Please contact the administrator of this platform.
Paper submission email: MTM@iiste.org
ISSN (Paper)2224-5804 ISSN (Online)2225-0522
Please add our address "contact@iiste.org" into your email contact list.
This journal follows ISO 9001 management standard and licensed under a Creative Commons Attribution 3.0 License.
Copyright © www.iiste.org