Abstract

Maximum a posteriori estimation of Markov random fields (MRFs) is a popular research area in computer vision, and many algorithms have been proposed to deal with these types of problems. The phase-unwrapping problem is modeled as the optimization of MRFs in this research, and the binary algorithm, improved quadratic pseudo-Boolean optimization, is utilized to solve the phase-unwrapping problem. Both the interferometric phases generated from the commonly used computer simulated surfaces and also real terrains are researched in the experimental section, and the unwrapping results are compared. The proposed algorithm achieves unwrapping results comparable to the state-of-the-art unwrapping method but costs less time for large-scale phase images.

© 2019 Optical Society of America

CAPE: combinatorial absolute phase estimation

Gonçalo Valadão and José Bioucas-Dias
J. Opt. Soc. Am. A 26(9) 2093-2106 (2009)

Weighted least-squares phase-unwrapping algorithm based on the orientation coherence for discontinuous optical phase patterns

Biyuan Li, Chen Tang, Qiuling Zhou, and Zhenkun Lei
Appl. Opt. 58(2) 219-226 (2019)

Absolute phase estimation: adaptive local denoising and global unwrapping

Jose Bioucas-Dias, Vladimir Katkovnik, Jaakko Astola, and Karen Egiazarian
Appl. Opt. 47(29) 5358-5369 (2008)

Direct phase unwrapping method based on a local third-order polynomial fit

Alejandro Téllez-Quiñones, Ricardo Legarda-Sáenz, Adán Salazar-Garibay, Juan C. Valdiviezo-N, and Miguel León-Rodríguez
Appl. Opt. 58(2) 436-445 (2019)

Simple phase unwrapping method with continuous convex minimization

Songzhe Lian, Haiquan Yang, and Hiroyuki Kudo
Opt. Express 30(18) 33395-33411 (2022)