Title: Recursive Gabor filtering
Authors: I.T. Young, L.J.
van Vliet, M. van Ginkelin: IEEE Transactions on Signal Processing,
Vol. 50, No. 11, 2798-2805, 2002. Abstract
In this paper we present a stable, recursive algorithm for the Gabor 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 s and w
in the Gabor kernel and coefficients of the recursive equation have a simple,
closed-form solution given s and w.
Our implementation admits not only a "forward" Gabor filter but an
inverse filter that is also O(N) complexity.
View pdf
file (350 kB)
Return to the homepage
of Lucas J. van Vliet
|
