Accurate shape measurement of focusing microstructures in Fourier digital holographic microscopy

Applied Optics
|January 13, 2018
PubMed

Related Concept Videos

Molecular Shapes01:18

Molecular Shapes

Molecules have characteristic shapes that are crucial for their function. The arrangement of various electron groups around the central atom dictates their molecular geometry. Electron pairs in the valence shell of a central atom will adopt an arrangement that minimizes repulsions between the electron pairs by maximizing the distance between them. The valence electrons form either bonding pairs, located primarily between bonded atoms, or lone pairs.
Two regions of electron density in a diatomic...
62.5K
Molecular Shape and Polarity03:37

Molecular Shape and Polarity

Dipole Moment of a Molecule
76.2K
Trigonometric Fourier series01:17

Trigonometric Fourier series

Fourier series is a foundational mathematical technique that decomposes periodic functions into an infinite series of sinusoidal harmonics. This method enables the representation of complex periodic signals as sums of simple sine and cosine functions, facilitating their analysis and interpretation in various fields, including signal processing, acoustics, and electrical engineering.
The trigonometric Fourier series specifically expresses a periodic function with a defined period T using sine...
845
Convergence of Fourier Series01:21

Convergence of Fourier Series

The Fourier series is a powerful mathematical tool for representing periodic signals as an infinite sum of complex exponentials. In practice, this infinite series is truncated to a finite number of terms, yielding a partial sum. This truncation makes the approximation of the signal feasible but introduces certain challenges, particularly near discontinuities, known as the Gibbs phenomenon.
The Gibbs phenomenon refers to the persistent oscillations and overshoots that occur near discontinuities...
440
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...
988
VSEPR Theory and the Basic Shapes02:52

VSEPR Theory and the Basic Shapes

Overview of VSEPR Theory
85.6K