Error-tolerant geometric graph similarity and matching

Abstract Geometric graph matching is the process of evaluating the similarity between geometric graphs, where each vertex has an associated coordinate point in a plane. Exact matching computes a strict correspondence between two geometric graphs, whereas in error-tolerant matching an approximate similarity between two geometric graphs is computed. In this paper, we present an approach to error-tolerant graph matching using geometric graphs. We introduce the vertex distance (dissimilarity) and edge distance between two geometric graphs and use it to compute graph distance. Finally, we use graph distance to perform error-tolerant geometric graph matching.

[1]  Benoit Huet,et al.  Shape recognition from large image libraries by inexact graph matching , 1999, Pattern Recognit. Lett..

[2]  Edwin R. Hancock,et al.  Bayesian Graph Edit Distance , 2000, IEEE Trans. Pattern Anal. Mach. Intell..

[3]  Horst Bunke.  Error-Tolerant Graph Matching: A Formal Framework and Algorithms , 1998, SSPR/SPR.

[4]  Pascal Fua,et al.  Geometric Graph Matching Using Monte Carlo Tree Search , 2017, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[5]  Thomas Gärtner,et al.  Kernels for structured data , 2008, Series in Machine Perception and Artificial Intelligence.

[6]  George Karypis,et al.  Discovering frequent geometric subgraphs , 2007, Inf. Syst..

[7]  William J. Christmas,et al.  Structural Matching in Computer Vision Using Probabilistic Relaxation , 1995, IEEE Trans. Pattern Anal. Mach. Intell..

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

[9]  Terry Caelli,et al.  Inexact Graph Matching Using Eigen-Subspace Projection Clustering , 2004, Int. J. Pattern Recognit. Artif. Intell..

[10]  Ali Shokoufandeh,et al.  Indexing hierarchical structures using graph spectra , 2005, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[11]  Ravi Shankar Singh,et al.  Error-tolerant graph matching using node contraction , 2018, Pattern Recognit. Lett..

[12]  Christine Solnon,et al.  Reactive Tabu Search for Measuring Graph Similarity , 2005, GbRPR.

[13]  Kaspar Riesen,et al.  Approximate graph edit distance computation by means of bipartite graph matching , 2009, Image Vis. Comput..

[14]  Josef Kittler,et al.  Combining Evidence in Probabilistic Relaxation , 1989, Int. J. Pattern Recognit. Artif. Intell..

[15]  Joachim Gudmundsson,et al.  Measuring the Similarity of Geometric Graphs , 2009, SEA.

[16]  John D. Lafferty,et al.  Diffusion Kernels on Statistical Manifolds , 2005, J. Mach. Learn. Res..

[17]  Edwin R. Hancock,et al.  Structural Matching by Discrete Relaxation , 1997, IEEE Trans. Pattern Anal. Mach. Intell..

[18]  Michael Gertz,et al.  Vertex Similarity - A Basic Framework for Matching Geometric Graphs , 2014, LWA.

[19]  Kaspar Riesen,et al.  Improving bipartite graph edit distance approximation using various search strategies , 2015, Pattern Recognit..

[20]  Horst Bunke,et al.  Inexact graph matching for structural pattern recognition , 1983, Pattern Recognit. Lett..

[21]  Horst Bunke,et al.  Bridging the Gap between Graph Edit Distance and Kernel Machines , 2007, Series in Machine Perception and Artificial Intelligence.

[22]  Ravi Shankar Singh,et al.  Error-Tolerant Geometric Graph Similarity , 2018, S+SSPR.

[23]  Kaspar Riesen,et al.  Fast Suboptimal Algorithms for the Computation of Graph Edit Distance , 2006, SSPR/SPR.

[24]  David Haussler,et al.  Convolution kernels on discrete structures , 1999 .

[25]  Josef Kittler,et al.  Discrete relaxation , 1990, Pattern Recognit..

[26]  Mario Vento,et al.  Thirty Years Of Graph Matching In Pattern Recognition , 2004, Int. J. Pattern Recognit. Artif. Intell..

[27]  Kaspar Riesen,et al.  IAM Graph Database Repository for Graph Based Pattern Recognition and Machine Learning , 2008, SSPR/SPR.

[28]  Anthony K. H. Tung,et al.  Comparing Stars: On Approximating Graph Edit Distance , 2009, Proc. VLDB Endow..

[29]  Mauro Dell'Amico,et al.  Assignment Problems , 1998, IFIP Congress: Fundamentals - Foundations of Computer Science.

[30]  Martin A. Fischler,et al.  The Representation and Matching of Pictorial Structures , 1973, IEEE Transactions on Computers.

[31]  Mario Vento,et al.  Graph Matching and Learning in Pattern Recognition in the Last 10 Years , 2014, Int. J. Pattern Recognit. Artif. Intell..

[32]  King-Sun Fu,et al.  A distance measure between attributed relational graphs for pattern recognition , 1983, IEEE Transactions on Systems, Man, and Cybernetics.

[33]  Antonio Robles-Kelly,et al.  Graph edit distance from spectral seriation , 2005, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[34]  Ravi Shankar Singh,et al.  Error-tolerant graph matching using homeomorphism , 2017, 2017 International Conference on Advances in Computing, Communications and Informatics (ICACCI).