A Weighted Common Subgraph Matching Algorithm

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 the equal-sized graph matching or subgraph matching, finds wide applications in many computer vision and machine learning tasks. In this paper, the 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 (GNCCP). Experimental comparisons on both synthetic graphs and real world images validate its robustness against noise level, problem size, outlier number, and edge density.

[1]  Peter Willett,et al.  Maximum common subgraph isomorphism algorithms for the matching of chemical structures , 2002, J. Comput. Aided Mol. Des..

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

[3]  R. Steele.  Optimization , 2005 .

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

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

[6]  J. Borwein,et al.  Convex Analysis And Nonlinear Optimization , 2000 .

[7]  Zhiyong Liu,et al.  GNCCP—Graduated NonConvexity and Concavity Procedure , 2014 .

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

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

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

[11]  Harold W. Kuhn,et al.  The Hungarian method for the assignment problem , 1955, 50 Years of Integer Programming.

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

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

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

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

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

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

[18]  Fernando De la Torre,et al.  Factorized Graph Matching , 2012, IEEE Transactions on Pattern Analysis and Machine Intelligence.

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

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

[21]  G. Griffin,et al.  Caltech-256 Object Category Dataset , 2007 .

[22]  Hong Qiao,et al.  A Convex-Concave Relaxation Procedure Based Subgraph Matching Algorithm , 2012, ACML.

[23]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

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

[25]  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.