A fast implementation of the discrete 2-D Gabor transform

Please use this identifier to cite or link to this item: https://scholarbank.nus.edu.sg/handle/10635/80272

DC Field	Value
dc.title	A fast implementation of the discrete 2-D Gabor transform
dc.contributor.author	Srinivasan, V.
dc.contributor.author	Bhatia, P.
dc.contributor.author	Ong, S.H.
dc.date.accessioned	2014-10-07T02:55:42Z
dc.date.available	2014-10-07T02:55:42Z
dc.date.issued	1993-03
dc.identifier.citation	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.
dc.identifier.issn	01651684
dc.identifier.uri	http://scholarbank.nus.edu.sg/handle/10635/80272
dc.description.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.
dc.source	Scopus
dc.subject	fast algorithms
dc.subject	Gabor transform
dc.subject	iterative methods
dc.subject	neural networks
dc.type	Article
dc.contributor.department	ELECTRICAL ENGINEERING
dc.description.sourcetitle	Signal Processing
dc.description.volume	31
dc.description.issue	2
dc.description.page	229-233
dc.description.coden	SPROD
dc.identifier.isiut	NOT_IN_WOS
Appears in Collections:	Staff Publications

There are no files associated with this item.

Check