A Performance Analysis of Fast Gabor Transform Methods

Authors: Chinen T.T.¹; Reed T.R.²

Source: Graphical Models and Image Processing, Volume 59, Number 3, May 1997 , pp. 117-127(11)

Buy & download fulltext article:

The full text article is not available for purchase.

The publisher only permits individual articles to be downloaded by subscribers.

Abstract:

Computation of the finite discrete Gabor transform can be accomplished in a variety of ways. Three representative methods (matrix inversion, Zak transform, and relaxation network) were evaluated in terms of execution speed, accuracy, and stability. The relaxation network was the slowest method tested. Its strength lies in the fact that it makes no explicit assumptions about the basis functions; in practice it was found that convergence did depend on basis choice. The matrix method requires a separable Gabor basis (i.e., one that can be generated by taking a Cartesian product of one-dimensional functions), but is faster than the relaxation network by several orders of magnitude. It proved to be a stable and highly accurate algorithm. The Zak-Gabor algorithm requires that all of the Gabor basis functions have exactly the same envelope and gives no freedom in choosing the modulating function. Its execution, however, is very stable, accurate, and by far the most rapid of the three methods tested.

Language: English

Document Type: Research article

Affiliations: 1: Department of Mathematics, University of California at Davis, California 2: Department of Electrical and Computer Engineering, University of California at Davis, California

Publication date: 1997-05-01