@article{Bar-Yehuda_Yavneh_2006, title={A Factor-Two Approximation Algorithm for Two-Dimensional Phase Unwrapping}, volume={10}, url={https://jgaa.info/index.php/jgaa/article/view/paper121}, DOI={10.7155/jgaa.00121}, abstractNote={Two-dimensional phase unwrapping is the problem of deducing
unambiguous "phase" from values known only modulo 2&#960;. Many
authors agree that the objective of phase unwrapping should be to
find a (weighted) minimum of the number of places where adjacent
discretized phase values differ by more than &#960;. This problem,
which is known to be NP-hard, is of considerable practical
interest, largely due to its importance in interpreting data
acquired with synthetic aperture radar (SAR) interferometry.
Consequently, many heuristic algorithms for its approximate
solution have been proposed. Here we present a novel approach to
this problem, based on the local-ratio principle, which guarantees
a solution whose cost is at most twice the minimum sought. <div class="p"><!----></div>}, number={2}, journal={Journal of Graph Algorithms and Applications}, author={Bar-Yehuda, Reuven and Yavneh, Irad}, year={2006}, month={Jan.}, pages={123–139} }