Search research articles

ABOUT JoVE

Overview Leadership Blog JoVE Help Center

AUTHORS

Publishing Process Editorial Board Scope & Policies Peer Review FAQ Submit

LIBRARIANS

Testimonials Subscriptions Access Resources Library Advisory Board FAQ

RESEARCH

JoVE Journal Methods Collections JoVE Encyclopedia of Experiments Archive

EDUCATION

JoVE Core JoVE Business JoVE Science Education JoVE Lab Manual Faculty Resource Center Faculty Site

Terms & Conditions of Use

Related Concept Videos

Discrete Fourier Transform

Discrete Fourier Transform

The Discrete Fourier Transform (DFT) is a fundamental tool in signal processing, extending the discrete-time Fourier transform by evaluating discrete signals at uniformly spaced frequency intervals. This transformation converts a finite sequence of time-domain samples into frequency components, each representing complex sinusoids ordered by frequency. The DFT translates these sequences into the frequency domain, effectively indicating the magnitude and phase of each frequency component present...

Properties of DTFT I

Properties of DTFT I

In signal processing, Discrete-Time Fourier Transforms (DTFTs) play a critical role in analyzing discrete-time signals in the frequency domain. Various properties of the DTFTs such as linearity, time-shifting, frequency-shifting, time reversal, conjugation, and time scaling help understand and manipulate these signals for different applications.
The linearity property of DTFTs is fundamental. If two discrete-time signals are multiplied by constants a and b respectively, and then combined to...

Discrete-time Fourier transform

Discrete-time Fourier transform

The Discrete-Time Fourier Transform (DTFT) is an essential mathematical tool for analyzing discrete-time signals, converting them from the time domain to the frequency domain. This transformation allows for examining the frequency components of discrete signals, providing insights into their spectral characteristics. In the DTFT, the continuous integral used in the continuous-time Fourier transform is replaced by a summation to accommodate the discrete nature of the signal.
One of the notable...

Relation of DFT to z-Transform

Relation of DFT to z-Transform

The Discrete Fourier Transform (DFT) is a crucial tool for analyzing the frequency content of discrete-time signals. It converts a sequence of N samples from the time domain into its corresponding sequence in the frequency domain, where each sample represents a specific frequency component.
To understand how the DFT works, it's helpful to consider the z-transform, which is a method for representing discrete sequences in the complex frequency domain. The z-transform involves summing the terms of...

Fast Fourier Transform

Fast Fourier Transform

The Fast Fourier Transform (FFT) is a computational algorithm designed to compute the Discrete Fourier Transform (DFT) efficiently. By breaking down the calculations into smaller, manageable sections, the FFT significantly reduces the computational complexity involved. Direct computation of an N-point DFT requires N2 complex multiplications, whereas the FFT algorithm needs only (N/2)log⁡2N multiplications, offering a much faster performance.
The computational efficiency of the FFT becomes...

Properties of DTFT II

Properties of DTFT II

In the study of discrete-time signal processing, understanding the properties of the Discrete-Time Fourier Transform (DTFT) is crucial for analyzing and manipulating signals in the frequency domain. Several properties, including frequency differentiation, convolution, accumulation, and Parseval's relation, offer powerful tools for signal analysis.
The frequency differentiation property is illustrated by considering a DTFT pair and differentiating both sides with respect to ω. Multiplying by j...

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by

Same author

Laparoscopic partial splenectomy with modified Warshaw method for severe traumatic splenic rupture: a case report.

Journal of medical case reports·2026

Same author

Flavor modulation of fermented degummed coffee beans by ultrasound and ultra-high pressure: metabolomic and volatile profiles.

Ultrasonics sonochemistry·2026

Same author

Functional Characteristics of Walnut Protein Fractions and Rutin Loading by Albumin.

Foods (Basel, Switzerland)·2026

Same author

A biodegradable low-voltage soft actuator with exceptional energy density and ultrafast response.

Science advances·2026

Same author

Precision Nursing Guided by IKAP Theory for Volume Management in Elderly Patients with Chronic Heart Failure: A Retrospective Study.

Pakistan journal of medical sciences·2026

Same author

The clinical application of parenteral nutrition with Omega-3 fatty acids in patients after gastrectomy: a retrospective cohort study and cost-effectiveness analysis.

Lipids in health and disease·2026

Search research articles

Related Experiment Video

Updated: Jun 21, 2026

Optical Scatter Microscopy Based on Two-Dimensional Gabor Filters

Optical Scatter Microscopy Based on Two-Dimensional Gabor Filters

Published on: June 2, 2010

Fast parallel approach for 2-D DHT-based real-valued discrete Gabor transform.

Liang Tao¹, Hon Keung Kwan

¹MOE Key Laboratory of Intelligent Computing and Signal Processing, School of Computer Science and Technology, Anhui University, Hefei, Anhui 230039, China. taoliang@mail.hf.ah.cn

IEEE Transactions on Image Processing : a Publication of the IEEE Signal Processing Society

|August 5, 2009

Summary

This summary is machine-generated.

This study introduces fast algorithms for the 2-D real-valued discrete Gabor transform (RDGT), significantly reducing computational complexity for real-time image processing applications.

More Related Videos

High-resolution, High-speed, Three-dimensional Video Imaging with Digital Fringe Projection Techniques

High-resolution, High-speed, Three-dimensional Video Imaging with Digital Fringe Projection Techniques

Published on: December 3, 2013

Related Experiment Videos

Last Updated: Jun 21, 2026

Optical Scatter Microscopy Based on Two-Dimensional Gabor Filters

Optical Scatter Microscopy Based on Two-Dimensional Gabor Filters

Published on: June 2, 2010

High-resolution, High-speed, Three-dimensional Video Imaging with Digital Fringe Projection Techniques

High-resolution, High-speed, Three-dimensional Video Imaging with Digital Fringe Projection Techniques

Published on: December 3, 2013

Area of Science:

Digital Signal Processing
Image Processing
Computational Mathematics

Background:

Traditional 2-D complex-valued discrete Gabor transform (CDGT) algorithms exhibit high computational complexity, limiting their use in real-time applications.
Fast Gabor transform algorithms are crucial for enabling real-time processing in various fields, including image analysis.

Purpose of the Study:

To present novel block time-recursive algorithms for the 2-D DHT-based real-valued discrete Gabor transform (RDGT) and its inverse.
To develop a fast parallel approach for implementing these RDGT algorithms.
To analyze and compare the computational complexity of the proposed approach with existing 2-D CDGT algorithms.

Main Methods:

Development of two block time-recursive algorithms for 2-D RDGT and its inverse.
Implementation of a fast parallel approach for the proposed algorithms.
Computational complexity analysis and comparison with existing 2-D CDGT algorithms.

Main Results:

The proposed algorithms provide efficient computation for 2-D RDGT and its inverse.
The developed parallel approach significantly reduces computational load compared to traditional methods.
The new algorithms demonstrate suitability for real-time image processing tasks.

Conclusions:

The presented fast parallel approach for 2-D RDGT is computationally efficient.
This method offers a viable solution for real-time image processing applications.
The study advances the field of digital signal processing by providing faster Gabor transform implementations.