Graph Matching with Anchor Nodes: A Learning Approach

In this paper, we consider the weighted graph matching problem with partially disclosed correspondences between a number of anchor nodes. Our construction exploits recently introduced node signatures based on graph Laplacians, namely the Laplacian family signature (LFS) on the nodes, and the pair wise heat kernel map on the edges. In this paper, without assuming an explicit form of parametric dependence nor a distance metric between node signatures, we formulate an optimization problem which incorporates the knowledge of anchor nodes. Solving this problem gives us an optimized proximity measure specific to the graphs under consideration. Using this as a first order compatibility term, we then set up an integer quadratic program (IQP) to solve for a near optimal graph matching. Our experiments demonstrate the superior performance of our approach on randomly generated graphs and on two widely-used image sequences, when compared with other existing signature and adjacency matrix based graph matching methods.

[1]  King-Sun Fu,et al.  A graph distance measure for image analysis , 1984, IEEE Transactions on Systems, Man, and Cybernetics.

[2]  Shinji Umeyama,et al.  An Eigendecomposition Approach to Weighted Graph Matching Problems , 1988, IEEE Trans. Pattern Anal. Mach. Intell..

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

[4]  Ali Shokoufandeh,et al.  A Unified Framework for Indexing and Matching Hierarchical Shape Structures , 2001, IWVF.

[5]  Edwin R. Hancock,et al.  Structural Graph Matching Using the EM Algorithm and Singular Value Decomposition , 2001, IEEE Trans. Pattern Anal. Mach. Intell..

[6]  Antonio Robles-Kelly,et al.  String Edit Distance, Random Walks And Graph Matching , 2002, Int. J. Pattern Recognit. Artif. Intell..

[7]  Michael I. Jordan,et al.  Distance Metric Learning with Application to Clustering with Side-Information , 2002, NIPS.

[8]  Barend J. van Wyk,et al.  A POCS-Based Graph Matching Algorithm , 2004, IEEE Trans. Pattern Anal. Mach. Intell..

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

[10]  Jacques Desrosiers,et al.  Selected Topics in Column Generation , 2002, Oper. Res..

[11]  Christoph Schnörr,et al.  Probabilistic Subgraph Matching Based on Convex Relaxation , 2005, EMMCVPR.

[12]  A. Robles-Kelly,et al.  Graph Edit Distance from Spectral Seriation , 2005 .

[13]  Marco Gori,et al.  Exact and approximate graph matching using random walks , 2005, IEEE Transactions on Pattern Analysis and Machine Intelligence.

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

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

[16]  Pak Chung Wong,et al.  Graph Signatures for Visual Analytics , 2006, IEEE Transactions on Visualization and Computer Graphics.

[17]  J. Leydold,et al.  Laplacian eigenvectors of graphs : Perron-Frobenius and Faber-Krahn type theorems , 2007 .

[18]  Guoxing Zhao,et al.  Using Eigen-Decomposition Method for Weighted Graph Matching , 2007, ICIC.

[19]  Peter F. Stadler,et al.  Laplacian Eigenvectors of Graphs , 2007 .

[20]  Amnon Shashua,et al.  Probabilistic graph and hypergraph matching , 2008, 2008 IEEE Conference on Computer Vision and Pattern Recognition.

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

[22]  Leonidas J. Guibas,et al.  A concise and provably informative multi-scale signature based on heat diffusion , 2009 .

[23]  Edwin R. Hancock,et al.  Graph matching using the interference of continuous-time quantum walks , 2009, Pattern Recognit..

[24]  Salvatore Tabbone,et al.  Graph Matching Based on Node Signatures , 2009, GbRPR.

[25]  Martial Hebert,et al.  An Integer Projected Fixed Point Method for Graph Matching and MAP Inference , 2009, NIPS.

[26]  Pierre Vandergheynst,et al.  Wavelets on Graphs via Spectral Graph Theory , 2009, ArXiv.

[27]  Quoc V. Le,et al.  Learning graph matching. , 2009, IEEE transactions on pattern analysis and machine intelligence.

[28]  Martial Hebert,et al.  Unsupervised Learning for Graph Matching , 2009, 2009 IEEE Conference on Computer Vision and Pattern Recognition.

[29]  Minsu Cho,et al.  Reweighted Random Walks for Graph Matching , 2010, ECCV.

[30]  Tibério S. Caetano,et al.  Unified graph matching in Euclidean spaces , 2010, 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[31]  Daniel Cremers,et al.  The wave kernel signature: A quantum mechanical approach to shape analysis , 2011, 2011 IEEE International Conference on Computer Vision Workshops (ICCV Workshops).

[32]  Leonidas J. Guibas,et al.  Spectral Descriptors for Graph Matching , 2013, ArXiv.