Robust point matching via corresponding circles

The matching points extracted from images play a very important role in many applications and particularly in computer vision. The use of point sets as being characteristics that describe the entire images brought into play, it greatly contributes to the reduction of the execution time, unlike the use of all the information contained in these images. The major problem of the matching process is the possibility to generate a large number of false correspondences, or outliers, in addition to a limited number of true correspondences (inliers). The objective of this paper is to propose a robust algorithm to eliminate or reduce the false correspondences, or outliers, among the putative set extracted from stereoscopic images. The principle of our method is based on the notion of belonging to the corresponding circles and the concept of similarity of stereoscopic images. The results largely reflect the efficiency and performance of our algorithm in comparison to the other used methods in this framework like RANSAC algorithm.