利用特征点序列截断的图像匹配判决算法

张锟; 张昌芳; 李杰

doi:10.11834/jig.20110619

图像理解和计算机视觉 | 浏览量 : 0 下载量: 208 CSCD: 0

PDF
导出
分享
收藏
专辑

利用特征点序列截断的图像匹配判决算法
An image matching decision algorithm using truncation of feature point sequence
2011年16卷第6期页码：1051-1056
网络出版：2011-06-15，

纸质出版：2011
DOI： 10.11834/jig.20110619
稿件说明：

移动端阅览

张锟, 张昌芳, 李杰. 利用特征点序列截断的图像匹配判决算法[J]. 中国图象图形学报, 2011,16(6):1051-1056. DOI： 10.11834/jig.20110619.

An image matching decision algorithm using truncation of feature point sequence[J]. Journal of Image and Graphics, 2011, 16(6): 1051-1056. DOI： 10.11834/jig.20110619.

摘要

当图像中特征点缺失比较严重时，利用特征点S维分配算法和K均值聚类算法的图像匹配性能较差。此外，随着待匹配图像数量的增加，上述两类算法的计算量急剧上升。针对上述问题，提出一种新的图像匹配判决算法——利用特征点序列截断的匹配判决。该算法利用了匹配特征点之间的匹配度量大于非匹配特征点之间的匹配度量，以及同一匹配簇中来源于同一图像的特征点不超过一个的先验知识，一方面对特征点缺失具有较强的鲁棒性，另一方面克服了上述两类算法中的组合爆炸问题。仿真实验证实了所提算法的有效性。

Abstract

The performance of image matching based on S-dimensional assignment algorithm and K-means clustering algorithm are both poor when the feature points within the images are severely missed. Besides

the computational complexity of the aforementioned two algorithms increases dramatically when the number of images to be matched increases. Aiming at these problems

a new decision algorithm for image matching decision is proposed which uses the truncation of the feature point sequence. The algorithm takes advantage of the prior knowledge that the matching measures between the feature points which are matched are larger than those which between the feature points which are not matched. So on the one hand it has good robustness to feature points missing problem

on the other hand it overcomes the combinatorial explosion problem in the aforementioned two algorithms. Simulations validate the effectiveness of the proposed algorithm.