Improved RANSAC algorithm based on geometric constraints
MU Kena · Computer Engineering and Applications Journal · 2015
Eliminating false matching is an important part in image stitching technology. Traditional eliminating erroneous 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 iterations, improves computational efficiency, thereby improves the efficiency of image matching algorithm.