This paper presents an algorithm that matches interest points detected on a pair of grey level images taken from arbitrary points of view. First matching hypotheses are generated using a similarity measure of the interest points. Hypotheses are confirmed using local groups of interest paints: group matches are based on a measure defined on an affine transformation estimate and on a correlation coefficient computed on the intensity of the interest points. Once a reliable match has been determined for a given interest point and the corresponding local group, new group matches are found by propagating the estimated affine transformation. The algorithm has been widely tested under various image transformations: it provides dense matches and is very robust to outliers, i.e. interest points generated by noise or present in only one image because of occlusions or non overlap.
A robust interest points matching algorithm
Proceedings Eighth IEEE International Conference on Computer Vision. ICCV 2001 ; 2 ; 538-543 vol.2
01.01.2001
880412 byte
Aufsatz (Konferenz)
Elektronische Ressource
Englisch
A Robust Interest Points Matching Algorithm
British Library Conference Proceedings | 2001
|Top-Points as Interest Points for Image Matching
British Library Conference Proceedings | 2006
|Matching Interest Points of an Object
British Library Conference Proceedings | 2005
|Matching interest points of an object
IEEE | 2005
|Image Matching Using Generalized Scale-Space Interest Points
British Library Online Contents | 2015
|