0000000000066859
AUTHOR
Munther A. Gdeisat
A spatial algorithm to reduce phase wraps from two dimensional signals in fringe projection profilometry
© 2015 Elsevier Ltd. All rights reserved. In this paper, we present a novel algorithm to reduce the number of phase wraps in two dimensional signals in fringe projection profilometry. The technique operates in the spatial domain, and achieves a significant computational saving with regard to existing methods based on frequency shifting. The method works by estimating the modes of the first differences distribution in each axial direction. These are used to generate a tilted plane, which is subtracted from the entire phase map. Finally, the result is re-wrapped to obtain a phase map with fewer wraps. The method may be able to completely eliminate the phase wraps in many cases, or can achieve…
Fast fringe pattern phase demodulation using FIR Hilbert transformers
This paper suggests the use of FIR Hilbert transformers to extract the phase of fringe patterns. This method is computationally faster than any known spatial method that produces wrapped phase maps. Also, the algorithm does not require any parameters to be adjusted which are dependent upon the specific fringe pattern that is being processed, or upon the particular setup of the optical fringe projection system that is being used. It is therefore particularly suitable for full algorithmic automation. The accuracy and validity of the suggested method has been tested using both computer-generated and real fringe patterns. This novel algorithm has been proposed for its advantages in terms of com…
Hybrid robust and fast algorithm for three-dimensional phase unwrapping
We present a hybrid three-dimensional (3D) unwrapping algorithm that combines the strengths of two other fast and robust existing techniques. In particular, a branch-cut surface algorithm and a path-following method have been integrated in a symbiotic way, still keeping execution times within a range that permits their use in real-time applications that need a relatively fast solution to the problem. First, branch-cut surfaces are calculated, disregarding partial residue loops that end at the boundary of the 3D phase volume. These partial loops are then used to define a quality for each image voxel. Finally, unwrapping proceeds along a path determined by a minimum spanning tree (MST). The M…
Shifting of wrapped phase maps in the frequency domain using a rational number
The number of phase wraps in an image can be either reduced, or completely eliminated, by transforming the image into the frequency domain using a Fourier transform, and then shifting the spectrum towards the origin. After this, the spectrum is transformed back to the spatial domain using the inverse Fourier transform and finally the phase is extracted using the arctangent function. However, it is a common concern that the spectrum can be shifted only by an integer number, meaning that the phase wrap reduction is often not optimal. In this paper we propose an algorithm than enables the spectrum to be frequency shifted by a rational number. The principle of the proposed method is confirmed b…
Robust three-dimensional best-path phase-unwrapping algorithm that avoids singularity loops.
In this paper we propose a novel hybrid three-dimensional phase-unwrapping algorithm, which we refer to here as the three-dimensional best-path avoiding singularity loops (3DBPASL) algorithm. This algorithm combines the advantages and avoids the drawbacks of two well-known 3D phase-unwrapping algorithms, namely, the 3D phase-unwrapping noise-immune technique and the 3D phase-unwrapping best-path technique. The hybrid technique presented here is more robust than its predecessors since it not only follows a discrete unwrapping path depending on a 3D quality map, but it also avoids any singularity loops that may occur in the unwrapping path. Simulation and experimental results have shown that …
Aiding phase unwrapping by increasing the number of residues in two-dimensional wrapped-phase distributions.
In phase unwrapping residues are points of locally inconsistent phase that occur within a wrapped-phase map, which are usually regarded as being problematic for phase-unwrapping algorithms. Real phase maps typically contain a number of residues that are approximately proportional to the subsequent difficulty in unwrapping the phase distribution. This paper suggests the radical use of the discrete Fourier transform to actually increase the number of residues in 2D phase-wrapped images that contain discontinuities. Many of the additional residues that are artificially generated by this method are located on these discontinuities. For example, in fringe projection systems, such phase discontin…
Three-dimensional phase unwrapping using the Hungarian algorithm.
We propose a three-dimensional phase unwrapping technique that uses the Hungarian algorithm to join together all the partial residual loops that may occur in a wrapped phase volume. Experimental results have shown that the proposed algorithm is more robust and reliable than other well-known three-dimensional phase unwrapping algorithms. Additionally, the proposed algorithm is fast in terms of computational complexity, which makes it suitable for practical applications.
A Robust and Simple Measure for Quality-Guided 2D Phase Unwrapping Algorithms
Quality-based 2D phase unwrapping algorithms provide one of the best tradeoffs between speed and quality of results. Their robustness depends on a quality map, which is used to build a path that visits the most reliable pixels first. Unwrapping then proceeds along this path, delaying unwrapping of noisy and inconsistent areas until the end, so that the unwrapping errors remain local. We propose a novel quality measure that is consistent, technically sound, effective, fast to compute, and immune to the presence of a carrier signal. The new measure combines the benefits of both the quality-guided and the residue-based phase unwrapping approaches. The quality map is justified from the two diff…