Please use this identifier to cite or link to this item:
|Title:||A fast implementation of the discrete 2-D Gabor transform|
|Authors:||Srinivasan, V. |
|Source:||Srinivasan, V.,Bhatia, P.,Ong, S.H. (1993-03). A fast implementation of the discrete 2-D Gabor transform. Signal Processing 31 (2) : 229-233. ScholarBank@NUS Repository.|
|Abstract:||An FFT-based gradient descent method for computing the non-orthogonal Gabor transform of a two-dimensional discrete signal I[x,y] is described. When operating on images consisting of P × Q pixels divided into sub-images with M × N pixels, the estimated gain in computational speed over a neural network method proposed by Daugman is by a factor of kMN, where k = 10/[3 log2(4MN) +4]. © 1993.|
|Source Title:||Signal Processing|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Feb 16, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.