, Volume 11, Issue 2, pp 89-100
Date: 28 Apr 2007

A multilevel graph algorithm for two dimensional phase unwrapping

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access


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 find a weighted minimum of the number of places where adjacent (discrete) phase values differ by more than π (called discontinuities). This NP-hard problem is of considerable practical interest, largely due to its importance in interpreting data acquired with synthetic aperture radar (SAR) interferometry. Consequently, many heuristic algorithms have been proposed. We present an efficient multi-level graph algorithm for the approximate solution of an equivalent problem—minimal residue cut in the dual graph.

Communicated by P. Hemker.