Attributed graph matching for image-features association using SIFT descriptors
Visualitza/Obre
10.1007/978-3-642-14980-1_24
Inclou dades d'ús des de 2022
Cita com:
hdl:2117/12380
Tipus de documentText en actes de congrés
Data publicació2010
EditorSpringer
Condicions d'accésAccés obert
Llevat que s'hi indiqui el contrari, els
continguts d'aquesta obra estan subjectes a la llicència de Creative Commons
:
Reconeixement-NoComercial-SenseObraDerivada 3.0 Espanya
Abstract
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.
CitacióSanromà, G.; Alquezar, R.; Serratosa, F. Attributed graph matching for image-features association using SIFT descriptors. A: International Workshop on Structural and Syntactic Pattern Recognition. "13th Joint IAPR International Workshop on Structural, Syntactic and Statistical Pattern Recognition". Izmir: Springer, 2010, p. 254-263.
Versió de l'editorhttp://dx.doi.org/10.1007/978-3-642-14980-1_24
Fitxers | Descripció | Mida | Format | Visualitza |
---|---|---|---|---|
SANROMA.pdf | 138,6Kb | Visualitza/Obre |