Sciweavers

ICPR
2010
IEEE

A Discrete Labelling Approach to Attributed Graph Matching Using SIFT Features

13 years 11 months ago
A Discrete Labelling Approach to Attributed Graph Matching Using SIFT Features
Local invariant feature extraction methods are widely used for image-features matching. There exist a number of approaches aimed at the refinement of the matches between image-features. It is a common strategy among these approaches to use geometrical criteria to reject a subset of outliers. One limitation of the outlier rejection design is that it is unable to add new useful matches. We present a new model that integrates the local information of the SIFT descriptors along with global geometrical information to estimate a new robust set of feature-matches. Our approach encodes the geometrical information by means of graph structures while posing the estimation of the feature-matches as a graph matching problem. Some comparative experimental results are presented.
Gerard Sanromà, René Alquézar
Added 07 Dec 2010
Updated 07 Dec 2010
Type Conference
Year 2010
Where ICPR
Authors Gerard Sanromà, René Alquézar, Francesc Serratosa
Comments (0)