6 February 2014 Phase-unwrapping algorithm by a rounding-least-squares approach
Author Affiliations +
Abstract
A simple and efficient phase-unwrapping algorithm based on a rounding procedure and a global least-squares minimization is proposed. Instead of processing the gradient of the wrapped phase, this algorithm operates over the gradient of the phase jumps by a robust and noniterative scheme. Thus, the residue-spreading and over-smoothing effects are reduced. The algorithm’s performance is compared with four well-known phase-unwrapping methods: minimum cost network flow (MCNF), fast Fourier transform (FFT), quality-guided, and branch-cut. A computer simulation and experimental results show that the proposed algorithm reaches a high-accuracy level than the MCNF method by a low-computing time similar to the FFT phase-unwrapping method. Moreover, since the proposed algorithm is simple, fast, and user-free, it could be used in metrological interferometric and fringe-projection automatic real-time applications.
© 2014 Society of Photo-Optical Instrumentation Engineers (SPIE)
Rigoberto Juarez-Salazar, Carlos Robledo-Sanchez, Fermin Guerrero-Sanchez, "Phase-unwrapping algorithm by a rounding-least-squares approach," Optical Engineering 53(2), 024102 (6 February 2014). https://doi.org/10.1117/1.OE.53.2.024102 . Submission:
JOURNAL ARTICLE
8 PAGES


SHARE
Back to Top