Abstract

What we believe to be a novel three-dimensional (3D) phase unwrapping algorithm is proposed to unwrap 3D wrapped-phase volumes. It depends on a quality map to unwrap the most reliable voxels first and the least reliable voxels last. The technique follows a discrete unwrapping path to perform the unwrapping process. The performance of this technique was tested on both simulated and real wrapped-phase maps. And it is found to be robust and fast compared with other 3D phase unwrapping algorithms.

© 2007 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)

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)

Fast two-dimensional phase-unwrapping algorithm based on sorting by reliability following a noncontinuous path

Miguel Arevallilo Herráez, David R. Burton, Michael J. Lalor, and Munther A. Gdeisat
Appl. Opt. 41(35) 7437-7444 (2002)

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)