Related Experiment Video

Updated: Mar 28, 2026

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

11.0K

Cylindrical angular spectrum using Fourier coefficients of point light source and its application to fast hologram

Seungtaik Oh, Il Kwon Jeong

    Optics Express
    |December 25, 2015
    PubMed

    More Related Videos

    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

    10.8K
    A Multimodal Wide-Field Fourier-Transform Raman Microscope06:48

    A Multimodal Wide-Field Fourier-Transform Raman Microscope

    Published on: December 30, 2025

    747

    Related Concept Videos

    Aliasing01:18

    Aliasing

    Accurate signal sampling and reconstruction are crucial in various signal-processing applications. A time-domain signal's spectrum can be revealed using its Fourier transform. When this signal is sampled at a specific frequency, it results in multiple scaled replicas of the original spectrum in the frequency domain. The spacing of these replicas is determined by the sampling frequency.
    If the sampling frequency is below the Nyquist rate, these replicas overlap, preventing the original...
    776
    IR Spectroscopy: Hooke's Law Approximation of Molecular Vibration01:16

    IR Spectroscopy: Hooke's Law Approximation of Molecular Vibration

    A covalently bonded heteronuclear diatomic molecule can be modeled as two vibrating masses connected by a spring. The vibrational frequency of the bond can be expressed using an equation derived from Hooke's law, which describes how the force applied to stretch or compress a spring is proportional to the displacement of the spring. In this case, the atoms behave like masses, and the bond acts like a spring.
    According to Hooke's law, the vibrational frequency is directly proportional to...
    3.7K
    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...
    1.1K
    Gauss's Law: Cylindrical Symmetry01:20

    Gauss's Law: Cylindrical Symmetry

    A charge distribution has cylindrical symmetry if the charge density depends only upon the distance from the axis of the cylinder and does not vary along the axis or with the direction about the axis. In other words, if a system varies if it is rotated around the axis or shifted along the axis, it does not have cylindrical symmetry. In real systems, we do not have infinite cylinders; however, if the cylindrical object is considerably longer than the radius from it that we are interested in,...
    9.9K
    Properties of Fourier Transform II01:24

    Properties of Fourier Transform II

    The Fourier Transform (FT) is an essential mathematical tool in signal processing, transforming a time-domain signal into its frequency-domain representation. This transformation elucidates the relationship between time and frequency domains through several properties, each revealing unique aspects of signal behavior.
    The Frequency Shifting property of Fourier Transforms highlights that a shift in the frequency domain corresponds to a phase shift in the time domain. Mathematically, if x(t) has...
    901
    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...
    1.2K