Authors
Reuven Bar-Yehuda, Irad Yavneh
Publication date
2006/1/1
Journal
J. Graph Algorithms Appl.
Volume
10
Issue
2
Pages
123-139
Description
Two-dimensional phase unwrapping is the problem of deducing unambiguous\phase" from values known only modulo 2. Many authors agree that the objective of phase unwrapping should be to nd a (weighted) minimum of the number of places where adjacent discretized phase values di er by more than. 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.
Total citations
2007200811