{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T08:40:10Z","timestamp":1758271210968,"version":"3.37.3"},"reference-count":50,"publisher":"Springer Science and Business Media LLC","issue":"17-18","license":[{"start":{"date-parts":[[2020,1,7]],"date-time":"2020-01-07T00:00:00Z","timestamp":1578355200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,7]],"date-time":"2020-01-07T00:00:00Z","timestamp":1578355200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100007129","name":"Natural Science Foundation of Shandong Province","doi-asserted-by":"publisher","award":["ZR2019BF026"],"award-info":[{"award-number":["ZR2019BF026"]}],"id":[{"id":"10.13039\/501100007129","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Doctoral Program of University of Jinan","award":["160100313"],"award-info":[{"award-number":["160100313"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["ZR2019MF013"],"award-info":[{"award-number":["ZR2019MF013"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["ZR2017BF031"],"award-info":[{"award-number":["ZR2017BF031"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["2018GXRC023"],"award-info":[{"award-number":["2018GXRC023"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Multimed Tools Appl"],"published-print":{"date-parts":[[2020,5]]},"DOI":"10.1007\/s11042-019-08516-x","type":"journal-article","created":{"date-parts":[[2020,1,7]],"date-time":"2020-01-07T11:04:48Z","timestamp":1578395088000},"page":"11567-11590","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Graph matching based on local and global information of the graph nodes"],"prefix":"10.1007","volume":"79","author":[{"given":"Yaru","family":"Zhan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiuyang","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xue","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Junkai","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mingjun","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4519-545X","authenticated-orcid":false,"given":"Dongmei","family":"Niu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,1,7]]},"reference":[{"key":"8516_CR1","doi-asserted-by":"crossref","unstructured":"Albarelli A, Bulo SR, Torsello A, Pelillo M (2009) Matching as a non-cooperative game. In: IEEE conference on computer vision, pp 1319\u20131326","DOI":"10.1109\/ICCV.2009.5459312"},{"key":"8516_CR2","doi-asserted-by":"crossref","unstructured":"Berg AC, Berg TL, Malik J (2005) Shape matching and object recognition using low distortion correspondences. In: IEEE Conference on computer vision and pattern recognition, vol 1, pp 26\u201333","DOI":"10.1109\/CVPR.2005.320"},{"key":"8516_CR3","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1016\/j.patrec.2019.07.001","volume":"125","author":"V Carletti","year":"2019","unstructured":"Carletti V, Foggia P, Greco A, Vento M, Vigilante V (2019) VF3-Light: a lightweight subgraph isomorphism algorithm and its experimental evaluation. Pattern Recognit Lett 125:591\u2013596","journal-title":"Pattern Recognit Lett"},{"key":"8516_CR4","unstructured":"Chen HT, Lin HH, Liu TL (2001) Multi-object tracking using dynamical graph matching. In: IEEE Conference on computer vision and pattern recognition, vol 2, pp 210\u2013217"},{"key":"8516_CR5","doi-asserted-by":"crossref","unstructured":"Cho M, Lee J, Lee KM (2010) Reweighted random walks for graph matching. In: European conference on computer vision. Springer, pp 492\u2013505","DOI":"10.1007\/978-3-642-15555-0_36"},{"key":"8516_CR6","doi-asserted-by":"crossref","unstructured":"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: IEEE Conference on computer vision and pattern recognition, pp 2083\u20132090","DOI":"10.1109\/CVPR.2014.268"},{"issue":"10","key":"8516_CR7","doi-asserted-by":"publisher","first-page":"1367","DOI":"10.1109\/TPAMI.2004.75","volume":"26","author":"LP Cordella","year":"2004","unstructured":"Cordella LP, Foggia P, Sansone C, Vento M (2004) A (sub)graph isomorphism algorithm for matching large graphs. IEEE Trans Pattern Anal Mach Intell 26(10):1367\u20131372","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"8516_CR8","unstructured":"Cour T, Shi J (2007) Solving Markov random fields with spectral relaxation. In: Artificial intelligence and statistics, pp 75\u201382"},{"key":"8516_CR9","doi-asserted-by":"crossref","unstructured":"Cour T, Srinivasan P, Shi J (2007) Balanced graph matching. In: Conference on advances in neural information processing systems, pp 313\u2013320","DOI":"10.7551\/mitpress\/7503.003.0044"},{"key":"8516_CR10","doi-asserted-by":"crossref","unstructured":"Duchenne O, Joulin A, Ponce J (2011) A graph-matching kernel for object categorization. In: International conference on computer vision. IEEE, pp 1792\u20131799","DOI":"10.1109\/ICCV.2011.6126445"},{"issue":"1","key":"8516_CR11","first-page":"1","volume":"28","author":"P Foggia","year":"2014","unstructured":"Foggia P, Percannella G, Vento M (2014) Graph matching and learning in pattern recognition in the last 10 year. Int J Pattern Recognit Artifici Intelligenc 28 (1):1\u201340","journal-title":"Int J Pattern Recognit Artifici Intelligenc"},{"issue":"4","key":"8516_CR12","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1109\/34.491619","volume":"18","author":"S Gold","year":"1996","unstructured":"Gold S, Rangarajan A (1996) A graduated assignment algorithm for graph matching. IEEE Trans Pattern Anal Mach Intell 18(4):377\u2013388","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"8516_CR13","doi-asserted-by":"crossref","unstructured":"Gori M, Maggini M, Sarti L (2004) Graph matching using random walks. In: International conference on pattern recognition, vol 3, pp 394\u2013397","DOI":"10.1109\/ICPR.2004.1334549"},{"key":"8516_CR14","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/11551188_9","volume":"3686","author":"M Gori","year":"2005","unstructured":"Gori M, Maggini M, Sarti L (2005) The RW2 algorithm for exact graph matching. Lect Notes Comput Sci 3686:81\u201388","journal-title":"Lect Notes Comput Sci"},{"key":"8516_CR15","doi-asserted-by":"crossref","unstructured":"Haveliwala TH (2002) Topic-sensitive pagerank. In: ACM International conference on World Wide Web, pp 517\u2013526","DOI":"10.1145\/511446.511513"},{"key":"8516_CR16","unstructured":"Hu YT, Lin YY (2016) Progressive feature matching with alternate descriptor selection and correspondence enrichment. In: IEEE Conference on computer vision and pattern recognition, pp 346\u2013354"},{"key":"8516_CR17","doi-asserted-by":"crossref","unstructured":"Hu N, Rustamov RM, Guibas L (2014) Stable and informative spectral signatures for graph matching. In: IEEE Conference on computer vision and pattern recognition, pp 2305\u20132312","DOI":"10.1109\/CVPR.2014.296"},{"issue":"2","key":"8516_CR18","doi-asserted-by":"publisher","first-page":"736","DOI":"10.1016\/j.patcog.2013.08.024","volume":"47","author":"B Jiang","year":"2014","unstructured":"Jiang B, Zhao H, Tang J, Luo B (2014) A sparse nonnegative matrix factorization technique for graph matching problems. Pattern Recognit 47(2):736\u2013747","journal-title":"Pattern Recognit"},{"key":"8516_CR19","doi-asserted-by":"crossref","unstructured":"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\u20133796","DOI":"10.1609\/aaai.v29i1.9785"},{"key":"8516_CR20","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/j.patcog.2016.07.021","volume":"61","author":"B Jiang","year":"2017","unstructured":"Jiang B, Tang J, Cao X, Luo B (2017) Lagrangian relaxation graph matching. Pattern Recognit 61:255\u2013265","journal-title":"Pattern Recognit"},{"key":"8516_CR21","doi-asserted-by":"crossref","unstructured":"Jiang B, Tang J, Ding CH, Luo B (2017) Nonnegative orthogonal graph matching. In: Association for the advance of artificial intelligence, pp 4089\u20134095","DOI":"10.1609\/aaai.v31i1.11210"},{"issue":"9","key":"8516_CR22","doi-asserted-by":"publisher","first-page":"1345","DOI":"10.1007\/s11263-019-01185-1","volume":"127","author":"B Jiang","year":"2019","unstructured":"Jiang B, Tang J, Luo B (2019) Efficient Feature Matching via Nonnegative Orthogonal Relaxation. Int J Comput Vis 127(9):1345\u20131360","journal-title":"Int J Comput Vis"},{"key":"8516_CR23","doi-asserted-by":"crossref","unstructured":"Khue Le-Huu D, Paragios N (2017) Alternating direction graph matching. In: IEEE Conference on computer vision and pattern recognition, pp 6253\u20136261","DOI":"10.1109\/CVPR.2017.522"},{"issue":"4","key":"8516_CR24","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1287\/mnsc.9.4.586","volume":"9","author":"EL Lawler","year":"1963","unstructured":"Lawler EL (1963) The quadratic assignment problem. Manag Sci 9(4):586\u2013599","journal-title":"Manag Sci"},{"key":"8516_CR25","doi-asserted-by":"crossref","unstructured":"Leordeanu M, Hebert M (2005) A spectral technique for correspondence problems using pairwise constraints. In: IEEE International conference on computer vision, vol 2, pp 1482\u20131489","DOI":"10.1109\/ICCV.2005.20"},{"key":"8516_CR26","unstructured":"Leordeanu M, Hebert M, Sukthankar R (2009) An integer projected fixed point method for graph matching and map inference. In: International conference on neural information processing systems, pp 1114\u20131122"},{"issue":"6","key":"8516_CR27","doi-asserted-by":"publisher","first-page":"1258","DOI":"10.1109\/TPAMI.2013.223","volume":"36","author":"ZY Liu","year":"2014","unstructured":"Liu ZY, Qiao H (2014) GNCCP-graduated nonconvexity and concavity procedure. IEEE Trans Pattern Anal Mach Intell 36(6):1258\u20131267","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"8516_CR28","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1016\/j.neucom.2015.06.099","volume":"181","author":"M Liu","year":"2016","unstructured":"Liu M, Wang L, Nie L, Dai J, Ji D (2016) Event graph based contradiction recognition from big data collection. Neurocomputing 181:64\u201375","journal-title":"Neurocomputing"},{"issue":"8","key":"8516_CR29","doi-asserted-by":"publisher","first-page":"1168","DOI":"10.1109\/LSP.2017.2704292","volume":"24","author":"M Liu","year":"2017","unstructured":"Liu M, Wei Y, Qian W, Zhang H (2017) Robust plant cell tracking in noisy image sequences using optimal crf graph matching. IEEE Signal Proc Lett 24(8):1168\u20131172","journal-title":"IEEE Signal Proc Lett"},{"key":"8516_CR30","doi-asserted-by":"publisher","first-page":"3801","DOI":"10.1109\/ACCESS.2017.2677976","volume":"5","author":"X Liu","year":"2017","unstructured":"Liu X, Li F, Na Z (2017) Optimal resource allocation in simultaneous cooperative spectrum sensing and energy harvesting for multichannel cognitive radio. IEEE Access 5:3801\u20133812","journal-title":"IEEE Access"},{"issue":"99","key":"8516_CR31","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1109\/ACCESS.2017.2761910","volume":"6","author":"X Liu","year":"2018","unstructured":"Liu X, Jia M, Na Z, Lu W, Li F (2018) Multi-modal cooperative spectrum sensing based on Dempster-Shafer fusion in 5g-based cognitive radio. IEEE Access 6(99):199\u2013208","journal-title":"IEEE Access"},{"issue":"3","key":"8516_CR32","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/s11263-014-0707-7","volume":"109","author":"ZY Liu","year":"2014","unstructured":"Liu ZY, Qiao H, Yang X, Hoi SC (2014) Graph matching by simplified convex-concave relaxation procedure. Int J Comput Vis 109(3):169\u2013186","journal-title":"Int J Comput Vis"},{"key":"8516_CR33","unstructured":"Mills-Tettey GA, Stentz A, Dias MB (2007) The dynamic hungarian algorithm for the assignment problem with changing costs. Carnegie Mellon University"},{"key":"8516_CR34","unstructured":"Nie W, Ding H, Liu A, Deng Z, Su Y (2018) Subgraph learning for graph matching. Pattern Recognit Lett, in press"},{"key":"8516_CR35","first-page":"1","volume":"99","author":"WZ Nie","year":"2018","unstructured":"Nie WZ, Liu AA, Gao Y, Su YT (2018) Hyper-clique graph matching and applications. Trans on Circuit and Syst for Video Technol 99:1\u201312","journal-title":"Trans on Circuit and Syst for Video Technol"},{"key":"8516_CR36","doi-asserted-by":"crossref","unstructured":"Riesen K, Jiang X, Bunke H (2010) Exact and inexact graph matching: methodology and applications. Manag Min Graph Data, 217\u2013247","DOI":"10.1007\/978-1-4419-6045-0_7"},{"issue":"3","key":"8516_CR37","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1145\/321958.321975","volume":"23","author":"S Sahni","year":"1976","unstructured":"Sahni S, Gonzalez T (1976) P-complete approximation problems. J ACM 23 (3):555\u2013565","journal-title":"J ACM"},{"key":"8516_CR38","doi-asserted-by":"publisher","first-page":"850","DOI":"10.1016\/j.artint.2010.05.002","volume":"174","author":"C Solnon","year":"2010","unstructured":"Solnon C (2010) Alldifferent-based filtering for subgraph isomorphism. Artif Intell 174:850\u2013864","journal-title":"Artif Intell"},{"issue":"1","key":"8516_CR39","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/321921.321925","volume":"23","author":"JR Ullmann","year":"1976","unstructured":"Ullmann JR (1976) An algorithm for subgraph isomorphism. J ACM 23(1):31\u201342","journal-title":"J ACM"},{"key":"8516_CR40","first-page":"1","volume":"15","author":"JR Ullmann","year":"2010","unstructured":"Ullmann JR (2010) Bit-vector algorithms for binary constraint satisfaction and subgraph isomorphism. J Exp Algorithmics (JEA) 15:1\u20136","journal-title":"J Exp Algorithmics (JEA)"},{"issue":"12","key":"8516_CR41","doi-asserted-by":"publisher","first-page":"2853","DOI":"10.1109\/TPAMI.2017.2767591","volume":"40","author":"T Wang","year":"2018","unstructured":"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\u20132867","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"issue":"11","key":"8516_CR42","doi-asserted-by":"publisher","first-page":"2927","DOI":"10.1016\/j.patcog.2013.04.008","volume":"46","author":"J Wu","year":"2013","unstructured":"Wu J, Shen H, Li YD, Xiao ZB, Lu MY, Wang CL (2013) Learning a hybrid similarity measure for image retrieval. Pattern Recognit 46(11):2927\u20132939","journal-title":"Pattern Recognit"},{"key":"8516_CR43","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.neucom.2018.02.104","volume":"328","author":"Y Wu","year":"2019","unstructured":"Wu Y, Gong M, Ma W, Wang S (2019) High-order graph matching based on ant colony optimization. Neurocomputing 328:97\u2013104","journal-title":"Neurocomputing"},{"key":"8516_CR44","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1016\/j.patrec.2014.12.011","volume":"55","author":"X Yang","year":"2015","unstructured":"Yang X, Qiao H, Liu ZY (2015) Outlier robust point correspondence based on gnccp. Pattern Recognit Lett 55:8\u201314","journal-title":"Pattern Recognit Lett"},{"key":"8516_CR45","doi-asserted-by":"crossref","unstructured":"Yan J, Yin XC, Lin W, Deng C, Zha H, Yang X (2016) A short survey of recent advances in graph matching. In: ACM International conference on multimedia retrieval, pp 167\u2013174","DOI":"10.1145\/2911996.2912035"},{"key":"8516_CR46","unstructured":"Yu T, Yan J, Wang Y, Liu W (2018) Generalizing graph matching beyond quadratic assignment model. In: Advances in neural information processing systems, pp 853\u2013863"},{"key":"8516_CR47","doi-asserted-by":"crossref","unstructured":"Zhang J, Ma S, Sclaroff S (2014) Meem: robust tracking via multiple experts using entropy minimization. In: European conference on computer vision. Springer, pp 188\u2013203","DOI":"10.1007\/978-3-319-10599-4_13"},{"key":"8516_CR48","doi-asserted-by":"crossref","unstructured":"Zhang Z, Shi Q, McAuley J, Wei W, Zhang Y, Van Den Hengel A (2016) Pairwise matching through max-weight bipartite belief propagation. In: IEEE Conference on computer vision and pattern recognition, pp 1202\u20131210","DOI":"10.1109\/CVPR.2016.135"},{"issue":"6","key":"8516_CR49","doi-asserted-by":"publisher","first-page":"1462","DOI":"10.1109\/TMM.2017.2769799","volume":"20","author":"L Zhang","year":"2017","unstructured":"Zhang L, Liu M, Chen L, Qiu L, Zhang C, Hu Y, Zimmermann R (2017) Online modeling of esthetic communities using deep perception graph analytics. IEEE Trans Multimed 20(6):1462\u20131474","journal-title":"IEEE Trans Multimed"},{"key":"8516_CR50","unstructured":"Zhou F, Torre FDL (2012) Factorized graph matching. In: IEEE Conference on computer vision and pattern recognition, pp 127\u2013134"}],"container-title":["Multimedia Tools and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11042-019-08516-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11042-019-08516-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11042-019-08516-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,24]],"date-time":"2023-09-24T20:25:53Z","timestamp":1695587153000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11042-019-08516-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,1,7]]},"references-count":50,"journal-issue":{"issue":"17-18","published-print":{"date-parts":[[2020,5]]}},"alternative-id":["8516"],"URL":"https:\/\/doi.org\/10.1007\/s11042-019-08516-x","relation":{},"ISSN":["1380-7501","1573-7721"],"issn-type":[{"type":"print","value":"1380-7501"},{"type":"electronic","value":"1573-7721"}],"subject":[],"published":{"date-parts":[[2020,1,7]]},"assertion":[{"value":"3 December 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 September 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 November 2019","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 January 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}