Abstract

An algorithm for unwrapping noisy phase maps by means of branch cuts has been proposed recently. These cuts join discontinuity sources that mark the beginning or end of a 2π phase discontinuity. After the placement of branch cuts, the unwrapped phase map is unique and independent of the unwrapping route. We show how a minimum-cost-matching graph-theory method can be used to find the set of cuts that has the global minimum of total cut length, in time approximately proportional to the square of the number of sources. The method enables one to unwrap unfiltered speckle-interferometry phase maps at higher source densities (0.1 sources pixel⁻¹) than any previous branch-cut placement algorithm.

© 1995 Optical Society of America

Improved noise-immune phase-unwrapping algorithm

R. Cusack, J. M. Huntley, and H. T. Goldrein
Appl. Opt. 34(5) 781-789 (1995)

Characterization of sources of 2π phase discontinuity in speckle interferograms

J. M. Huntley and J. R. Buckland
J. Opt. Soc. Am. A 12(9) 1990-1996 (1995)

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)

Unwrapping of digital speckle-pattern interferometry phase maps by use of a minimum L⁰-norm algorithm

Pablo D. Ruiz, Guillermo H. Kaufmann, and Gustavo E. Galizzi
Appl. Opt. 37(32) 7632-7644 (1998)

Residue vector, an approach to branch-cut placement in phase unwrapping: theoretical study

Salah A. Karout, Munther A. Gdeisat, David R. Burton, and Michael J. Lalor
Appl. Opt. 46(21) 4712-4727 (2007)