Related Experiment Video

Updated: Jul 19, 2026

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

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

Published on: May 30, 2016

Fourier transform magnitudes are unique pattern recognition templates

P H Gardenier, B C McCallum, R H Bates

    Biological Cybernetics
    |January 1, 1986
    PubMed

    More Related Videos

    Shaping the Amplitude and Phase of Laser Beams by Using a Phase-only Spatial Light Modulator08:39

    Shaping the Amplitude and Phase of Laser Beams by Using a Phase-only Spatial Light Modulator

    Published on: January 28, 2019

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

    A Multimodal Wide-Field Fourier-Transform Raman Microscope

    Published on: December 30, 2025

    Related Concept Videos

    Properties of Fourier series I01:20

    Properties of Fourier series I

    The Fourier series is a powerful tool in signal processing and communications, allowing periodic signals to be expressed as sums of sine and cosine functions. A foundational property of the Fourier series is linearity. If we consider two periodic signals, their linear combination results in a new signal whose Fourier coefficients are simply the corresponding linear combinations of the original signals' coefficients. This property is crucial in applications like frequency modulation (FM) radio,...
    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...
    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...
    Basic signals of Fourier Transform01:07

    Basic signals of Fourier Transform

    The Fourier Transform is a pivotal mathematical tool in signal processing, enabling the transformation of time-domain signals into their frequency-domain representations. Among the numerous elements within this domain, certain functions like the sinc function, delta function, and exponential signals hold significant importance due to their unique properties and implications.
    The sinc function, defined as sinc(x) = sin(πx)/(πx), is particularly notable for its symmetry and behavior at zero. It...
    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...
    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...