loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
15th International Conference on Pattern Recognition (ICPR'00) - Volume 3
Recursive Gabor Filtering
Barcelona, Spain
September 03-September 08
ISBN: 0-7695-0750-6
Ian T. Young, Delft University of Technology
Lucas J. Van Vliet, Delft University of Technology
Michael Van Ginkel, Delft University of Technology
In this paper we present a 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. Further, the complexity is independent of the values of ? and ? in the Gabor kernel and coefficients of the recursive equation have a simple, closed-form solution given ? and ?. Our implementation admits not only a forward Gabor transform from t ? ? but an inverse transform from ? ? t that is also O(N) complexity.
Citation:
Ian T. Young, Lucas J. Van Vliet, Michael Van Ginkel, "Recursive Gabor Filtering," icpr, vol. 3, pp.3342, 15th International Conference on Pattern Recognition (ICPR'00) - Volume 3, 2000
Usage of this product signifies your acceptance of the Terms of Use.