Image-features matching based on SIFT descriptors is subject to the misplacement of certain matches due to the local nature of the SIFT representations. Some well-known outlier rejectors aim to remove those misplaced matches by imposing geometrical consistency. We present two graph matching approaches (one continuous and one discrete) aimed at the matching of SIFT features in a geometrically consistent way. The two main novelties are that, both local and contextual coherence are imposed during the optimization process and, a model of structural consistency is presented that accounts for the quality rather than the quantity of the surrounding matches. Experimental results show that our methods achieve good results under various types of noise. © 2010 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Sanromà, G., Alquézar, R., & Serratosa, F. (2010). Attributed graph matching for image-features association using SIFT descriptors. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6218 LNCS, pp. 254–263). https://doi.org/10.1007/978-3-642-14980-1_24
Mendeley helps you to discover research relevant for your work.