DFT-based fast algorithms for 2-D discrete Gabor transform

• Published in: 2009 2nd International Conference on Power Electronics and Intelligent Transportation System Vol. 1; pp. 266 - 269
• Main Authors: Xian-He Gao, Xue-You Hu, Liang Tao
• Format: Conference Proceeding
• Language: English
• Published: IEEE 01.12.2009
• Subjects: Algorithm design and analysis; biorthogonal analysis windows; Computational complexity; discrete Fourier transform (DFT); discrete Gabor transform (DGT); Discrete transforms; Image analysis; Image coding; Image processing; Image recognition; Image reconstruction; Image segmentation; Image texture analysis
• ISBN: 9781424445448; 1424445442
• DOI: 10.1109/PEITS.2009.5407020

The 2-D Gabor transform has been recognized as being very useful in diverse areas such as image compression, texture analysis, image segmentation, and image recognition; however, its real-time applications have been limited due to the high computational complexity of the 2-D discrete Gabor transform (DGT) algorithms. The contributions of this paper include: (1) the oversampled 2-D DGT is presented, which can utilize the fast DFT and inverse DFT algorithms for fast computation of the 2-D DGT coefficients of an image and for the fast reconstruction of the original image from the coefficients, and (2) a fast computation method of the biorthogonal analysis windows based on the 2-D biorthogonality relationship of the 2-D DGT is provided. The proposed algorithms are attractive for real time image processing.