富里尔合成光学衍射断层扫描用于千赫兹速率体积成像的容量成像
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
概括
富里埃综合光折射断层扫描 (FS-ODT) 能够实现高速的3D折射率成像. 这种定量相位成像技术以千赫兹速率捕捉动态生物和软物质过程.
科学领域:
- 生物物理学的生物物理.
- 软物质物理学 软物质物理学
- 显微镜的使用方法
背景情况:
- 在3D中以高速速度成像复杂的生物和软物质动态是具有挑战性的.
- 现有的技术往往缺乏快速,体积分析所需的速度或分辨率.
研究的目的:
- 为高速3D定量相位成像引入富里尔合成光学衍射断层扫描 (FS-ODT).
- 能够以前所未有的体积速度研究生物和软物质系统中的动态过程.
主要方法:
- 开发了一种定量相位成像方法FS-ODT.
- 实施了多重光照角度的计算策略,以提高体积成像速度.
- 实现了用于3D折射率映射的千赫兹速率.
主要成果:
- 在各种样本上进行验证的FS-ODT,包括合体和细菌游泳体.
- 证明了在千赫兹速率下记录3D折射率的能力.
- 集成的FS-ODT与多色结构化照明显微镜用于多模式成像.
结论:
- FS-ODT显著提高了3D折射率映射的体积成像速率.
- 这种技术为探索微游泳器和三维合体的物理相互作用开辟了新的途径.
- FS-ODT有助于理解物理刺激与生物分子反应之间的相互作用.
相关概念视频
Discrete Fourier Transform
406
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 Reconstruction
2.5K
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...
Electron Tomography
Electron tomography can be performed either in TEM or STEM (scanning transmission...
2.5K
Fast Fourier Transform
469
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)log2N multiplications, offering a much faster performance.
The computational efficiency of the FFT becomes...
The computational efficiency of the FFT becomes...
469


