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

A class of solution-invariant transformations of cost functions for minimum cost flow phase unwrapping

Not Accessible

Your library or personal account may give you access

Abstract

Phase unwrapping (PU) represents an important step in synthetic aperture radar interferometry (InSAR) and other interferometric applications. Among the different PU methods, the so called branch-cut approaches play an important role. In 1996 M. Costantini [Proceedings of the Fringe ’96 Workshop ERS SAR Interferometry (European Space Agency, Munich, 1996), pp. 261–272] proposed to transform the problem of correctly placing branch cuts into a minimum cost flow (MCF) problem. The crucial point of this new approach is to generate cost functions that represent the a priori knowledge necessary for PU. Since cost functions are derived from measured data, they are random variables. This leads to the question of MCF solution stability: How much can the cost functions be varied without changing the cheapest flow that represents the correct branch cuts? This question is partially answered: The existence of a whole linear subspace in the space of cost functions is shown; this subspace contains all cost differences by which a cost function can be changed without changing the cost difference between any two flows that are discharging any residue configuration. These cost differences are called strictly stable cost differences. For quadrangular nonclosed networks (the most important type of MCF networks for interferometric purposes) a complete classification of strictly stable cost differences is presented. Further, the role of the well-known class of node potentials in the framework of strictly stable cost differences is investigated, and information on the vector-space structure representing the MCF environment is provided.

© 2004 Optical Society of America

Full Article  |  PDF Article
More Like This
Equivalence of cost generators for minimum cost flow phase unwrapping

Michael Hubig, Steffen Suchandt, and Nico Adam
J. Opt. Soc. Am. A 19(1) 64-70 (2002)

Edgelist phase unwrapping algorithm for time series InSAR analysis

A. Piyush Shanker and Howard Zebker
J. Opt. Soc. Am. A 27(3) 605-612 (2010)

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)

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 (3)

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 (3)

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 (132)

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