OSA's Digital Library

Journal of the Optical Society of America A

Journal of the Optical Society of America A

| OPTICS, IMAGE SCIENCE, AND VISION

  • Vol. 17, Iss. 3 — Mar. 1, 2000
  • pp: 401–414

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

Curtis W. Chen and Howard A. Zebker  »View Author Affiliations


JOSA A, Vol. 17, Issue 3, pp. 401-414 (2000)
http://dx.doi.org/10.1364/JOSAA.17.000401


View Full Text Article

Enhanced HTML    Acrobat PDF (364 KB)





Browse Journals / Lookup Meetings

Browse by Journal and Year


   


Lookup Conference Papers

Close Browse Journals / Lookup Meetings

Article Tools

Share
Citations

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

OCIS Codes
(120.3180) Instrumentation, measurement, and metrology : Interferometry
(280.6730) Remote sensing and sensors : Synthetic aperture radar
(350.5030) Other areas of optics : Phase

History
Original Manuscript: June 18, 1999
Revised Manuscript: October 12, 1999
Manuscript Accepted: October 14, 1999
Published: March 1, 2000

Citation
Curtis W. Chen and Howard A. Zebker, "Network approaches to two-dimensional phase unwrapping: intractability and two new algorithms," J. Opt. Soc. Am. A 17, 401-414 (2000)
http://www.opticsinfobase.org/josaa/abstract.cfm?URI=josaa-17-3-401

You do not have subscription access to this journal. Citation lists with outbound citation links are available to subscribers only. You may subscribe either as an OSA member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Log in to access OSA Member Subscription

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

Contact your librarian or system administrator
or
Log in to access OSA Member Subscription

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

Contact your librarian or system administrator
or
Log in to access OSA Member Subscription

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

Contact your librarian or system administrator
or
Log in to access OSA Member Subscription

« Previous Article  |  Next Article »

OSA is a member of CrossRef.

CrossCheck Deposited