A Graph Edit Distance Based on Node Merging

In this paper a novel solution is proposed for error tolerant graph matching. The solution belongs to the class of edit distance based techniques. In particular, the original edit distance based framework is extended so as to account for a new operator to support node merging during the matching process.

[1]  Josef Kittler,et al.  Using Graph Search Techniques for Contextual Colour Retrieval , 2002, SSPR/SPR.

[2]  Horst Bunke,et al.  A New Algorithm for Error-Tolerant Subgraph Isomorphism Detection , 1998, IEEE Trans. Pattern Anal. Mach. Intell..

[3]  Alberto Del Bimbo,et al.  Visual Querying By Color Perceptive Regions , 1998, Pattern Recognit..

[4]  Horst Bunke,et al.  Error-Correcting Graph Isomorphism Using Decision Trees , 1998, Int. J. Pattern Recognit. Artif. Intell..

[5]  King-Sun Fu,et al.  Error-Correcting Isomorphisms of Attributed Relational Graphs for Pattern Analysis , 1979, IEEE Transactions on Systems, Man, and Cybernetics.

[6]  Marcello Pelillo,et al.  Matching graphs by pivoting , 2003, Pattern Recognit. Lett..

[7]  Horst Bunke,et al.  Graph Edit Distance with Node Splitting and Merging, and Its Application to Diatom Idenfication , 2003, GbRPR.

[8]  Horst Bunke,et al.  Recent developments in graph matching , 2000, Proceedings 15th International Conference on Pattern Recognition. ICPR-2000.

[9]  Shengrui Wang,et al.  A new algorithm for inexact graph matching , 2002, Object recognition supported by user interaction for service robots.

[10]  Roberto Marcondes Cesar Junior,et al.  Inexact graph matching using stochastic optimization techniques for facial feature recognition , 2002, Object recognition supported by user interaction for service robots.

[11]  Julian R. Ullmann,et al.  An Algorithm for Subgraph Isomorphism , 1976, J. ACM.

[12]  Bruce A. Draper,et al.  FOCUS: Searching for multi-colored objects in a diverse image database , 1997, Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition.