Abstract

The moment-based phase unwrapping algorithm approximates the phase map as a product of Gegenbauer polynomials, but the weight function for the Gegenbauer polynomials generates artificial singularities along the edge of the phase map. A method is presented to remove the singularities inherent to the moment-based phase unwrapping algorithm by approximating the phase map as a product of two one-dimensional Legendre polynomials and applying a recursive property of derivatives of Legendre polynomials. The proposed phase unwrapping algorithm is tested on simulated and experimental data sets. The results are then compared to those of PRELUDE 2D, a widely used phase unwrapping algorithm, and a Chebyshev-polynomial-based phase unwrapping algorithm. It was found that the proposed phase unwrapping algorithm provides results that are comparable to those obtained by using PRELUDE 2D and the Chebyshev phase unwrapping algorithm.

© 2010 Optical Society of America

Temporal phase unwrapping for fringe projection profilometry aided by recursion of Chebyshev polynomials

Shuo Xing and Hongwei Guo
Appl. Opt. 56(6) 1591-1602 (2017)

Clustering-based robust three-dimensional phase unwrapping algorithm

Miguel Arevalillo-Herráez, David R. Burton, and Michael J. Lalor
Appl. Opt. 49(10) 1780-1788 (2010)

Reliable phase unwrapping algorithm based on rotational and direct compensators

Samia Heshmat, Satoshi Tomioka, and Shusuke Nishiyama
Appl. Opt. 50(33) 6225-6233 (2011)

Phase unwrapping algorithm based on a rank information filter

Xianming Xie, Yuanyuan Liu, Zhaoyu Shou, Qingning Zeng, Guofu Wang, Qingnan Huang, and Xi Gao
Appl. Opt. 60(22) 6648-6658 (2021)

Phase unwrapping method based on improved quadratic pseudo-Boolean optimization

Hongxing Hao, Lingda Wu, and Ronghuan Yu
Appl. Opt. 58(19) 5347-5352 (2019)