Abstract

An algorithm for unwrapping noisy phase maps has recently been proposed, based on the identification of discontinuity sources that mark the start or end of a 2π phase discontinuity. Branch cuts between sources act as barriers to unwrapping, resulting in a unique phase map that is independent of the unwrapping route. We investigate four methods for optimizing the placement of the cuts. A modified nearest neighbor approach is found to be the most successful and can reliably unwrap unfiltered speckle-interferometry phase maps with discontinuity source densities of 0.05 sources pixel⁻¹.

© 1995 Optical Society of America

Unwrapping noisy phase maps by use of a minimum-cost-matching algorithm

J. R. Buckland, J. M. Huntley, and S. R. E. Turner
Appl. Opt. 34(23) 5100-5108 (1995)

Three-dimensional noise-immune phase unwrapping algorithm

Jonathan M. Huntley
Appl. Opt. 40(23) 3901-3908 (2001)

Noise-immune phase unwrapping algorithm

J. M. Huntley
Appl. Opt. 28(16) 3268-3270 (1989)

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)

Proposed algorithm for phase unwrapping

Xiao Yuan He, Xin Kang, Cho Jui Tay, Chenggen Quan, and Huai Min Shang
Appl. Opt. 41(35) 7422-7428 (2002)