Related Experiment Video

Updated: Jun 6, 2026

High-resolution, High-speed, Three-dimensional Video Imaging with Digital Fringe Projection Techniques
11:34

High-resolution, High-speed, Three-dimensional Video Imaging with Digital Fringe Projection Techniques

Published on: December 3, 2013

Fourier-transformation, phase-iteration, and least-square-fit image processing for Young's fringe pattern

J Gu, F Chen

    Applied Optics
    |November 12, 2010
    PubMed

    More Related Videos

    A Guide to Structured Illumination TIRF Microscopy at High Speed with Multiple Colors11:15

    A Guide to Structured Illumination TIRF Microscopy at High Speed with Multiple Colors

    Published on: May 30, 2016

    Time Multiplexing Super Resolving Technique for Imaging from a Moving Platform06:25

    Time Multiplexing Super Resolving Technique for Imaging from a Moving Platform

    Published on: February 12, 2014

    Related Concept Videos

    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...
    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...
    Continuous -time Fourier Transform01:11

    Continuous -time Fourier Transform

    The Fourier series is instrumental in representing periodic functions, offering a powerful method to decompose such functions into a sum of sinusoids. This technique, however, necessitates modification when applied to nonperiodic functions. Consider a pulse-train waveform consisting of a series of rectangular pulses. When these pulses have a finite period, they can be accurately represented by a Fourier series. Yet, as the period approaches infinity, resulting in a single, isolated pulse, the...
    Properties of Fourier series II01:21

    Properties of Fourier series II

    Time scaling of signals is a crucial concept in signal processing that affects the Fourier series representation without altering its coefficients. The process modifies the fundamental frequency, thereby changing how the series represents the signal over time. This principle is essential in various applications, including audio and image processing, where signal manipulation is frequent. Understanding function symmetries is fundamental to simplifying the Fourier series.
    A function f(t) is...
    Phase Contrast and Differential Interference Contrast Microscopy01:26

    Phase Contrast and Differential Interference Contrast Microscopy

    Phase-Contrast Microscopes
    In-phase-contrast microscopes, interference between light directly passing through a cell and light refracted by cellular components is used to create high-contrast, high-resolution images without staining. It is the oldest and simplest type of microscope that creates an image by altering the wavelengths of light rays passing through the specimen. Altered wavelength paths are created using an annular stop in the condenser. The annular stop produces a hollow cone of...
    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...