Several algorithms are proposed in the literature to solve the difficult problem of feature point correspondence between image pairs. In order to obtain good quality results, they make use of different aproaches and constraints to improve the quality of the matching set. A matching strategy is considered useful if it is able to filter out many of the mismatches found in an input matching set while keeping in most of the good matches present. In this paper, we present a survey of different matching strategies. We propose an empirical evaluation of thier performance. The validation process used here determines the number of good matches and the proportion of good matches in a given match set for the different parameter values of a matching constraint.
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.