摘要
特征匹配是图像拼接中的关键步骤之一,基于最邻近与次邻近欧氏距离比值的匹配算法往往存在大量的误匹配,好的筛选算法可以降低误匹配率提高处理效率,因此对于此类算法的研究具有重要意义.早期的RANSAC算法是一种被广泛使用筛选算法,但其存在迭代次数不确定,对BA过程不友好等缺陷.本文提出了一种全新的基于局部聚类思想的匹配筛选算法(LCMF).利用SURF和ORB提取特征点,使用最邻近算法进行匹配,之后利用LCMF算法进行筛选,实验表明,在使用ORB特征提取时,该算法可以获得较好的筛选效果.
Feature matching is one of the key steps in image mosaic.The matching algorithm based on the best of two nearest matches often has a large number of mismatches.The good filtering algorithm can reduce the mismatch rate and improve the processing efficiency.Therefore,it is of great significance to study this kind of algorithm.The RANSAC algorithm is a widely used filtering algorithm,but it has many defects such as uncertain number of iterations and none of self-adaption in BA process.In this study,we propose a new filtering algorithm of Feature Matching based on Local Clustering (LCMF).The feature points are extracted by SURF and ORB,the Best Of 2NearestMatcher algorithm is used to match,and then the LCMF algorithm is used to filter.The experiment shows that the algorithm can get better filtering result when ORB is used to extract feature.
作者
王金宝
赵奎
刘闽
宗子潇
王其乐
WANG Jin-Bao;ZHAO Kui;LILT Min;ZONG Zi-Xiao;WANG Qi-Le(University of Chinese Academy of Sciences,Beijing 100049,China;Shenyang Institute of Computing Technology,Chinese Academy of Sciences,Shenyang 110168,China;Shenyang Environmental Monitoring Center Station,Shenyang 110016,China;School of Computer Science and Engineering,Northeastern University,Shenyang 110004,China;Shenyang Thirty-First Middle School,Shenyang 110021,China)
出处
《计算机系统应用》
2018年第12期192-197,共6页
Computer Systems & Applications
关键词
特征匹配:匹配筛选:局部聚类
feature matching
matching and filtering
local clustering
