Probabilistic Graph Matching with Multiplicative Updating Algorithm for Correspondence between Remote Sensing Images

Point correspondence is an important problem in remote sensing images matching task which lays the foundation for the image registration task. Due to the existence of the rotation transformation and the large scale, and the change of scenery between the two obtained images, the point correspondence problem is still challenging. Tradition algorithms such as the SIFT and SURF aim at using the point appearance to find the point correspondence. However, when the above situations happens, the appearance based algorithms will fail to solve the problem. In this paper, the structural information between points is introduced to the correspondence problem and a spectral graph matching algorithm is proposed based on the probabilistic scheme and the multiplicative updating scheme. The proposed algorithm has three advantages compared with the traditional algorithms. First, incorporating the structural cues to the matching problem makes it more robust to the large scale and the geometric transformation. Second, the best assignment between points which is interpreted by a probabilistic manner is figured out by ranking the probabilities. Third, the optimization problem is solved by an approximate spectral method efficiently and a multiplicative updating algorithm is introduced to ensure the final discrete solution. Experiments on the real remote sensing images validate the effectiveness of the proposed algorithm.