An Efficient Algorithm to Compute the Complete Set of Discrete Gabor Coefficients

Liwa Wang, Wei Chung Lin

Research output: Contribution to journalArticlepeer-review

43 Scopus citations

Abstract

The discrete Gabor transform algorithm is introduced that provides an efficient method to calculate the complete set of discrete Gabor coefficients of a finite-duration discrete signal from finite summations and to reconstruct the original signal exactly from the computed expansion coefficients. The similarity of the formulas between the discrete Gabor transform and the discrete Fourier transform enables us to employ the FFT algorithms in the computation. The discrete 1-D Gabor transform algorithm can be extended to 2-D as well.

Original languageEnglish (US)
Pages (from-to)87-92
Number of pages6
JournalIEEE Transactions on Image Processing
Volume3
Issue number1
DOIs
StatePublished - Jan 1994

ASJC Scopus subject areas

  • Software
  • Computer Graphics and Computer-Aided Design

Fingerprint

Dive into the research topics of 'An Efficient Algorithm to Compute the Complete Set of Discrete Gabor Coefficients'. Together they form a unique fingerprint.

Cite this