✦ LIBER ✦

Clustering-based robust three-dimensional phase unwrapping algorithm

✍ Scribed by Arevalillo-Herráez, Miguel ;Burton, David R. ;Lalor, Michael J.

Book ID: 115355032
Publisher: The Optical Society
Year: 2010
Tongue: English
Weight: 953 KB
Volume: 49
Category: Article
ISSN: 1559-128X
DOI: 10.1364/AO.49.001780

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Three-dimensional noise-immune phase unw

Three-dimensional noise-immune phase unwrapping algorithm

✍ Huntley, Jonathan M. 📂 Article 📅 2001 🏛 The Optical Society 🌐 English ⚖ 317 KB

Three-dimensional phase unwrapping using

Three-dimensional phase unwrapping using the Hungarian algorithm

✍ Gdeisat, Munther; Arevalillo-Herráez, Miguel; Burton, David; Lilley, Francis 📂 Article 📅 2009 🏛 Optical Society of America 🌐 English ⚖ 240 KB

A generalized temporal phase unwrapping

A generalized temporal phase unwrapping algorithm for three-dimensional profilometry

✍ Jindong Tian; Xiang Peng; Xiaobo Zhao 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 743 KB

Automatic phase unwrapping algorithm for

Automatic phase unwrapping algorithm for reconstruction of three-dimensional objects

✍ Zhang, Hong; Su, Hongjun; Su, Xian-yu 📂 Article 📅 2007 🏛 Optical Society of America 🌐 English ⚖ 194 KB

Phase-unwrapping algorithm for the measu

Phase-unwrapping algorithm for the measurement of three-dimensional object shapes

✍ Zhao, Hong ;Chen, Wenyi ;Tan, Yushan 📂 Article 📅 1994 🏛 The Optical Society 🌐 English ⚖ 724 KB

Fast, automated, N-dimensional phase-unw

Fast, automated, N-dimensional phase-unwrapping algorithm

✍ Mark Jenkinson 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 299 KB

## Abstract This work investigates the general problem of phase unwrapping for arbitrary __N__‐dimensional phase maps. A cost function‐based approach is outlined that leads to an integer programming problem. To solve this problem, a best‐pair‐first region merging approach is adopted as the optimiza