PubMed Health⌕ Search

Biomedical subjects

H A Zebker

Publications and source records attributed to H A Zebker.

2 recordsLinked to original sources

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

Interferometric radar techniques often necessitate two-dimensional (2-D) phase unwrapping, defined here as the estimation of unambiguous phase data from a 2-D array known only modulo 2pi rad. We develop a maximum a posteriori probability (MAP) estimation approach for this problem, and we derive an algorithm that approximately maximizes the conditional probability of its phase-unwrapped solution given observable quantities such as wrapped phase, image intensity, and interferogram coherence. Examining topographic and differential interferometry separately, we derive simple, working models for the joint statistics of the estimated and the observed signals. We use generalized, nonlinear cost functions to reflect these probability relationships, and we employ nonlinear network-flow techniques to approximate MAP solutions. We apply our algorithm both to a topographic interferogram exhibiting rough terrain and layover and to a differential interferogram measuring the deformation from a large earthquake. The MAP solutions are complete and are more accurate than those of other tested algorithms.

Journal Article↗

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

Two-dimensional (2-D) phase unwrapping, that is, deducing unambiguous phase values from a 2-D array of values known only modulo 2pi, 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.

Algorithms↗