Related Experiment Video
Updated: Jun 6, 2026
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
Applied Optics
|November 12, 2010
Summary
This study introduces an automated method using fast Fourier transform (FFT) and phase iteration to analyze Young's fringe patterns. The technique accurately determines displacement magnitude and direction from fringe data.
Area of Science:
- Optics and Photonics
- Materials Science
- Image Processing
Background:
- Young's fringe patterns are crucial for measuring material deformation and displacement.
- Accurate analysis of fringe patterns is essential for quantitative phase imaging and metrology.
- Existing methods for fringe analysis can be complex and time-consuming.
Purpose of the Study:
- To develop an automated and efficient technique for analyzing Young's fringe patterns.
- To combine Fast Fourier Transform (FFT) filtering, phase iteration, and least-square fitting for robust phase extraction.
- To accurately determine the magnitude and direction of displacement from analyzed fringe patterns.
Main Methods:
- Application of Fast Fourier Transform (FFT) filtering to Young's fringe patterns for initial phase estimation.
- Utilizing phase iteration to refine and improve the accuracy of the extracted phase information.
- Employing a least-square fit to a phase plane for comprehensive phase data analysis.
Main Results:
- Successful implementation of an automated processing technique for Young's fringe pattern analysis.
- Accurate determination of the initial phase from filtered fringe patterns.
- Reliable extraction of displacement magnitude and direction using the phase plane.
Conclusions:
- The combined FFT, phase iteration, and least-square fit method provides an effective automated solution for Young's fringe analysis.
- This technique enhances the efficiency and accuracy of displacement measurement in optical metrology.
- The method has potential applications in various fields requiring precise deformation analysis.
Related Concept Videos
01:21Convergence 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...
01:10Fast 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...
01:11Continuous -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...
01:21Properties 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...
A function f(t) is...
01:26Phase 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...
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...
01:15Discrete 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...