Abstract

Phase unwrapping has been and still is a cumbersome concern that involves the resolution of several different problems. When dealing with two-dimensional phase unwrapping in fringe analysis, the final objective is, in many cases, the realization of that analysis in real time. Many algorithms have been developed to carry out the unwrapping process, with some giving satisfactory results even when high levels of noise are present in the image. However, these algorithms are often time consuming and far removed from the goal of real-time fringe analysis. A new approach to the construction of a simple and fast algorithm for two-dimensional unwrapping that has considerable potential for parallel implementation is presented.

© 1996 Optical Society of America

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)

Robust, fast, and effective two-dimensional automatic phase unwrapping algorithm based on image decomposition

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

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

Robust phase-unwrapping algorithm with a spatial binary-tree image decomposition

Russell C. Hardie, Md. Iqbal Younus, and James Blackshire
Appl. Opt. 37(20) 4468-4476 (1998)