Attributed Graph Matching Using Local Descriptions

Abstract. In the pattern recognition context, objects can be represented as graphs with attributed nodes and edges involving their relations. Consequently, matching attributed graphs plays an important role in objects recognition. In this paper, a node signatures extraction is combined with an optimal assignment method for matching attributed graphs. In particular, we show how local descriptions are used to define a node-to-node cost in an assignment problem using the Hungarian method. Moreover, we propose a distance formula to compute the distance between attributed graphs. The experiments demonstrate that the newly presented algorithm is well-suited to pattern recognition applications. Compared with well-known methods, our algorithm gives good results for retrieving images.

• Type: Conference
• Year: 2009
• Where: ACIVS
• Authors: Salim Jouili, Ines Mili, Salvatore Tabbone
• Keywords: ACIVS 2009, Attributed Nodes, Computer Vision, Pattern Recognition, Pattern Recognition Context