Robust Phase-unwrapping Algorithm Using a Spatial Binary-tree Image Decomposition
Document Type
Article
Publication Date
7-1998
Publication Source
Applied Optics
Abstract
The search for fast and robust phase-unwrapping algorithms remains an important problem in the development of real-time interferometric systems. Our phase-unwrapping approach uses a spatial binary-tree image decomposition to permit maximum parallelism in implementation. At each node in the tree structure, a single unwrapping decision is made between two image blocks. The unwrapping rule is derived from a statistical-estimation framework. Specifically, a maximum-likelihood estimate of the demodulation term is used. This term can be viewed as that which minimizes a discontinuity-penalizing cost function. We show that the algorithm exhibits a high level of robustness. Quantitative measures of performance are provided, and many phase maps are shown for subjective evaluation.
Inclusive pages
4468-4476
ISBN/ISSN
1559-128X
Publisher
OSA: The Optical Society
Volume
37
Peer Reviewed
yes
Issue
20
eCommons Citation
Hardie, Russell C.; Younus, Md. Ibqual; and Blackshire, James Lawrence, "Robust Phase-unwrapping Algorithm Using a Spatial Binary-tree Image Decomposition" (1998). Electrical and Computer Engineering Faculty Publications. 80.
https://ecommons.udayton.edu/ece_fac_pub/80
COinS
