Recursive Gabor filtering

  • Authors:
  • I.T. Young;L.J. van Vliet;M. van Ginkel

  • Affiliations:
  • Dept. of Appl. Phys., Delft Univ. of Technol.;-;-

  • Venue:
  • IEEE Transactions on Signal Processing
  • Year:
  • 2002

Quantified Score

Hi-index 35.68

Visualization

Abstract

We present a stable, recursive algorithm for the Gabor (1946) filter that achieves-to within a multiplicative constant-the fastest possible implementation. For a signal consisting of N samples, our implementation requires O(N) multiply-and-add (MADD) operations, that is, the number of computations per input sample is constant. Further, the complexity is independent of the values of σ, and ω in the Gabor kernel, and the coefficients of the recursive equation have a simple, closed-form solution given σ and ω. Our implementation admits not only a "forward" Gabor filter but an inverse filter that is also O(N) complexity.