scispace - formally typeset
Journal ArticleDOI

Multirate and DFT Based Fast Parallel Algorithm for 2-D Inverse Discrete Gabor Transform

Reads0
Chats0
TLDR
The proposed parallel algorithm is attractive for real time image processing and can apply the 2-D fast inverse discrete Fourier transform (IFFT) algorithm to reduce the computational load.
Abstract
Multirate and DFT based fast parallel algorithm for the 2-D inverse discrete Gabor transform (IDGT) is presented. A 2-D synthesis filterbank is designed for the 2-D IDGT. The parallel channels in the filterbank have a unified structure and can apply the 2-D fast inverse discrete Fourier transform (IFFT) algorithm to reduce the computational load. The computational complexity of each parallel channel is very low and is independent of the oversampling rate. Thus, the proposed parallel algorithm is attractive for real time image processing.

read more

References
More filters

Theory of communication

Dennis Gabor
Journal ArticleDOI

Complete discrete 2-D Gabor transforms by neural networks for image analysis and compression

TL;DR: A three-layered neural network based on interlaminar interactions involving two layers with fixed weights and one layer with adjustable weights finds coefficients for complete conjoint 2-D Gabor transforms without restrictive conditions for image analysis, segmentation, and compression.
Journal ArticleDOI

An efficient algorithm to compute the complete set of discrete Gabor coefficients

TL;DR: The discrete Gabor (1946) transform algorithm is introduced that provides an efficient method of calculating the complete set of discreteGabor coefficients of a finite-duration discrete signal from finite summations and to reconstruct the original signal exactly from the computed expansion coefficients.
Journal ArticleDOI

Filterbank and DFT Based Fast Parallel Discrete Gabor Transform for Image Representation

TL;DR: A fast parallel algorithm for the 2-D discrete Gabor transform (DGT) is presented based on2-D filterbank, which has a unified structure and can apply the 1-D inverse fast discrete Fourier transform algorithm to reduce the computational load.