Structure of the Gabor matrix and efficient numerical algorithms for discrete Gabor expansions

The standard way to obtain suitable coefficients for the (non-orthogonal) Gabor expansion of a general signal for a given Gabor atom g and a pair of lattice constants in the (discrete) time/frequency plane, requires to compute the dual Gabor window function g- first. In this paper, we present an explicit description of the sparsity, the block and banded structure of the Gabor frame matrix G. On this basis efficient algorithms are developed for computing g- by solving the linear equation g- * G equals g with the conjugate- gradients method. Using the dual Gabor wavelet, a fast Gabor reconstruction algorithm with very low computational complexity is proposed.

[1]  Yehoshua Y. Zeevi,et al.  The Generalized Gabor Scheme of Image Representation in Biological and Machine Vision , 1988, IEEE Trans. Pattern Anal. Mach. Intell..

[2]  Shie Qian,et al.  Discrete Gabor transform , 1993, IEEE Trans. Signal Process..