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
Unwrapping of interferometric phase-fringe maps by the discrete cosine transform
Applied Optics
|November 12, 2010
Summary
Phase unwrapping is essential for interpreting interferometric data. This study demonstrates an iterative, least-squares method using the discrete cosine transform for robust and efficient phase unwrapping in electronic speckle pattern interferometry.
Area of Science:
- Optics and Photonics
- Image Processing
- Metrology
Background:
- Interferometric techniques produce phase data with 2π cyclic discontinuities (phase wraps).
- Phase unwrapping is critical for accurate data interpretation in fields like electronic speckle pattern interferometry (ESPI).
Purpose of the Study:
- To investigate and apply an iterative least-squares phase unwrapping technique based on the discrete cosine transform (DCT).
- To assess the algorithm's performance on ESPI data using standard computer hardware.
Main Methods:
- Implementation of the Ghiglia and Romero iterative least-squares unwrapping algorithm.
- Application of the algorithm to phase data obtained from electronic speckle pattern interferometry.
- Utilizing discrete cosine transform for efficient minimization.
Main Results:
- Successful removal of phase wraps from ESPI data.
- Demonstrated robustness against noise and ability to handle phase inconsistencies.
- Algorithm proved fast and easy to implement on modest personal computer hardware.
- Local errors did not propagate, ensuring data integrity.
Conclusions:
- The iterative least-squares DCT-based phase unwrapping method is effective for ESPI.
- This technique offers a practical solution for accurate interferometric data analysis.
- The algorithm's speed, robustness, and ease of implementation make it suitable for widespread use.
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...
Interference and Diffraction
Interference is a characteristic phenomenon exhibited by waves. When two electromagnetic waves interact with their peaks and troughs coinciding, a resulting wave with enhanced amplitude is produced. This is known as constructive interference. In this case, the two waves interacting are in phase with each other.
Discrete-time Fourier transform
The Discrete-Time Fourier Transform (DTFT) is an essential mathematical tool for analyzing discrete-time signals, converting them from the time domain to the frequency domain. This transformation allows for examining the frequency components of discrete signals, providing insights into their spectral characteristics. In the DTFT, the continuous integral used in the continuous-time Fourier transform is replaced by a summation to accommodate the discrete nature of the signal.
One of the notable...
One of the notable...
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]...
Properties of DTFT I
In signal processing, Discrete-Time Fourier Transforms (DTFTs) play a critical role in analyzing discrete-time signals in the frequency domain. Various properties of the DTFTs such as linearity, time-shifting, frequency-shifting, time reversal, conjugation, and time scaling help understand and manipulate these signals for different applications.
The linearity property of DTFTs is fundamental. If two discrete-time signals are multiplied by constants a and b respectively, and then combined to...
The linearity property of DTFTs is fundamental. If two discrete-time signals are multiplied by constants a and b respectively, and then combined to...
Relation of DFT to z-Transform
The Discrete Fourier Transform (DFT) is a crucial tool for analyzing the frequency content of discrete-time signals. It converts a sequence of N samples from the time domain into its corresponding sequence in the frequency domain, where each sample represents a specific frequency component.
To understand how the DFT works, it's helpful to consider the z-transform, which is a method for representing discrete sequences in the complex frequency domain. The z-transform involves summing the terms of...
To understand how the DFT works, it's helpful to consider the z-transform, which is a method for representing discrete sequences in the complex frequency domain. The z-transform involves summing the terms of...

