基于空间约束的快速鲁棒特征匹配优化-电子与信息学报.PDF

第 36 卷第 11 期 电 子 与 信 息 学 报 Vol.36No.11 2014 年 11 月 Journal of Electronics Information Technology Nov. 2014 基于空间约束的快速鲁棒特征匹配优化 赵 烨* 蒋建国 洪日昌 (合肥工业大学计算机与信息学院 合肥 230009) 摘 要：该文提出一种基于空间约束的快速鲁棒特征(SURF)匹配优化算法，称为 SC-SURF。首先通过 SURF 算 法检测和匹配图像的特征点。然后根据最近邻比例越低其匹配精度越高的特点，得到按最近邻比率排序的匹配点。 并以最优匹配点作为参考点生成新的坐标系，利用空间位置关系地图对每对匹配点进行编码。同时为了简化随机抽 样一致性(RANSAC)算法，选择尽量少的最优匹配点对作为 RANSAC 的代表测试数据集，并由该测试数据集拟合 目标投影变换矩阵。最后结合匹配点间的空间位置关系和简化的RANSAC 算法对匹配点进行几何校验。实验表明 该方法在达到良好匹配精度的同时，具有鲁棒性强，匹配速度快的优点。 关键词：图像匹配；快速鲁棒特性；随机抽样一致性 中图分类号：TP391.4 文献标识码： A 文章编号：1009-5896(2014)11-2571-07 DOI: 10.3724/SP.J.1146.2013.01960 A Speeded Up Robust Feature Matching Optimization Based on Spatial Constraint Zhao Ye Jiang Jian-guo Hong Ri-chang (College of Computer Information, Hefei University of Technology, Hefei 230009, China) Abstract: An optimization algorithm based on Spatial Constraint for Speeded Up Robust Feature (SURF) matching is proposed, called SC-SURF. First, SURF is used for the image feature point detection and matching. Then the matched points are ranked according to the principle that the lower is the ratio of the nearest neighbor, the higher is the matching accuracy. A new coordinate system is created based on the optimal matched points. Every pair of matched points is encoded using the relative spatial map. At the same time, representative data sets are constructed to simplify RANndom SAmple Consensus (RANSAC) by using a minimal number of optimal matches. The target homographic matrix is fitted based on the representative data set. Finally, the spatial verification