Related Experiment Video
Updated: Jun 14, 2026

06:48
A Multimodal Wide-Field Fourier-Transform Raman Microscope
Published on: December 30, 2025
Numerical processing of speckle photography data by Fourier transform
Applied Optics
|April 8, 2010
Summary
Removing the diffraction halo during digital speckle pattern interferometry is crucial. Failure to do so introduces displacement errors, especially with low fringe visibility and density.
Area of Science:
- Optical Metrology
- Digital Image Processing
Background:
- Digital speckle pattern interferometry (DSPI) is a non-contact optical method for measuring surface displacements.
- Numerical processing of specklegrams, particularly via discrete Fourier transform (DFT), is essential for extracting displacement data.
- The diffraction halo in specklegrams can influence the accuracy of displacement measurements.
Purpose of the Study:
- To investigate the impact of diffraction halo removal on the accuracy of displacement measurements obtained from double-exposed specklegrams using DFT.
- To quantify the relative errors introduced by neglecting diffraction halo removal.
Main Methods:
- A 1-D analysis of double-exposed specklegrams was performed.
- The discrete Fourier transform (DFT) was employed for numerical processing.
- The influence of diffraction halo removal on displacement data was systematically evaluated.
Main Results:
- Relative errors in displacement measurements were observed when the diffraction halo was not removed.
- These errors increased with decreasing fringe visibility and fringe density.
- Errors were found to be less than 0.5% for fringe densities exceeding six fringes within the diffraction halo.
Conclusions:
- Accurate numerical processing of specklegrams requires proper handling of the diffraction halo.
- Neglecting diffraction halo removal can lead to significant errors in displacement determination, particularly under challenging fringe conditions.
- The study provides quantitative insights into the error margins associated with diffraction halo presence in DSPI data processing.
More Related Videos
Related Concept Videos
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 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)log2N multiplications, offering a much faster performance.
The computational efficiency of the FFT becomes...
The computational efficiency of the FFT becomes...
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...
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...
The Gibbs phenomenon refers to the persistent oscillations and overshoots that occur near discontinuities...
Upsampling
Managing signal sampling rates is essential in digital signal processing to maintain signal integrity. A decimated signal, characterized by a reduced frequency range due to its lower sampling rate, can be upsampled by inserting zeros between each sample. This upsampling process expands the original spectrum and introduces repeated spectral replicas at intervals dictated by the new Nyquist frequency. To refine this zero-inserted sequence, it is passed through a lowpass filter with a cutoff...
Discrete-Time Fourier Series
The Discrete-Time Fourier Series (DTFS) is a fundamental concept in signal processing, serving as the discrete-time counterpart to the continuous-time Fourier series. It allows for the representation and analysis of discrete-time periodic signals in terms of their frequency components. Unlike its continuous counterpart, which utilizes integrals, the calculation of DTFS expansion coefficients involves summations due to the discrete nature of the signal.
For a discrete-time periodic signal x[n]...
For a discrete-time periodic signal x[n]...

