A fast implementation of the discrete 2-D Gabor transform

DOI10.1016/0165-1684(93)90068-LMaRDI QIDQ1803840zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 29 June 1993

Published in Signal Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0165-1684(93)90068-l

zbMATH Keywords

fast algorithmsGabor transformneural network methodFFT-based gradient descent method

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Computing methodologies for image processing (68U10)

Recommendations

• Weight adjustment rule of neural networks for computing discrete 2-D Gabor transforms (image processing)
• Discrete Gabor transforms with complexity \(O(N\log N)\)
• Fast algorithms for generalized discrete Gabor expansions
• Scale specific and robust edge/line encoding with linear combinations of Gabor wavelets
• The Order of Computation for Finite Discrete Gabor Transforms

Cited in

(7)

• Efficient computation of two-dimensional Gaussian windows
• scientific article; zbMATH DE number 1849105 (Why is no real title available?)
• scientific article; zbMATH DE number 88747 (Why is no real title available?)
• Fast 2D Complex Gabor Filter With Kernel Decomposition
• Scale specific and robust edge/line encoding with linear combinations of Gabor wavelets
• Fast algorithms for generalized discrete Gabor expansions
• A rational-expansion-based method to compute Gabor coefficients of 2D indicator functions supported on polygonal domain

This page was built for publication: A fast implementation of the discrete 2-D Gabor transform

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1803840)