Graph matching based on local and global information of the graph nodes

Graph matching is an essential NP-problem in computer vision and pattern recognition. In this paper, we propose an approximate graph matching method. This method formulates the problem of computing the correspondences between two graphs as a problem of selecting nodes on an association graph. The nodes of the association graph represent candidate correspondences between the two original graphs. Our method first constructs an affinity matrix based on both the global and local information of the original graphs’ nodes. Each element of this matrix is used to measure the mutual consistency of a pair of nodes within the association graph. Our method then applies the reweighted random walks technique that preserves the one-to-one matching constraint to simulate random walks on the association graph and to iteratively compute a quasi-stationary distribution. To discretize this distribution, our method finally applies the Hungarian algorithm and obtains an approximate matching between the original two graphs. Experimental results demonstrate the effectiveness of our method for graph matching and the ability of our method for being robust to outlier and deformation noise.

[1]  Marco Gori,et al.  The RW2 Algorithm for Exact Graph Matching , 2005, ICAPR.

[2]  Bin Luo,et al.  Efficient Feature Matching via Nonnegative Orthogonal Relaxation , 2019, International Journal of Computer Vision.

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

[4]  Maoguo Gong,et al.  High-order graph matching based on ant colony optimization , 2019, Neurocomputing.

[5]  Congyan Lang,et al.  Graph Matching with Adaptive and Branching Path Following , 2018, IEEE Transactions on Pattern Analysis and Machine Intelligence.

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

[7]  Christine Solnon,et al.  AllDifferent-based filtering for subgraph isomorphism , 2010, Artif. Intell..

[8]  Yue Gao,et al.  Hyper-Clique Graph Matching and Applications , 2019, IEEE Transactions on Circuits and Systems for Video Technology.

[9]  Nikos Paragios,et al.  Alternating Direction Graph Matching , 2016, 2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR).

[10]  Hongyuan Zha,et al.  A Short Survey of Recent Advances in Graph Matching , 2016, ICMR.

[11]  Xiaochun Cao,et al.  Lagrangian relaxation graph matching , 2017, Pattern Recognit..

[12]  Min Liu,et al.  Robust Plant Cell Tracking in Noisy Image Sequences Using Optimal CRF Graph Matching , 2017, IEEE Signal Processing Letters.

[13]  Taher H. Haveliwala.  Topic-sensitive PageRank , 2002, IEEE Trans. Knowl. Data Eng..

[14]  Zhenyu Na,et al.  Multi-Modal Cooperative Spectrum Sensing Based on Dempster-Shafer Fusion in 5G-Based Cognitive Radio , 2018, IEEE Access.

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

[16]  Julian R. Ullmann,et al.  Bit-vector algorithms for binary constraint satisfaction and subgraph isomorphism , 2010, JEAL.

[17]  Hong Shen,et al.  Learning a hybrid similarity measure for image retrieval , 2013, Pattern Recognit..

[18]  Jitendra Malik,et al.  Shape matching and object recognition using low distortion correspondences , 2005, 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05).

[19]  Yen-Yu Lin,et al.  Progressive Feature Matching with Alternate Descriptor Selection and Correspondence Enrichment , 2016, 2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR).

[20]  Weizhi Nie,et al.  Subgraph learning for graph matching , 2020, Pattern Recognit. Lett..

[21]  Jean Ponce,et al.  Finding Matches in a Haystack: A Max-Pooling Strategy for Graph Matching in the Presence of Outliers , 2014, 2014 IEEE Conference on Computer Vision and Pattern Recognition.

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

[23]  Leonidas J. Guibas,et al.  Stable and Informative Spectral Signatures for Graph Matching , 2013, 2014 IEEE Conference on Computer Vision and Pattern Recognition.

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

[25]  Hong Qiao,et al.  Outlier robust point correspondence based on GNCCP , 2015, Pattern Recognit. Lett..

[26]  Teofilo F. Gonzalez,et al.  P-Complete Approximation Problems , 1976, J. ACM.

[27]  Andrea Torsello,et al.  Matching as a non-cooperative game , 2009, 2009 IEEE 12th International Conference on Computer Vision.

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

[29]  Panos M. Pardalos,et al.  Quadratic Assignment Problem , 1997, Encyclopedia of Optimization.

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

[31]  Kaspar Riesen,et al.  Exact and Inexact Graph Matching: Methodology and Applications , 2010, Managing and Mining Graph Data.

[32]  M. Bernardine Dias,et al.  The Dynamic Hungarian Algorithm for the Assignment Problem with Changing Costs , 2007 .

[33]  Mario Vento,et al.  A (sub)graph isomorphism algorithm for matching large graphs , 2004, IEEE Transactions on Pattern Analysis and Machine Intelligence.

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

[35]  Chris H. Q. Ding,et al.  Nonnegative Orthogonal Graph Matching , 2017, AAAI.

[36]  Hwann-Tzong Chen,et al.  Multi-object tracking using dynamical graph matching , 2001, Proceedings of the 2001 IEEE Computer Society Conference on Computer Vision and Pattern Recognition. CVPR 2001.

[37]  Jianbo Shi,et al.  Solving Markov Random Fields with Spectral Relaxation , 2007, AISTATS.

[38]  Chris H. Q. Ding,et al.  A Local Sparse Model for Matching Problem , 2015, AAAI.

[39]  Lei Chen,et al.  Online Modeling of Esthetic Communities Using Deep Perception Graph Analytics , 2018, IEEE Transactions on Multimedia.

[40]  Marco Gori,et al.  Graph matching using random walks , 2004, Proceedings of the 17th International Conference on Pattern Recognition, 2004. ICPR 2004..

[41]  Stan Sclaroff,et al.  MEEM: Robust Tracking via Multiple Experts Using Entropy Minimization , 2014, ECCV.

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

[43]  Jean Ponce,et al.  A graph-matching kernel for object categorization , 2011, 2011 International Conference on Computer Vision.

[44]  Wei Wei,et al.  Pairwise Matching through Max-Weight Bipartite Belief Propagation , 2016, 2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR).

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

[46]  Baoxin Li,et al.  Generalizing Graph Matching beyond Quadratic Assignment Model , 2018, NeurIPS.

[47]  Haifeng Zhao,et al.  A sparse nonnegative matrix factorization technique for graph matching problems , 2014, Pattern Recognit..

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

[49]  Dong-Hong Ji,et al.  Event graph based contradiction recognition from big data collection , 2016, Neurocomputing.

[50]  Zhenyu Na,et al.  Optimal Resource Allocation in Simultaneous Cooperative Spectrum Sensing and Energy Harvesting for Multichannel Cognitive Radio , 2017, IEEE Access.

[51]  Mario Vento,et al.  VF3-Light: A lightweight subgraph isomorphism algorithm and its experimental evaluation , 2019, Pattern Recognit. Lett..