Fourier synthesis optical diffraction tomography for kilohertz rate volumetric imaging

Peter T Brown1,2, Nikta Jabbarzadeh1,2, Luis Meneses3

  • 1Center for Biological Physics, Arizona State University, Tempe, AZ 85287, USA.

Science Advances
|August 13, 2025
PubMed
Summary

Fourier synthesis optical diffraction tomography (FS-ODT) enables high-speed, 3D refractive index imaging. This quantitative phase imaging technique captures dynamic biological and soft matter processes at kilohertz rates.

Related Concept Videos

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...
406
Electron Microscope Tomography and Single-particle Reconstruction01:07

Electron Microscope Tomography and Single-particle Reconstruction

Transmission electron microscopy (TEM) can be used to determine the 3D structure of biological samples with the help of techniques such as electron microscope tomography and single-particle reconstruction. While single-particle reconstruction can examine macromolecules and macromolecular complexes in vitro conditions only, tomography permits the study of cell components or small cells in vivo.
Electron Tomography
Electron tomography can be performed either in TEM or STEM (scanning transmission...
2.5K
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...
469