Interferometric synthetic aperture radar phase unwrapping based on sparse Markov random fields by graph cuts

  • Zhou L
  • Chai D
  • Xia Y
  • et al.
1Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.

Abstract

© The Authors. Published by SPIE under a Creative Commons Attribution 3.0 Unported License. Phase unwrapping (PU) is one of the key processes in reconstructing the digital elevation model of a scene from its interferometric synthetic aperture radar (InSAR) data. It is known that two-dimensional (2-D) PU problems can be formulated as maximum a posteriori estimation of Markov random fields (MRFs). However, considering that the traditional MRF algorithm is usually defined on a rectangular grid, it fails easily if large parts of the wrapped data are dominated by noise caused by large low-coherence area or rapid-topography variation. A PU solution based on sparse MRF is presented to extend the traditional MRF algorithm to deal with sparse data, which allows the unwrapping of InSAR data dominated by high phase noise. To speed up the graph cuts algorithm for sparse MRF, we designed dual elementary graphs and merged them to obtain the Delaunay triangle graph, which is used to minimize the energy function efficiently. The experiments on simulated and real data, compared with other existing algorithms, both confirm the effectiveness of the proposed MRF approach, which suffers less from decorrelation effects caused by large low-coherence area or rapid-topography variation.

Cite

CITATION STYLE

APA

Zhou, L., Chai, D., Xia, Y., Ma, P., & Lin, H. (2018). Interferometric synthetic aperture radar phase unwrapping based on sparse Markov random fields by graph cuts. Journal of Applied Remote Sensing, 12(01), 1. https://doi.org/10.1117/1.jrs.12.015006

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free