Skip to main content
SpringerLink
Log in

A novel graph matching method based on multiple information of the graph nodes

  • Published:
Multimedia Tools and Applications Aims and scope Submit manuscript

Abstract

Graph matching is a fundamental NP-problem in computer graphics and computer vision. In this work, we present an approximate graph matching method. Given two graphs to be matched, the proposed method first constructs an association graph to convert the problem of graph matching into a problem of selecting nodes on the constructed graph. The nodes of the association graph represent candidate correspondences between the two original graphs. An affinity matrix is then computed based on the local, intermediate and global information of the original graphs’ nodes, each element of which is used to measure the mutual consistency of a correspondence pair within the association graph. Updating the affinity of each correspondence pair with the affinities of relevant correspondences, our method then utilizes the reweighted random walks strategy to simulate random walks on the association graph and to iteratively obtain a quasi-stationary distribution. Finally, our method applies the Hungarian algorithm to discretize the distribution. Experimental results on four common datasets verify the effectiveness of the proposed method.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13

Similar content being viewed by others

Data Availability

Data sharing not applicable to this article as no datasets were generated or analyzed during the current study.

Notes

  1. http://www.vision.caltech.edu/Image_Datasets/Caltech101/

  2. http://research.microsoft.com/en-us/projects/objectclassrecognition/

References

  1. Albarelli A, Bulo SR, Torsello A, Pelillo M (2009) Matching as a non-cooperative game. In: 2009 IEEE 12Th international conference on computer vision, pp 1319–1326

  2. Berg AC, Berg TL, Malik J (2005) Shape matching and object recognition using low distortion correspondences. In: 2005 IEEE computer society conference on computer vision and pattern recognition (CVPR’05), vol 1. pp 26–33

  3. Carletti V, Foggia P, Greco A, Vento M, Vigilante V (2019) Vf3-light: a lightweight subgraph isomorphism algorithm and its experimental evaluation. Pattern Recogn Lett 125:591–596

    Article  Google Scholar 

  4. Cho M, Lee J, Lee KM (2010) Reweighted random walks for graph matching. In: European conference on computer vision, pp 492–505

  5. Cho M, Sun J, Duchenne O, Ponce J (2014) Finding matches in a haystack: a max-pooling strategy for graph matching in the presence of outliers. In: Proceedings of the IEEE conference on computer vision and pattern recognition, pp 2083–2090

  6. Cour T, Shi J (2007) Solving markov random fields with spectral relaxation. In: Artificial intelligence and statistics, pp 75–82

  7. Cour T, Srinivasan P, Shi J (2007) Balanced graph matching. In: Advances in neural information processing systems, pp 313–320

  8. Cui B, Créput J-C (2021) Affinity-preserving integer projected fixed point under spectral technique for graph matching. In: Advances in computer, communication and computational sciences, pp 975–985

  9. Duchenne O, Joulin A, Ponce J (2011) A graph-matching kernel for object categorization. In: 2011 International conference on computer vision, pp 1792–1799

  10. Foggia P, Percannella G, Vento M (2014) Graph matching and learning in pattern recognition in the last 10 years. Int J Pattern Recognition Artif Intell 28(01):1450001

    Article  MathSciNet  Google Scholar 

  11. Gold S, Rangarajan A (1996) A graduated assignment algorithm for graph matching. IEEE Trans Pattern Anal Mach Intell 18(4):377–388

    Article  Google Scholar 

  12. Gori M, Maggini M, Sarti L (2005) The rw2 algorithm for exact graph matching. In: International conference on pattern recognition and image analysis, pp 81–88

  13. Haveliwala TH (2003) Topic-sensitive pagerank: a context-sensitive ranking algorithm for web search. IEEE Trans Knowl Data Eng 15(4):784–796

    Article  Google Scholar 

  14. Hu N, Rustamov RM, Guibas L (2014) Stable and informative spectral signatures for graph matching. In: Proceedings of the IEEE conference on computer vision and pattern recognition, pp 2305–2312

  15. Jiang B, Tang J, Cao X, Luo B (2017) Lagrangian relaxation graph matching. Pattern Recogn 61:255–265

    Article  MATH  Google Scholar 

  16. Jiang B, Tang J, Ding C, Luo B (2015) A local sparse model for matching problem. In: Twenty-ninth AAAI conference on artificial intelligence, pp 3790–3796

  17. Jiang B, Tang J, Ding C, Luo B (2017) Nonnegative orthogonal graph matching. In: Thirty-first AAAI conference on artificial intelligence, pp 4089–4095

  18. Jiang B, Tang J, Luo B (2019) Efficient feature matching via nonnegative orthogonal relaxation. Int J Comput Vis 127(9):1345–1360

    Article  MathSciNet  MATH  Google Scholar 

  19. Jiang B, Zhao H, Tang J, Luo B (2014) A sparse nonnegative matrix factorization technique for graph matching problems. Pattern Recogn 47(2):736–747

    Article  MATH  Google Scholar 

  20. Kolmogorov V, Zabih R (2001) Computing visual correspondence with occlusions using graph cuts. In: Proceedings eighth IEEE international conference on computer vision. ICCV 2001, vol 2. pp 508–515

  21. Langville AN, Meyer CD (2004) Deeper inside pagerank. Internet Math 1(3):335–380

    Article  MathSciNet  MATH  Google Scholar 

  22. Lê-Huu DK, Paragios N (2017) Alternating direction graph matching. In: 2017 IEEE conference on computer vision and pattern recognition (CVPR), pp 4914–4922

  23. Leordeanu M, Hebert M (2005) A spectral technique for correspondence problems using pairwise constraints. In: Tenth IEEE international conference on computer vision, pp 1482–1489

  24. Leordeanu M, Hebert M, Sukthankar R (2009) An integer projected fixed point method for graph matching and map inference. In: Advances in neural information processing systems, pp 1114–1122

  25. Leordeanu M, Sukthankar R, Hebert M (2012) Unsupervised learning for graph matching. Int J Comput Vis 96(1):28–45

    Article  MathSciNet  MATH  Google Scholar 

  26. Mills-Tettey A, Stent A, Dias MB (2007) The dynamic hungarian algorithm for the assignment problem with changing costs carnegie mellon university

  27. Nie W, Ding H, Liu A, Deng Z, Su Y (2020) Subgraph learning for graph matching. Pattern Recogn Lett 130:362–369

    Article  Google Scholar 

  28. Nie W-Z, Liu A-A, Gao Z, Su Y-T (2015) Clique-graph matching by preserving global & local structure. In: Proceedings of the IEEE conference on computer vision and pattern recognition, pp 4503–4510

  29. Nie W-Z, Liu A-A, Gao Y, Su Y-T (2018) Hyper-clique graph matching and applications. IEEE Trans Circ Syst Video Technol 29(6):1619–1630

    Article  Google Scholar 

  30. Riesen K, Jiang X, Bunke H (2010) Exact and inexact graph matching: methodology and applications. In: Managing and mining graph data, pp 217–247

  31. Solnon C (2010) Alldifferent-based filtering for subgraph isomorphism. Artif Intell 174(12-13):850–864

    Article  MathSciNet  MATH  Google Scholar 

  32. Tian Y, Yan J, Zhang H, Zhang Y, Yang X, Zha H (2012) On the convergence of graph matching: Graduated assignment revisited. In: European conference on computer vision, pp 821–835

  33. Ullmann JR (2011) Bit-vector algorithms for binary constraint satisfaction and subgraph isomorphism. J Exp Algorithmic (JEA) 15:1–6

    MathSciNet  Google Scholar 

  34. Wang T, Ling H, Lang C, Feng S (2018) Graph matching with adaptive and branching path following. IEEE Trans Pattern Anal Mach Intell 40 (12):2853–2867

    Article  Google Scholar 

  35. Wang R, Yan J, Yang X (2019) Learning combinatorial embedding networks for deep graph matching. In: Proceedings of the IEEE/CVF international conference on computer vision, pp 3056–3065

  36. Yang J, Yang X, Zhou Z-B, Liu Z-Y (2022) Graph matching based on fast normalized cut and multiplicative update mapping. Pattern Recogn 122:108228

    Article  Google Scholar 

  37. Yu T, Yan J, Li B (2020) Determinant regularization for gradient-efficient graph matching. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition, pp 7123–7132

  38. Yu T, Yan J, Wang Y, Liu W, Li B (2018) Generalizing graph matching beyond quadratic assignment model. In: Proceedings of the 32nd international conference on neural information processing systems, pp 861–871

  39. Zanfir A, Sminchisescu C (2018) Deep learning of graph matching. In: Proceedings of the IEEE conference on computer vision and pattern recognition, pp 2684–2693

  40. Zhan Y, Zhao X, Lin X, Liu J, Liu M, Niu D (2020) Graph matching based on local and global information of the graph nodes. Multimed Tools Appl 79(17):11567–11590

    Article  Google Scholar 

  41. Zhang Z, Shi Q, McAuley J, Wei W, Zhang Y, Van Den Hengel A (2016) Pairwise matching through max-weight bipartite belief propagation. In: Proceedings of the IEEE conference on computer vision and pattern recognition, pp 1202–1210

  42. Zhou F, De la Torre F (2012) Factorized graph matching. In: 2012 IEEE conference on computer vision and pattern recognition, pp 127–134

Download references

Acknowledgements

Our thanks to National Nature Science Foundation of China (No. 62102163) and Natural Science Foundation of Shandong province (No. ZR2019BF026, ZR2019MF013).

Author information

Authors and Affiliations

  1. Shandong Provincial Key Laboratory of Network based Intelligent Computing, University of Jinan, No.336 West Road of Nan Xinzhuang, Jinan, 250022, Shandong, People’s Republic of China

    Shouhe Sheng, Xiuyang Zhao, Wentao Dou & Dongmei Niu

Authors
  1. Shouhe Sheng
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Xiuyang Zhao
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Wentao Dou
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Dongmei Niu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Dongmei Niu.

Ethics declarations

Conflict of Interests

The authors declare that they have no conflict of interest.

Additional information

Publisher’s note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Springer Nature or its licensor holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Sheng, S., Zhao, X., Dou, W. et al. A novel graph matching method based on multiple information of the graph nodes. Multimed Tools Appl 82, 16881–16904 (2023). https://doi.org/10.1007/s11042-022-14071-9

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11042-022-14071-9

Keywords

Search

Navigation