计算机工程与应用Issue(4)：205-208,4.DOI:10.3778/j.issn.1002-8331.1301-0122
一种基于几何约束的RANSAC改进算法
Improved RANSAC algorithm based on geometric constraints
摘要
Abstract
Eliminating false matching is an important part in image stitching technology. Traditional eliminating errone-ous matching method in the field of image stitching is RANSAC algorithm, but this method need numerous iterations and complex computation, and it often can not completely eliminate the false matching. Focusing on these shortcomings in RANSAC, this paper presents an improved RANSAC algorithm which is based on the geometric constraints. Clustering and grouping the matching points, then establishing a prejudgment geometric constraints model with the two geometric relationship between each couple of matching points:(1)the slope of each connection segment of each couple is equal and (2)the length of each connection segment of each couple is equal, to pre-purify matching points. The experiments show that the algorithm compared to the traditional RANSAC algorithm, eliminates mis-matching, reduces the number of itera-tions, improves computational efficiency, thereby improves the efficiency of image matching algorithm.关键词
图像拼接/随机抽样一致(RANSAC)算法/几何约束/预提纯Key words
image stitching/Random Sample Consensus(RANSAC)algorithm/geometric constraints/pre-purified分类
信息技术与安全科学引用本文复制引用
穆柯楠,惠飞,曹健明,郭兰英..一种基于几何约束的RANSAC改进算法[J].计算机工程与应用,2015,(4):205-208,4.基金项目
教育部博士点基金（No.20120205120002）；交通部信息化专项（No.2012-364-812-105）。 （）
