Learning Graph Matching with a Graph-Based Perceptron in a Classification Context
Résumé
Many tasks in computer vision and pattern recognition are formulated as graph matching problems. Despite the NP-hard nature of the problem, fast and accurate approximations have led to significant progress in a wide range of applications. Learning graph matching functions from observed data, however, still remains a challenging issue. This paper presents an effective scheme to parametrize a graph model for object matching in a classification context. For this, we propose a representation based on a parametrized model graph, and optimize it to increase a classification rate. Experimental evaluations on real datasets demonstrate the effectiveness (in terms of accuracy and speed) of our approach against graph classification with hand-crafted cost functions.
Fichier principal
Learning_Graph_Matching_with_a_Graph_Based_Perceptron_in_a_Classification_Context.pdf (407 Ko)
Télécharger le fichier
Origine | Fichiers produits par l'(les) auteur(s) |
---|
Loading...