Phase unwrapping (PU) is one of the key processes in measuring the elevation or deformation of the Earth’s surface from its interferometric synthetic aperture radar (InSAR) data. PU problems may be formulated as maximum a posteriori estimation estimations of Markov random field (MRF). The key issue of this formulation is energy minimization. Iterated conditional mode (ICM), graph cuts (GC), loopy belief propagation (LBP), and sequential tree-reweighted message passing (TRW-S) have been proposed for the energy minimization. Unfortunately, they differ in the formulation of the MRF model for PU, which raises the question of how they compare against each other on the same MRF model for PU. We address this by investigating the four optimization algorithms and comparing them on an identical MRF model, which gives researchers some guidance as to which optimization method is best suited for solving the PU problem. Experiments using simulated and real-data illustrate that the GC algorithm is clearly the winner among the four algorithms in all cases. The ICM algorithm, although very rapid, performs much worse than the other three especially in the terrain with violent changes or discontinuities. The two message-passing algorithms—LBP and TRW-S—perform completely differently. The LBP algorithm performs surprisingly poorly on solving phase discontinuities issue, whereas the TRW-S algorithm does quite well (second only to the GC algorithm).
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.
This paper presents a novel method for automatic image registration. It represents image as triangular mesh and use triangle as feature primitive. First, it detects corner features and triangulates them into triangular mesh. Then, orrespondences of triangles from different images are established by evaluating the similarity of the triangular regions. Affine rectification is applied to establish pixel correspondences. Based on the triangle correspondences, the image transformation is estimated using RANSAC estimator. The proposed method is applied to various image pairs related by projective transformation, experimental results show that the method works successfully even under the case that there are large rotation or severe perspective deformation effect between the images.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.