Learning Cost Functions for Graph Matching - ESPCI Paris - École supérieure de physique et de chimie industrielles de la ville de Paris Access content directly
Conference Papers Year :

Learning Cost Functions for Graph Matching


During the last decade, several approaches have been proposed to address detection and recognition problems, by using graphs to represent the content of images. Graph comparison is a key task in those approaches and usually is performed by means of graph matching techniques , which aim to find correspondences between elements of graphs. Graph matching algorithms are highly influenced by cost functions between nodes or edges. In this perspective, we propose an original approach to learn the matching cost functions between graphs' nodes. Our method is based on the combination of distance vectors associated with node signatures and an SVM classifier, which is used to learn discrim-inative node dissimilarities. Experimental results on different datasets compared to a learning-free method are promising.
Fichier principal
Vignette du fichier
main.pdf (329.51 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01889964 , version 1 (08-10-2018)


  • HAL Id : hal-01889964 , version 1


Rafael de O Werneck, Romain Raveaux, Salvatore Tabbone, Ricardo da S Torres. Learning Cost Functions for Graph Matching. Joint IAPR International Workshops on Statistical Techniques in Pattern Recognition (SPR) and Structural and Syntactic Pattern Recognition (SSPR), Aug 2018, Beijing, China. ⟨hal-01889964⟩
151 View
314 Download


Gmail Facebook Twitter LinkedIn More