Expand this Topic clickable element to expand a topic
Skip to content
Optica Publishing Group

Network approaches to two-dimensional phase unwrapping: intractability and two new algorithms

Not Accessible

Your library or personal account may give you access

Abstract

Two-dimensional (2-D) phase unwrapping, that is, deducing unambiguous phase values from a 2-D array of values known only modulo 2π, is a key step in interpreting data acquired with synthetic aperture radar interferometry. Noting the recent network formulation of the phase unwrapping problem, we apply here some well-established ideas of network theory to formalize the problem, analyze its complexity, and derive algorithms for its solution. It has been suggested that the objective of phase unwrapping should be to minimize the total number of places where unwrapped and wrapped phase gradients differ. Here we use network constructions to show that this so-called minimum L0-norm problem is NP-hard, or one that complexity theory suggests is impossible for efficient algorithms to solve exactly. Therefore we must instead find approximate solutions; we present two new algorithms for doing so. The first uses the network ideas of shortest paths and spanning trees to improve on the Goldstein et al. residue-cut algorithm [Radio Sci. 23, 713 (1988)]. Our improved algorithm is very fast, provides complete coverage, and allows user-defined weights. With our second algorithm, we extend the ideas of linear network flow problems to the nonlinear L0 case. This algorithm yields excellent approximations to the minimum L0 norm. Using interferometric data, we demonstrate that our algorithms are highly competitive with other existing algorithms in speed and accuracy, outperforming them in the cases presented here.

© 2000 Optical Society of America

Full Article  |  PDF Article

Corrections

Curtis W. Chen and Howard A. Zebker, "Network approaches to two-dimensional phase unwrapping: intractability and two new algorithms: erratum," J. Opt. Soc. Am. A 18, 1192-1192 (2001)
https://opg.optica.org/josaa/abstract.cfm?uri=josaa-18-5-1192

More Like This
Two-dimensional phase unwrapping with use of statistical models for cost functions in nonlinear optimization

Curtis W. Chen and Howard A. Zebker
J. Opt. Soc. Am. A 18(2) 338-351 (2001)

Network approaches to two-dimensional phase unwrapping: intractability and two new algorithms: erratum

Curtis W. Chen and Howard A. Zebker
J. Opt. Soc. Am. A 18(5) 1192-1192 (2001)

Minimum Lp-norm two-dimensional phase unwrapping

Dennis C. Ghiglia and Louis A. Romero
J. Opt. Soc. Am. A 13(10) 1999-2013 (1996)

Cited By

You do not have subscription access to this journal. Cited by links are available to subscribers only. You may subscribe either as an Optica member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Login to access Optica Member Subscription

Figures (13)

You do not have subscription access to this journal. Figure files are available to subscribers only. You may subscribe either as an Optica member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Login to access Optica Member Subscription

Tables (2)

You do not have subscription access to this journal. Article tables are available to subscribers only. You may subscribe either as an Optica member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Login to access Optica Member Subscription

Equations (4)

You do not have subscription access to this journal. Equations are available to subscribers only. You may subscribe either as an Optica member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Login to access Optica Member Subscription

Select as filters


Select Topics Cancel
© Copyright 2024 | Optica Publishing Group. All Rights Reserved