An Algorithm for Finding the Most Similar Given Sized Subgraphs in Two Weighted Graphs

We propose a weighted common subgraph (WCS) matching algorithm to find the most similar subgraphs in two labeled weighted graphs. WCS matching, as a natural generalization of equal-sized graph matching and subgraph matching, has found wide applications in many computer vision and machine learning tasks. In this brief, WCS matching is first formulated as a combinatorial optimization problem over the set of partial permutation matrices. Then, it is approximately solved by a recently proposed combinatorial optimization framework—graduated nonconvexity and concavity procedure. Experimental comparisons on both synthetic graphs and real-world images validate its robustness against noise level, problem size, outlier number, and edge density.

[1]  François Bourgeois,et al.  An extension of the Munkres algorithm for the assignment problem to rectangular matrices , 1971, CACM.

[2]  Steven C. H. Hoi,et al.  Graph Matching by Simplified Convex-Concave Relaxation Procedure , 2014, International Journal of Computer Vision.

[3]  Hong Qiao,et al.  Partial correspondence based on subgraph matching , 2013, Neurocomputing.

[4]  Matthias Rarey,et al.  Maximum common subgraph isomorphism algorithms and their applications in molecular science: a review , 2011 .

[5]  Steven Gold,et al.  A Graduated Assignment Algorithm for Graph Matching , 1996, IEEE Trans. Pattern Anal. Mach. Intell..

[6]  Edwin R. Hancock,et al.  Graph matching and clustering using spectral partitions , 2006, Pattern Recognit..

[7]  Yosi Keller,et al.  A Probabilistic Approach to Spectral Graph Matching , 2013, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[8]  Hong Qiao,et al.  GNCCP—Graduated NonConvexityand Concavity Procedure , 2014, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[9]  João Paulo Costeira,et al.  Robust point correspondence by concave minimization , 2002, Image Vis. Comput..

[10]  T. Michoel,et al.  The Index-Based Subgraph Matching Algorithm with General Symmetries (ISMAGS): Exploiting Symmetry for Faster Subgraph Enumeration , 2014, PloS one.

[11]  H. Kuhn.  The Hungarian method for the assignment problem , 1955 .

[12]  Hong Qiao,et al.  An Extended Path Following Algorithm for Graph-Matching Problem , 2012, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[13]  Jianbo Shi,et al.  Balanced Graph Matching , 2006, NIPS.

[14]  Martial Hebert,et al.  A spectral technique for correspondence problems using pairwise constraints , 2005, Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1.

[15]  Alexander Schrijver,et al.  Combinatorial optimization. Polyhedra and efficiency. , 2003 .

[16]  Silvia Biasotti,et al.  Sub-part correspondence by structural descriptors of 3D shapes , 2006, Comput. Aided Des..

[17]  Fernando De la Torre,et al.  Factorized Graph Matching , 2016, IEEE Trans. Pattern Anal. Mach. Intell..

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

[19]  Philip Wolfe,et al.  An algorithm for quadratic programming , 1956 .

[20]  M. Zaslavskiy,et al.  A Path Following Algorithm for the Graph Matching Problem , 2008, IEEE Transactions on Pattern Analysis and Machine Intelligence.