Related Experiment Video

Updated: May 18, 2026

Digital Inline Holographic Microscopy (DIHM) of Weakly-scattering Subjects
10:16

Digital Inline Holographic Microscopy (DIHM) of Weakly-scattering Subjects

Published on: February 8, 2014

Fast calculation of computer-generated holograms based on 3-D Fourier spectrum for omnidirectional diffraction from a

Yusuke Sando1, Daisuke Barada, Toyohiko Yatagai

  • 1Center for Optical Research & Education, Utsunomiya University, 7-1-2 Yoto, Utsunomiya, Tochigi 321-8585, Japan.

Optics Express
|October 6, 2012
PubMed

More Related Videos

Quantifying Microorganisms at Low Concentrations Using Digital Holographic Microscopy (DHM)07:27

Quantifying Microorganisms at Low Concentrations Using Digital Holographic Microscopy (DHM)

Published on: November 1, 2017

Compact Lens-less Digital Holographic Microscope for MEMS Inspection and Characterization10:28

Compact Lens-less Digital Holographic Microscope for MEMS Inspection and Characterization

Published on: July 5, 2016

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