期刊文献+

基于图的Laplace谱的特征匹配 被引量:32

Feature Matching Based on Laplacian Spectra of Graphs
下载PDF
导出
摘要 为了能对等距变换和相似变换后的图像进行精确匹配,提出了一种基于图的Laplace谱的特征匹配方法,该方法是首先给定两幅图像的特征点,然后分别定义其Laplace矩阵,再通过分析该矩阵的特征值及特征向量来构造特征点匹配矩阵;最后根据匹配矩阵元素的大小和位置信息来实现特征点匹配,并从理论上证明了该算法在对图像进行等距变换或相似变换情况下能获得精确匹配。实验结果表明,该方法对真实图像的匹配精度可达到82%。 This paper presents a method of feature matching based on Laplacian spectral of graphs. Given feature points of two images, we define Laplacian matrices respectively, analysis the eigenvalues and eigcnvectors of the matrices, and construct a feature points matching matrix with information of magnitude and position of entries in the matching matrix, the feature points matching is done. Furthermore, we theoretically prove that our algorithm can acquire an exact matching under an equilong transformation or equiform transformation on images. Experimental results show that the approach attains accuracy 82% on real images.
出处 《中国图象图形学报》 CSCD 北大核心 2006年第3期332-336,共5页 Journal of Image and Graphics
基金 国家自然科学基金项目(60473102) 安徽省自然科学基金项目(050460102) 安徽省教育厅自然科学重点科研项目(2005KJ005ZD) 安徽省教育厅自然科学研究项目(2004kj027)
关键词 匹配 特征点 LAPLACE谱 matching, feature point, graph, Laplacian spectrum
  • 相关文献

参考文献14

  • 1Cvetkovié D,Doob M,Sachs H.Spectra of graphs:Theory and application[M].Berlin:Academic Press,1982.
  • 2Chung F R K.Spectral graph theory[M].Providance,Rhode Island USA:American Mathematical Society,1997.
  • 3Umeyama S.An eigen decomposition approach to weighted graph matching problems[J].IEEE Transactions on Pattern Analysis and Machine Intelligence,1988,10(5):695 ~ 703.
  • 4Scott G L,Longuet-Higgins H C.An algorithm for associating the features of two images[J].Proceedings of Royal Society of London,1991,B-244:21 ~26.
  • 5Shapiro L S,Brady J M.Feature-based correspondence-An eigenvector approach[J].Image Vision Comput,1992,10 (5):283 ~288.
  • 6Carcassoni Marco,Hancock Edwin R.Spectral correspondence for point pattern matching[J].Pattern Recognition,2003,36 (1):193 ~ 204.
  • 7Carcassoni Marco,Hancock Edwin R.Correspondence matching with modal clusters[J].IEEE Transactions on Pattern Analysis and Machine Intelligence,2003,25(12):1609 ~ 1615.
  • 8Myers Richard,Hancock Edwin R.Least-commitment graph matching with genetic algorithms[J].Pattern Recognition,2001,34(2):375 ~394,
  • 9Endika Bengoetxea,Pedro Larranagab,Isabelle Bloch,et al.Inexact graph matching by means of estimation of distribution algorithms[J].Pattern Recognition,2002,35 (12):2867 ~ 2880.
  • 10Sengupta K,Boyer K L.Modelbase partitioning using property matrix spectra[J].Computer Vision Image Understanding,1998,70 (2):177 ~ 196.

同被引文献297

引证文献32

二级引证文献61

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部