Munther A. Gdeisat

Fast two-dimensional phase-unwrapping algorithm based on sorting by reliability following a noncontinuous path.

We describe what is to our knowledge a novel technique for phase unwrapping. Several algorithms based on unwrapping the most-reliable pixels first have been proposed. These were restricted to continuous paths and were subject to difficulties in defining a starting pixel. The technique described here uses a different type of reliability function and does not follow a continuous path to perform the unwrapping operation. The technique is explained in detail and illustrated with a number of examples.

Fast and robust three-dimensional best path phase unwrapping algorithm

What we believe to be a novel three-dimensional (3D) phase unwrapping algorithm is proposed to unwrap 3D wrapped-phase volumes. It depends on a quality map to unwrap the most reliable voxels first and the least reliable voxels last. The technique follows a discrete unwrapping path to perform the unwrapping process. The performance of this technique was tested on both simulated and real wrapped-phase maps. And it is found to be robust and fast compared with other 3D phase unwrapping algorithms.

Spatial carrier fringe pattern demodulation by use of a two-dimensional continuous wavelet transform

A novel technique that uses a fan two-dimensional (2D) continuous wavelet transform (CWT) to phase demodulate fringe patterns is proposed. The fan 2D CWT algorithm is tested by using computer generated and real fringe patterns. The result of this investigation reveals that the 2D CWT technique is capable of successfully demodulating fringe patterns. The proposed algorithm demodulates fringe patterns without the requirement of removing their background illumination prior to the demodulation process. Also, the algorithm is exceptionally robust against speckle noise. The performance of the 2D CWT technique in fringe pattern demodulation is compared with that of the 1D CWT algorithms. This comparison indicates that the 2D CWT outperforms its 1D counterpart for this application.

Robust, fast, and effective two-dimensional automatic phase unwrapping algorithm based on image decomposition

We describe what is to our knowledge a novel approach to phase unwrapping. Using the principle of unwrapping following areas with similar phase values (homogenous areas), the algorithm reacts satisfactorily to random noise and breaks in the wrap distributions. Execution times for a 512 x 512 pixel phase distribution are in the order of a half second on a desktop computer. The precise value depends upon the particular image under analysis. Two inherent parameters allow tuning of the algorithm to images of different quality and nature.

Spatial fringe pattern analysis using the two-dimensional continuous wavelet transform employing a cost function

We present a novel ridge extraction algorithm for use with the two-dimensional continuous wavelet transform to extract the phase information from a fringe pattern. A cost function is employed for the detection of the ridge. The results of the proposed algorithm on simulated and real fringe patterns are illustrated. Moreover, the proposed algorithm outperforms the maximum ridge extraction algorithm and it is found to be robust and reliable.

Two-dimensional phase unwrapping using a hybrid genetic algorithm

A novel hybrid genetic algorithm (HGA) is proposed to solve the branch-cut phase unwrapping problem. It employs both local and global search methods. The local search is implemented by using the nearest-neighbor method, whereas the global search is performed by using the genetic algorithm. The branch-cut phase unwrapping problem [a nondeterministic polynomial (NP-hard) problem] is implemented in a similar way to the traveling-salesman problem, a very-well-known combinational optimization problem with profound research and applications. The performance of the proposed algorithm was tested on both simulated and real wrapped phase maps. The HGA is found to be robust and fast compared with three well-known branch-cut phase unwrapping algorithms.

Ridge extraction algorithms for one-dimensional continuous wavelet transform: a comparison

This paper compares between three different algorithms that are used in detecting the phase of a fringe pattern from the ridge of its wavelet transform. A Morlet wavelet is adapted for the continuous wavelet transform of the fringe pattern. A numerical simulation is used to perform this comparison.

Real-time fringe pattern demodulation with a second-order digital phase-locked loop

The use of a second-order digital phase-locked loop (DPLL) to demodulate fringe patterns is presented. The second-order DPLL has better tracking ability and more noise immunity than the first-order loop. Consequently, the second-order DPLL is capable of demodulating a wider range of fringe patterns than the first-order DPLL. A basic analysis of the first- and the second-order loops is given, and a performance comparison between the first- and the second-order DPLLs in analyzing fringe patterns is presented. The implementation of the second-order loop in real time on a commercial parallel image processing system is described. Fringe patterns are grabbed and processed, and the resultant phase maps are displayed concurrently.

Residue vector, an approach to branch-cut placement in phase unwrapping: theoretical study

What we believe to be a novel technique of branch-cut placement in the phase unwrapping is proposed. This approach is based on what we named residue vector, which is generated by a residue in a wrapped phase map and has an orientation that points out toward the balancing residue of opposite polarity. The residue vector can be used to guide the manner in which branch cuts are placed in phase unwrapping. Also, residue vector can be used for the determination of the weighting values used in different existing phase unwrapping methods such as minimum cost flow and least squares. The theoretical foundations of the residue-vector method are presented, and a branch-cut method using its information is developed and implemented. A general comparison is made between the residue-vector map and other existing quality maps.

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 MST is built according to the quality of the voxels and avoids crossing the branch-cut surfaces determined at the first step. The resulting technique shows a higher robustness than any of the two methods used in isolation. On the one hand, the 3D MST algorithm benefits from the branch-cut surfaces, which endows it with a higher robustness to noise and open-ended wraps. On the other hand, incorrectly placed surfaces due to open loops at the boundaries in the branch-cut surface approach disappear.