Journal of Systems Engineering and Electronics ›› 2009, Vol. 31 ›› Issue (12): 2958-2962.

Previous Articles     Next Articles

Method for spectral correspondence based on minimum spanning tree combined with probabilistic relaxation

WANG Nian, ZHOU Mei-ju, XIA Jie, LIANG Dong   

  1. Key Lab of Intelligent Computing & Signal Processing, Ministry of Education, Anhui Univ., Hefei 230039, China
  • Online:2009-12-24 Published:2010-01-03

Abstract:

An algorithm of spectral correspondence based on minimum spanning tree (MST) combined with probabilistic relaxation in order to obtain accurate image matching is presented. Firstly, MST is constructed according to the feature points of two related images respectively. Secondly, the corresponding Laplacian matrixs for minimum spanning tree is constructed respectively. The original probability of point correspondence is gained by using the results of the SVD decomposition. Finally, the final matching results are acquired by using the method of probabilistic relaxation. The massive comparable experiments results show that the proposed method has the validity and accuracy.

[an error occurred while processing this directive]