Share Email Print

Proceedings Paper

Fast algorithms for 1D and 2D real-valued discrete Gabor transforms
Author(s): Tao Liang; Gu Juan-Juan; Yang Jun-an; Zhuang Zhen-quan
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

By replacing the complex-valued Gabor basis functions of the complex-valued discrete Gabor transforms (CDGTs) with real-valued Gabor basis functions, we propose fast algorithms for 1 -D and 2-D real-valued discrete Gabor transforms (RDGTs) in this paper. The RDGT algorithms provide a simpler method than the CDGT algorithms to calculate the transform (or Gabor) coefficients of a signal or an image from finite summations and to reconstruct the original signal or image exactly from the computed transform coefficients. The similarity between the RDGTs and the discrete Hartley transforms (DHTs) enables the RDGTs to utilize the fast DHT algorithms for fast computation. Moreover, the RDGTs have a simple relationship with the CDGTs such that the CDGT coefficients can be directly computed from the RDGT coefficients.

Paper Details

Date Published: 31 July 2002
PDF: 8 pages
Proc. SPIE 4875, Second International Conference on Image and Graphics, (31 July 2002); doi: 10.1117/12.477146
Show Author Affiliations
Tao Liang, Anhui Univ. / Univ. of Science and Technology of China (China)
Gu Juan-Juan, Hefei Association Univ. (China)
Yang Jun-an, Univ. of Science and Technology of China (China)
Zhuang Zhen-quan, Univ. of Science and Technology of China (China)

Published in SPIE Proceedings Vol. 4875:
Second International Conference on Image and Graphics
Wei Sui, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?