Abstract:

Aiming at the problems of less realtime and low precision of feature matching in image registration, an image registration algorithm based on Kmeans and RANSAC is proposed.Based on the parallax constraint of distance and angle features of matching point pairs,the algorithm firstly uses Kmeans clustering to proprocess matching point pairs in order to filter false matching point pairs, and secondly adopts RANSAC to optimize the matching point pairs so as to realize fast and precise image registration.The experimental results indicate that the algorithm improves both the speed and the precision of image registration.

Key words: image registration;feature point matching;K-means clustering;RANSAC