| HAL-Inria | Publications, software ... of Inria's scientists |
Conference papers
Graph Matching Based on Node Signatures
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.
Cited literature [27 references]
https://hal.inria.fr/inria-00390288
Contributor : Salim Jouili <>
Submitted on : Thursday, July 16, 2009 - 11:23:49 AM
Last modification on : Tuesday, May 18, 2021 - 3:32:05 PM
Long-term archiving on: : Friday, June 11, 2010 - 12:07:50 AM
Contributor : Salim Jouili <>
Submitted on : Thursday, July 16, 2009 - 11:23:49 AM
Last modification on : Tuesday, May 18, 2021 - 3:32:05 PM
Long-term archiving on: : Friday, June 11, 2010 - 12:07:50 AM
File
Graph_matching_Node_Signatures...
Files produced by the author(s)