Skip to Main content Skip to Navigation
Conference papers

Graph Matching Based on Node Signatures

Salim Jouili 1 Salvatore Tabbone 1 
1 QGAR - Querying Graphics through Analysis and Recognition
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : 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.
Document type :
Conference papers
Complete list of metadata

Cited literature [27 references]  Display  Hide  Download
Contributor : Salim Jouili Connect in order to contact the contributor
Submitted on : Thursday, July 16, 2009 - 11:23:49 AM
Last modification on : Friday, February 4, 2022 - 3:12:22 AM
Long-term archiving on: : Friday, June 11, 2010 - 12:07:50 AM


Files produced by the author(s)




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⟩



Record views


Files downloads