Graph Matching Based on Node Signatures - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2009

Graph Matching Based on Node Signatures


We present an algorithm for graph matching in a pattern recognition context. This algorithm deals with weighted graphs, based on new structural and topological node signatures. Using these signatures, we compute an optimum solution for node-to-node assignment with the Hungarian method and propose a distance formula to compute the distance between weighted graphs. The experiments demonstrate that the newly presented algorithm is well suited to pattern recognition applications. Compared with four well-known methods, our algorithm gives good results for clustering and retrieving images. A sensitivity analysis reveals that the proposed method is also insensitive to weak structural changes.
Fichier principal
Vignette du fichier
Graph_matching_Node_Signatures.pdf (148.38 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00390288 , version 1 (16-07-2009)



Salim Jouili, Salvatore Tabbone. Graph Matching Based on Node Signatures. 7th IAPR-TC-15 Workshop on Graph-based Representations in Pattern Recognition - GbRPR 2009, IAPR-TC-15, May 2009, Venise, Italy. pp.154-163, ⟨10.1007/978-3-642-02124-4_16⟩. ⟨inria-00390288⟩
156 View
855 Download



Gmail Facebook X LinkedIn More