Journal ArticleDOI
An Efficient Two-Dimensional FFT Algorithm
Lawrence R. Johnson,Anil K. Jain +1 more
TLDR
Analysis of the numbers of complex additions and multiplications required indicate that implementations of the radix-4 row-column FFT and 4 × 4 vector radix FFT on the same minicomputer would run slower than the multiple vector implementation.Abstract:
A new version of the radix-2 row-column method for computing two-dimensional fast Fourier transforms is proposed. It uses a ``multiple vector'' FFT algorithm to compute the transforms of all the columns in an array simultaneously while avoiding all trivial multiplications. The minicomputer implementation of the algorithm runs faster than the 2 × 2 vector radix FFT algorithm. Analysis of the numbers of complex additions and multiplications required indicate that implementations of the radix-4 row-column FFT and 4 × 4 vector radix FFT on the same minicomputer would run slower than the multiple vector implementation.read more
Citations
More filters
Book
Image Processing Handbook, Fourth Edition
TL;DR: The Image Processing Handbook as mentioned in this paper provides an extensive collection of image processing tools, enabling the user of computer-based system to understand those methods provided in packaged software and to program additions needed for particular applications.
Book
The Image Processing Handbook, Fourth Edition
TL;DR: This revision of the established standard acts as a singular resource for professionals in the medical, biological, and materials sciences as well as a range of engineering venues, including electrical and computer engineering, optical engineering, telecommunications, and artificial intelligence.
Journal ArticleDOI
Volume measure in 2DPCA-based face recognition
Ji-Cheng Meng,Wenbin Zhang +1 more
TL;DR: To assess the performance of 2DPCA with the volume measure (VM), experiments were performed on two famous face databases, and the experimental results indicate that the proposed 2 DPCA+VM can outperform the typical 2D PCA+DM and PCA in face recognition.
Journal ArticleDOI
Efficient 2D FFT implementation on mediaprocessors
TL;DR: An efficient implementation to compute the 2D fast Fourier transform (FFT) on a new very long instruction word programmable mediaprocessor using instruction-level parallelism and a multimedia instruction set, which resulted in faster execution time than previous single-chip programmable or dedicated solutions.
References
More filters
Book
Theory and application of digital signal processing
TL;DR: Feyman and Wing as discussed by the authors introduced the simplicity of the invariant imbedding method to tackle various problems of interest to engineers, physicists, applied mathematicians, and numerical analysts.
Proceedings ArticleDOI
Vector radix fast Fourier transform
TL;DR: A new radix-2 two-dimensional direct FFT developed by Rivard is generalized in this paper to include arbitrary radices and non-square arrays and it is shown that the Radix-4 version of this algorithm may require significantly fewer computations than conventional row-column transform methods.
Journal ArticleDOI
Direct fast Fourier transform of bivariate functions
TL;DR: A generalized mathematical theory of holor algebra is used to manipulate coefficient arrays needed to generate computational equations which involve elements from throughout the two-dimensional array rather than operating on individual rows and columns.