DocumentCode
907088
Title
Two-dimensional recursive fast Fourier transform [image processing applications]
Author
Zhu, Feihong
Author_Institution
Dept. of Electr. & Comput. Eng., Oregon State Univ., Corvallis, OR, USA
Volume
137
Issue
4
fYear
1990
fDate
8/1/1990 12:00:00 AM
Firstpage
262
Lastpage
266
Abstract
The author presents a two-dimensional recursive fast Fourier transform (RFFT) which consists of two recursive algorithms and a revised fast Fourier transform in the recursive process. This algorithm is applied to image processing as an example of 2-D signal processing. Compared with a standard FFT, the RFFT has the advantages of not requiring the number of input data points to be equal to the number of discrete frequencies and of being suitable for online processing. Compared with other recursive Fourier transforms, the RFFT has a shorter computation time
Keywords
fast Fourier transforms; picture processing; 2-D signal processing; FFT; image processing; online processing; two-dimensional recursive fast Fourier transform;
fLanguage
English
Journal_Title
Radar and Signal Processing, IEE Proceedings F
Publisher
iet
ISSN
0956-375X
Type
jour
Filename
216982
Link To Document