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.
[1]
Rudolf Ehrhardt,et al.
Morphological filter design with genetic algorithms
,
1994,
Optics & Photonics.
[2]
Pauli Kuosmanen,et al.
Optimization of soft-morphological filters by genetic algorithms
,
1994,
Optics & Photonics.
[3]
H. John Caulfield,et al.
Generalized Fourier transform processor
,
1994,
Defense, Security, and Sensing.
[4]
J Shamir,et al.
Collective genetic algorithm for optimization and its electro-optic implementation.
,
1993,
Applied optics.