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

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...

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...

Discrete-Time Fourier Series

Discrete-Time Fourier Series

The Discrete-Time Fourier Series (DTFS) is a fundamental concept in signal processing, serving as the discrete-time counterpart to the continuous-time Fourier series. It allows for the representation and analysis of discrete-time periodic signals in terms of their frequency components. Unlike its continuous counterpart, which utilizes integrals, the calculation of DTFS expansion coefficients involves summations due to the discrete nature of the signal.
For a discrete-time periodic signal x[n]...

Basic signals of Fourier Transform

Basic signals of Fourier Transform

The Fourier Transform is a pivotal mathematical tool in signal processing, enabling the transformation of time-domain signals into their frequency-domain representations. Among the numerous elements within this domain, certain functions like the sinc function, delta function, and exponential signals hold significant importance due to their unique properties and implications.
The sinc function, defined as sinc(x) = sin(πx)/(πx), is particularly notable for its symmetry and behavior at zero. It...

Continuous -time Fourier Transform

Continuous -time Fourier Transform

The Fourier series is instrumental in representing periodic functions, offering a powerful method to decompose such functions into a sum of sinusoids. This technique, however, necessitates modification when applied to nonperiodic functions. Consider a pulse-train waveform consisting of a series of rectangular pulses. When these pulses have a finite period, they can be accurately represented by a Fourier series. Yet, as the period approaches infinity, resulting in a single, isolated pulse, the...

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...

You might also read

Related Articles

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

Sort by

Same author

Autonomous OCT-Guided Robotic System for Vertical Needle Insertion and Big-Bubble Dissection in Corneal Transplantation.

IEEE transactions on bio-medical engineering·2026

Same author

Deep-learning-based endoscopic single-shot fringe projection profilometry.

Journal of biomedical optics·2025

Same author

Development of an image-guided non-vitrectomy subretinal access approach for trans-scleral cell and gene therapy delivery.

bioRxiv : the preprint server for biology·2025

Same author

A Robotic Injection System for Consistent Pneumo-dissection of the Deep Stroma in Big Bubble DALK Surgery.

Annual International Conference of the IEEE Engineering in Medicine and Biology Society. IEEE Engineering in Medicine and Biology Society. Annual International Conference·2025

Same author

Towards Autonomous Retinal Microsurgery Using RGB-D Images.

IEEE robotics and automation letters·2024

Same author

High-resolution <i>in vivo</i> 4D-OCT fish-eye imaging using 3D-UNet with multi-level residue decoder.

Biomedical optics express·2024

Search research articles

Related Experiment Video

Updated: Jun 11, 2026

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

Real-time 4D signal processing and visualization using graphics processing unit on a regular nonlinear-k

Kang Zhang¹, Jin U Kang

¹Department of Electrical and Computer Engineering, The Johns Hopkins University, 3400 N. Charles Street, Baltimore, MD 21218, USA. kzhang8@jhu.edu

|July 1, 2010

Summary

Graphics processing unit (GPU) acceleration enables real-time 4D signal processing and visualization for Fourier-domain optical coherence tomography (FD-OCT) systems. This cost-effective GPU implementation overcomes 3D data bottlenecks without optical modifications.

More Related Videos

A Multimodal Wide-Field Fourier-Transform Raman Microscope

A Multimodal Wide-Field Fourier-Transform Raman Microscope

Published on: December 30, 2025

Synchronous Triplanar Reconstruction Integrated with Color Doppler Mapping for Precise and Rapid Localization of Thyroid Lesions

Synchronous Triplanar Reconstruction Integrated with Color Doppler Mapping for Precise and Rapid Localization of Thyroid Lesions

Published on: February 9, 2024

Related Experiment Videos

Last Updated: Jun 11, 2026

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

A Multimodal Wide-Field Fourier-Transform Raman Microscope

A Multimodal Wide-Field Fourier-Transform Raman Microscope

Published on: December 30, 2025

Synchronous Triplanar Reconstruction Integrated with Color Doppler Mapping for Precise and Rapid Localization of Thyroid Lesions

Synchronous Triplanar Reconstruction Integrated with Color Doppler Mapping for Precise and Rapid Localization of Thyroid Lesions

Published on: February 9, 2024

Area of Science:

Biomedical Optics
Medical Imaging
Computer Science

Background:

Fourier-domain optical coherence tomography (FD-OCT) systems generate large 3D datasets.
Real-time processing and visualization of these datasets present significant computational challenges.
Existing FD-OCT systems often face bottlenecks in handling high-speed 3D data acquisition.

Purpose of the Study:

To implement graphics processing unit (GPU)-based real-time 4D signal processing and visualization for FD-OCT.
To accelerate spectral re-sampling, Fourier transform, and post-processing steps.
To overcome the 3D data processing and visualization limitations in ultrahigh-speed FD-OCT systems.

Main Methods:

Implemented an ultra-high speed linear spline interpolation (LSI) method for lambda-to-k spectral re-sampling on GPU architecture.
Integrated complete FD-OCT signal processing, including spectral re-sampling, fast Fourier transform (FFT), and post-FFT processing, onto the GPU.
Utilized a GPU with a nonlinear k-space spectrometer and a high-speed CMOS camera for data acquisition.

Main Results:

Achieved average interpolation speeds of >3,000,000 line/s (1024-OCT) and >1,400,000 line/s (2048-OCT).
Maximum complete A-scan processing speeds reached 680,000 line/s (1024-OCT) and 320,000 line/s (2048-OCT).
Demonstrated real-time visualization of 3D datasets at up to 10 volumes/second using en face slice extraction or ray-casting volume rendering.

Conclusions:

GPU-based acceleration provides a cost-effective solution for real-time 4D FD-OCT processing and visualization.
The implemented method overcomes critical 3D data processing and visualization bottlenecks.
This approach requires only additional GPU hardware, with no optical modifications needed for standard FD-OCT systems.