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. Key words: graph representation, graph matching, graph clustering.

• Type: Conference
• Year: 2009
• Where: GBRPR
• Authors: Salim Jouili, Salvatore Tabbone
• Keywords: Algorithm, GBRPR 2009, Graph Matching, Pattern Recognition, Weighted Graphs