Abstract

We propose a three-dimensional phase unwrapping technique that uses the Hungarian algorithm to join together all the partial residual loops that may occur in a wrapped phase volume. Experimental results have shown that the proposed algorithm is more robust and reliable than other well-known three-dimensional phase unwrapping algorithms. Additionally, the proposed algorithm is fast in terms of computational complexity, which makes it suitable for practical applications.

© 2009 Optical Society of America

Robust three-dimensional best-path phase-unwrapping algorithm that avoids singularity loops

Hussein Abdul-Rahman, Miguel Arevalillo-Herráez, Munther Gdeisat, David Burton, Michael Lalor, Francis Lilley, Christopher Moore, Daniel Sheltraw, and Mohammed Qudeisat
Appl. Opt. 48(23) 4582-4596 (2009)

Hybrid robust and fast algorithm for three-dimensional phase unwrapping

Miguel Arevalillo-Herráez, Munther A. Gdeisat, and David R. Burton
Appl. Opt. 48(32) 6313-6323 (2009)

Fast and robust three-dimensional best path phase unwrapping algorithm

Hussein S. Abdul-Rahman, Munther A. Gdeisat, David R. Burton, Michael J. Lalor, Francis Lilley, and Christopher J. Moore
Appl. Opt. 46(26) 6623-6635 (2007)

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)

Three-dimensional noise-immune phase unwrapping algorithm

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