28 August 1995 Optimization filters design for GFT by genetic algorithm
Author Affiliations +
In all current Fourier transform processing systems, which we call conventional Fourier transform (CFT) processors, no matter what kind of filter is used, its filter function can be expressed as a diagonal matrix, if in the view of digital image processing. We have presented a generalized Fourier transform (GFT) processor by extending the diagonal filter matrix into a nondiagonal matrix. It includes CFT as a special case, and still retains the space/time- invariance property. In this paper, we present a method based on genetic algorithms for finding an optimal filter of GFT processor. The behavior of the optimal filter in GFT processor and its advantages over that in the CFT processor are illustrated by the satisfied test results. An optimal generalized Teoplitz matrix for the GFT processor filter based on the figure of merit--the Manhatten error norm is also proposed.
© (1995) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Hanjun Peng, Hanjun Peng, H. John Caulfield, H. John Caulfield, Jason M. Kinser, Jason M. Kinser, James M. Hereford, James M. Hereford, } "Optimization filters design for GFT by genetic algorithm", Proc. SPIE 2565, Optical Implementation of Information Processing, (28 August 1995); doi: 10.1117/12.217644; https://doi.org/10.1117/12.217644

Back to Top