Premium
A fast multi‐level decomposition algorithm for n ‐dimensional discrete Gabor transforms
Author(s) -
Zhu Zhi Yuan,
Barba Joseph
Publication year - 1992
Publication title -
journal of microscopy
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.569
H-Index - 111
eISSN - 1365-2818
pISSN - 0022-2720
DOI - 10.1111/j.1365-2818.1992.tb03241.x
Subject(s) - gabor transform , computer science , algorithm , computation , fourier transform , discrete fourier transform (general) , signal processing , s transform , joint (building) , spatial frequency , computational complexity theory , frequency domain , gabor wavelet , artificial intelligence , time–frequency analysis , signal (programming language) , very large scale integration , computer vision , short time fourier transform , digital signal processing , mathematics , wavelet transform , discrete wavelet transform , fourier analysis , optics , wavelet , computer hardware , filter (signal processing) , architectural engineering , mathematical analysis , engineering , programming language , physics , embedded system
SUMMARY Recently, joint spatial and spatial‐frequency representations have been used in signal processing of non‐stationary signals due to their natural local property and high joint resolution in both the spatial and spatial‐frequency domain. However, a major obstacle to their implementation is their large computation requirements. This paper presents a fast n ‐dimensional Gabor transform and signal reconstruction algorithm employing multi‐level parallel decomposition and fast Fourier transform techniques. The algorithm structure lends itself to implementation using VLSI/ASIC technology. Examples of two‐dimensional Gabor transform and reconstruction performed on a AT computer demonstrate the substantial computational saving that can be achieved using the fast Gabor transform.