Robust, simple, and fast algorithm for phase unwrapping

Abstract

Phase unwrapping has been and still is a cumbersome concern that involves the resolution of several different problems. When dealing with two-dimensional phase unwrapping in fringe analysis, the final objective is, in many cases, the realization of that analysis in real time. Many algorithms have been developed to carry out the unwrapping process, with some giving satisfactory results even when high levels of noise are present in the image. However, these algorithms are often time consuming and far removed from the goal of real-time fringe analysis. A new approach to the construction of a simple and fast algorithm for two-dimensional unwrapping that has considerable potential for parallel implementation is presented.

Fast and robust three-dimensional best path phase unwrapping algorithm

“…The main idea of these algorithms is to unwrap the highest quality pixels first and the lowest quality pixels last to prevent error propagation during the unwrapping process [6,7]. The success or failure of these algorithms depends strongly on the production of a good quality map.…”

Virtual pyramid wavefront sensor for phase unwrapping

“…The sources of noise are inherent diffraction, light source fluctuations, aberrations due to the sample and the optical system. Noise can be overcome by smartly avoiding noisy pixels in a branch cut phase unwrapping algorithm [1], although this fails if the noise is high [5][6][7][8][9][10][11]. Filtering is often used to reduce noise and such an operation allows smoothening near the phase jumps and elimination of potential useful information, which could adversely affect phase unwrapping [12].…”

Robust three-dimensional best-path phase-unwrapping algorithm that avoids singularity loops

“…These can generally be classified into four major categories: global errorminimization methods [2,3], residue-balancing methods [4,5], quality-guided algorithms [6][7][8], and the use of calculated phase wrap regions [9]. A thorough review of the two-dimensional phase-unwrapping problem has been presented in a book by Ghiglia and Pritt [1].…”

“…The main idea of these algorithms is to phase unwrap the highest quality pixels first and the lowest quality pixels last, thereby preventing error propagation during the unwrapping process [6,7]. To this end, a quality map needs to be defined.…”