Journal of Systems Engineering and Electronics ›› 2010, Vol. 32 ›› Issue (12): 2691-2695.doi: 10.3969/j.issn.1001-506X.2010.12.40

• 软件、算法与仿真 • 上一篇    下一篇

结合测地线-灰度直方图的谱匹配算法

鲍文霞1,2,梁栋1,2,王年1,2, 唐俊1,2,宣善立2   

  1. 1. 安徽大学计算机智能与信号处理教育部重点实验室, 安徽 合肥230039;
    2. 安徽大学电子信息工程学院, 安徽 合肥 230601
  • 出版日期:2010-12-18 发布日期:2010-01-03

Spectral matching algorithm combined with geodesic-intensity histogram

BAO Wen-xia1,2, LIANG Dong1,2, WANG Nian1,2, TANG Jun1,2,XUAN Shan-li2   

  1. 1. Key Lab. of Intelligent Computing & Signal Processing of Ministry of Education, Anhui Univ., Hefei  230039, China; 2. School of Electronic Science and Information Technology, Anhui Univ., Hefei 230601, China
  • Online:2010-12-18 Published:2010-01-03

摘要:

针对单纯依赖奇异值分解的谱匹配方法的局限性,提出了一种结合测地线-灰度直方图和松弛迭代的Laplace谱匹配算法。首先,利用图像待匹配点集构造Laplace矩阵,〖JP3〗通过对该Laplace矩阵进行奇异值分解,将得到的特征向量用于计算匹配概率;然后,引入具有局部特征的测地线-灰度直方图作为相容性约束,通过迭代的方式对匹配概率进行优化。实验结果表明,该算法实现了多特征、多算法的优势互补,提高了谱匹配算法的匹配精度和应用范围。

Abstract:

Aiming at the limitation of spectral matching by relying solely on singular value decomposition, a Laplace spectral matching algorithm combined with geodesic-intensity histogram (GIH) for point pattern matching is described. Firstly, the Laplace matrices are obtained from the point sets of the images. By using the eigenvectors of the matrices, the initial matching probabilities are computed. Then, the GIH with local similarity is introduced as a compatibility constraint. And the matching probabilities are refined via the iterative relaxation approach. Experimental results show the algorithm gets the complementation of multifeature and multi-algorithm, and improves the matching precision and the application of the spectral matching method.