Abstract

Use of mean-field annealing theory is proposed for solving the phase-unwrapping (PU) problem. PU is formulated as a constrained optimization problem for the field of integer corrections to be added to the wrapped gradient field. A deterministic algorithm is described to provide an approximation of the average of the correction field over the global minima of the cost function. The proposed algorithm can be applied for any choice of the cost function. Using a cost function based on second-order differences, we obtain results close to those from simulated annealing and spend less computational time.

© 1999 Optical Society of America

New regularization scheme for phase unwrapping

Luciano Guerriero, Giovanni Nico, Guido Pasquariello, and Sebastiano Stramaglia
Appl. Opt. 37(14) 3053-3058 (1998)

Phase unwrapping with the branch-cut method: clustering of discontinuity sources and reverse simulated annealing

Bernd Gutmann and Herbert Weber
Appl. Opt. 38(26) 5577-5593 (1999)

Two-dimensional phase unwrapping using a hybrid genetic algorithm

Salah A. Karout, Munther A. Gdeisat, David R. Burton, and Michael J. Lalor
Appl. Opt. 46(5) 730-743 (2007)

Phase unwrapping by means of genetic algorithms

Antonio Collaro, Giorgio Franceschetti, Francesco Palmieri, and Maria Sedes Ferreiro
J. Opt. Soc. Am. A 15(2) 407-418 (1998)

Unscented information filtering phase unwrapping algorithm for interferometric fringe patterns

Xianming Xie and Gaoxing Dai
Appl. Opt. 56(34) 9423-9434 (2017)