TY - JOUR
AU - Bar-Yehuda, Reuven
AU - Yavneh, Irad
PY - 2006/01/01
Y2 - 2024/10/05
TI - A Factor-Two Approximation Algorithm for Two-Dimensional Phase Unwrapping
JF - Journal of Graph Algorithms and Applications
JA - JGAA
VL - 10
IS - 2
SE -
DO - 10.7155/jgaa.00121
UR - https://jgaa.info/index.php/jgaa/article/view/paper121
SP - 123-139
AB - Two-dimensional phase unwrapping is the problem of deducingunambiguous "phase" from values known only modulo 2π. Manyauthors agree that the objective of phase unwrapping should be tofind a (weighted) minimum of the number of places where adjacentdiscretized phase values differ by more than π. This problem,which is known to be NP-hard, is of considerable practicalinterest, largely due to its importance in interpreting dataacquired with synthetic aperture radar (SAR) interferometry.Consequently, many heuristic algorithms for its approximatesolution have been proposed. Here we present a novel approach tothis problem, based on the local-ratio principle, which guaranteesa solution whose cost is at most twice the minimum sought.<div class="p"><!----></div>
ER -