Related Experiment Video

Updated: Aug 7, 2026

Integrated Photoacoustic Ophthalmoscopy and Spectral-domain Optical Coherence Tomography
11:21

Integrated Photoacoustic Ophthalmoscopy and Spectral-domain Optical Coherence Tomography

Published on: January 15, 2013

Synchronous self-elimination of autocorrelation interference in Fourier-domain optical coherence tomography

Jun Ai1, Lihong V Wang

  • 1Optical Imaging Laboratory, Department of Biomedical Engineering, Texas A&M University, 3120 TAMU, College Station, Texas 77843-3120, USA.

Optics Letters
|November 11, 2005
PubMed

More Related Videos

Simultaneous Brightfield, Fluorescence, and Optical Coherence Tomographic Imaging of Contracting Cardiac Trabeculae Ex Vivo12:54

Simultaneous Brightfield, Fluorescence, and Optical Coherence Tomographic Imaging of Contracting Cardiac Trabeculae Ex Vivo

Published on: October 2, 2021

Alignment of Visible-Light Optical Coherence Tomography Fibergrams with Confocal Images of the Same Mouse Retina07:02

Alignment of Visible-Light Optical Coherence Tomography Fibergrams with Confocal Images of the Same Mouse Retina

Published on: June 30, 2023

Related Concept Videos

Interference and Diffraction02:18

Interference and Diffraction

Interference is a characteristic phenomenon exhibited by waves. When two electromagnetic waves interact with their peaks and troughs coinciding, a resulting wave with enhanced amplitude is produced. This is known as constructive interference. In this case, the two waves interacting are in phase with each other.
Computed Tomography01:10

Computed Tomography

Tomography refers to imaging by sections. Computed tomography (CT) is a non-invasive imaging technique that uses computers to analyze several cross-sectional X-rays to reveal minute details about structures in the body.
The technique was invented in the 1970s and is based on the principle that as X-rays pass through the body, they are absorbed or reflected at different levels. In the technique, a patient lies on a motorized platform while a computerized axial tomography (CAT) scanner rotates...
Continuous -time Fourier Transform01:11

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 transform01:26

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...
Discrete Fourier Transform01:15

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...
Fast Fourier Transform01:10

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