Related Experiment Video
Updated: Jun 6, 2026

11:34
Subsurface Defect Localization by Structured Heating Using Laser Projected Photothermal Thermography
Published on: May 15, 2017
Comparison of phase-unwrapping algorithms by using gradient of first failure.
Applied Optics
|November 25, 2010
Summary
This study introduces a quantitative method to compare phase-unwrapping algorithms, linking performance to signal-to-noise ratio and gradient of first failure. This enables optimal algorithm selection for noisy data without manual intervention.
Area of Science:
- Image processing
- Computational optics
- Metrology
Background:
- Comparing phase-unwrapping algorithms lacks quantitative metrics.
- Phase-unwrapping performance is affected by noise, phase gradient, and fringe modulation.
Purpose of the Study:
- To establish a quantitative comparison method for phase-unwrapping algorithms.
- To introduce new algorithms with optimized speed-noise trade-offs.
- To demonstrate algorithm robustness on real-world noisy data.
Main Methods:
- Developed a metric based on the gradient of first failure.
- Correlated algorithm performance with signal-to-noise ratio (SNR).
- Introduced three algorithms balancing speed and pixel noise sensitivity.
Main Results:
- The gradient of first failure serves as an indicator for algorithm selection.
- A plot of gradient of first failure versus SNR guides algorithm choice.
- Developed algorithms demonstrated robustness on noisy, live measurement data.
Conclusions:
- Quantitative comparison of phase-unwrapping algorithms is now feasible.
- The gradient of first failure vs. SNR metric aids algorithm selection.
- The introduced algorithms are robust for practical applications with noisy data.
Related Concept Videos
First Derivative Test: Problem Solving
Imagine an asset price that crashes to a low point, rebounds sharply as bargain-hunters step in, and then gradually declines. Such behavior can be modeled with a smooth function whose turning points represent locally overvalued and undervalued regions. A convenient example that captures rebound followed by decay is:The high and low points of this curve are identified using the first derivative test, which determines where the function changes from increasing to decreasing or vice versa. To...
Uniform Depth Channel Flow: Problem Solving
To calculate the flow rate for a trapezoidal channel, first, identify the bottom width, side slope, and flow depth of the channel. The cross-sectional area (A) corresponding to the depth of flow (y), channel bottom width (B), and side slope (θ) is determined by:Next, calculate the wetted perimeter, which includes the bottom width and the sloped side lengths in contact with the water. Using the values of the cross-sectional area and the wetted perimeter, determine the hydraulic radius by...
Second Derivative Test: Problem Solving
In mathematical analysis, finding a function's highest and lowest points is crucial for understanding its behavior. These points, known as critical points, occur where the first derivative is either zero or undefined. Critical points are potential local maxima and minima locations, which can be classified using the Second Derivative Test. However, not every critical point corresponds to a local maximum or minimum. The second derivative is analyzed to classify these points. The second derivative...
Divergence and Curl
The divergence of a vector field at a point is the net outward flow of the flux out of a small volume through a closed surface enclosing the volume, as the volume tends to zero. More practically, divergence measures how much a vector field spreads out or diverges from a given point. For an outgoing flux, conventionally, the divergence is positive. The diverging point is often called the "source" of the field. Meanwhile, the negative divergence of a vector field at a point means that the vector...
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving
Mechanistic models play a crucial role in algorithms for numerical problem-solving, particularly in nonlinear mixed effects modeling (NMEM). These models aim to minimize specific objective functions by evaluating various parameter estimates, leading to the development of systematic algorithms. In some cases, linearization techniques approximate the model using linear equations.
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...