Translator Disclaimer
31 July 2002 Fast algorithms for 1D and 2D real-valued discrete Gabor transforms
Author Affiliations +
Proceedings Volume 4875, Second International Conference on Image and Graphics; (2002) https://doi.org/10.1117/12.477146
Event: Second International Conference on Image and Graphics, 2002, Hefei, China
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.
© (2002) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Tao Liang, Gu Juan-Juan, Yang Jun-an, and Zhuang Zhen-quan "Fast algorithms for 1D and 2D real-valued discrete Gabor transforms", Proc. SPIE 4875, Second International Conference on Image and Graphics, (31 July 2002); https://doi.org/10.1117/12.477146
PROCEEDINGS
8 PAGES


SHARE
Advertisement
Advertisement
Back to Top