{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:28:02Z","timestamp":1740122882824,"version":"3.37.3"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2022,10,28]],"date-time":"2022-10-28T00:00:00Z","timestamp":1666915200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,10,28]],"date-time":"2022-10-28T00:00:00Z","timestamp":1666915200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"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"}]},{"DOI":"10.13039\/501100001809","name":"National Nature Science Foundation of China","doi-asserted-by":"crossref","award":["62102163"],"award-info":[{"award-number":["62102163"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100007129","name":"Natural Science Foundation of Shandong Province","doi-asserted-by":"publisher","award":["ZR2019MF013"],"award-info":[{"award-number":["ZR2019MF013"]}],"id":[{"id":"10.13039\/501100007129","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":[[2023,5]]},"DOI":"10.1007\/s11042-022-14071-9","type":"journal-article","created":{"date-parts":[[2022,10,28]],"date-time":"2022-10-28T04:03:01Z","timestamp":1666929781000},"page":"16881-16904","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A novel graph matching method based on multiple information of the graph nodes"],"prefix":"10.1007","volume":"82","author":[{"given":"Shouhe","family":"Sheng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiuyang","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wentao","family":"Dou","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":[[2022,10,28]]},"reference":[{"key":"14071_CR1","doi-asserted-by":"crossref","unstructured":"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\u20131326","DOI":"10.1109\/ICCV.2009.5459312"},{"key":"14071_CR2","doi-asserted-by":"crossref","unstructured":"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\u201905), vol 1. pp 26\u201333","DOI":"10.1109\/CVPR.2005.320"},{"key":"14071_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 Recogn Lett 125:591\u2013596","journal-title":"Pattern Recogn Lett"},{"key":"14071_CR4","doi-asserted-by":"crossref","unstructured":"Cho M, Lee J, Lee KM (2010) Reweighted random walks for graph matching. In: European conference on computer vision, pp 492\u2013505","DOI":"10.1007\/978-3-642-15555-0_36"},{"key":"14071_CR5","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: Proceedings of the IEEE conference on computer vision and pattern recognition, pp 2083\u20132090","DOI":"10.1109\/CVPR.2014.268"},{"key":"14071_CR6","unstructured":"Cour T, Shi J (2007) Solving markov random fields with spectral relaxation. In: Artificial intelligence and statistics, pp 75\u201382"},{"key":"14071_CR7","doi-asserted-by":"crossref","unstructured":"Cour T, Srinivasan P, Shi J (2007) Balanced graph matching. In: Advances in neural information processing systems, pp 313\u2013320","DOI":"10.7551\/mitpress\/7503.003.0044"},{"key":"14071_CR8","doi-asserted-by":"crossref","unstructured":"Cui B, Cr\u00e9put 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\u2013985","DOI":"10.1007\/978-981-15-4409-5_86"},{"key":"14071_CR9","doi-asserted-by":"crossref","unstructured":"Duchenne O, Joulin A, Ponce J (2011) A graph-matching kernel for object categorization. In: 2011 International conference on computer vision, pp 1792\u20131799","DOI":"10.1109\/ICCV.2011.6126445"},{"issue":"01","key":"14071_CR10","doi-asserted-by":"publisher","first-page":"1450001","DOI":"10.1142\/S0218001414500013","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 years. Int J Pattern Recognition Artif Intell 28(01):1450001","journal-title":"Int J Pattern Recognition Artif Intell"},{"issue":"4","key":"14071_CR11","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":"14071_CR12","doi-asserted-by":"crossref","unstructured":"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\u201388","DOI":"10.1007\/11551188_9"},{"issue":"4","key":"14071_CR13","doi-asserted-by":"publisher","first-page":"784","DOI":"10.1109\/TKDE.2003.1208999","volume":"15","author":"TH Haveliwala","year":"2003","unstructured":"Haveliwala TH (2003) Topic-sensitive pagerank: a context-sensitive ranking algorithm for web search. IEEE Trans Knowl Data Eng 15(4):784\u2013796","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"14071_CR14","doi-asserted-by":"crossref","unstructured":"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\u20132312","DOI":"10.1109\/CVPR.2014.296"},{"key":"14071_CR15","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 Recogn 61:255\u2013265","journal-title":"Pattern Recogn"},{"key":"14071_CR16","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":"14071_CR17","doi-asserted-by":"crossref","unstructured":"Jiang B, Tang J, Ding C, Luo B (2017) Nonnegative orthogonal graph matching. In: Thirty-first AAAI conference on artificial intelligence, pp 4089\u20134095","DOI":"10.1609\/aaai.v31i1.11210"},{"issue":"9","key":"14071_CR18","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"},{"issue":"2","key":"14071_CR19","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 Recogn 47(2):736\u2013747","journal-title":"Pattern Recogn"},{"key":"14071_CR20","unstructured":"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\u2013515"},{"issue":"3","key":"14071_CR21","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1080\/15427951.2004.10129091","volume":"1","author":"AN Langville","year":"2004","unstructured":"Langville AN, Meyer CD (2004) Deeper inside pagerank. Internet Math 1(3):335\u2013380","journal-title":"Internet Math"},{"key":"14071_CR22","doi-asserted-by":"crossref","unstructured":"L\u00ea-Huu DK, Paragios N (2017) Alternating direction graph matching. In: 2017 IEEE conference on computer vision and pattern recognition (CVPR), pp 4914\u20134922","DOI":"10.1109\/CVPR.2017.522"},{"key":"14071_CR23","doi-asserted-by":"crossref","unstructured":"Leordeanu M, Hebert M (2005) A spectral technique for correspondence problems using pairwise constraints. In: Tenth IEEE international conference on computer vision, pp 1482\u20131489","DOI":"10.1109\/ICCV.2005.20"},{"key":"14071_CR24","unstructured":"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\u20131122"},{"issue":"1","key":"14071_CR25","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1007\/s11263-011-0442-2","volume":"96","author":"M Leordeanu","year":"2012","unstructured":"Leordeanu M, Sukthankar R, Hebert M (2012) Unsupervised learning for graph matching. Int J Comput Vis 96(1):28\u201345","journal-title":"Int J Comput Vis"},{"key":"14071_CR26","unstructured":"Mills-Tettey A, Stent A, Dias MB (2007) The dynamic hungarian algorithm for the assignment problem with changing costs carnegie mellon university"},{"key":"14071_CR27","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1016\/j.patrec.2018.07.005","volume":"130","author":"W Nie","year":"2020","unstructured":"Nie W, Ding H, Liu A, Deng Z, Su Y (2020) Subgraph learning for graph matching. Pattern Recogn Lett 130:362\u2013369","journal-title":"Pattern Recogn Lett"},{"key":"14071_CR28","doi-asserted-by":"crossref","unstructured":"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\u20134510","DOI":"10.1109\/CVPR.2015.7299080"},{"issue":"6","key":"14071_CR29","doi-asserted-by":"publisher","first-page":"1619","DOI":"10.1109\/TCSVT.2018.2852310","volume":"29","author":"W-Z Nie","year":"2018","unstructured":"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\u20131630","journal-title":"IEEE Trans Circ Syst Video Technol"},{"key":"14071_CR30","doi-asserted-by":"crossref","unstructured":"Riesen K, Jiang X, Bunke H (2010) Exact and inexact graph matching: methodology and applications. In: Managing and mining graph data, pp 217\u2013247","DOI":"10.1007\/978-1-4419-6045-0_7"},{"issue":"12-13","key":"14071_CR31","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(12-13):850\u2013864","journal-title":"Artif Intell"},{"key":"14071_CR32","doi-asserted-by":"crossref","unstructured":"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\u2013835","DOI":"10.1007\/978-3-642-33712-3_59"},{"key":"14071_CR33","first-page":"1","volume":"15","author":"JR Ullmann","year":"2011","unstructured":"Ullmann JR (2011) Bit-vector algorithms for binary constraint satisfaction and subgraph isomorphism. J Exp Algorithmic (JEA) 15:1\u20136","journal-title":"J Exp Algorithmic (JEA)"},{"issue":"12","key":"14071_CR34","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"},{"key":"14071_CR35","doi-asserted-by":"crossref","unstructured":"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\u20133065","DOI":"10.1109\/ICCV.2019.00315"},{"key":"14071_CR36","doi-asserted-by":"publisher","first-page":"108228","DOI":"10.1016\/j.patcog.2021.108228","volume":"122","author":"J Yang","year":"2022","unstructured":"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","journal-title":"Pattern Recogn"},{"key":"14071_CR37","doi-asserted-by":"crossref","unstructured":"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\u20137132","DOI":"10.1109\/CVPR42600.2020.00715"},{"key":"14071_CR38","unstructured":"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\u2013871"},{"key":"14071_CR39","doi-asserted-by":"crossref","unstructured":"Zanfir A, Sminchisescu C (2018) Deep learning of graph matching. In: Proceedings of the IEEE conference on computer vision and pattern recognition, pp 2684\u20132693","DOI":"10.1109\/CVPR.2018.00284"},{"issue":"17","key":"14071_CR40","doi-asserted-by":"publisher","first-page":"11567","DOI":"10.1007\/s11042-019-08516-x","volume":"79","author":"Y Zhan","year":"2020","unstructured":"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\u201311590","journal-title":"Multimed Tools Appl"},{"key":"14071_CR41","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: Proceedings of the IEEE conference on computer vision and pattern recognition, pp 1202\u20131210","DOI":"10.1109\/CVPR.2016.135"},{"key":"14071_CR42","doi-asserted-by":"crossref","unstructured":"Zhou F, De la Torre F (2012) Factorized graph matching. In: 2012 IEEE conference on computer vision and pattern recognition, pp 127\u2013134","DOI":"10.1109\/CVPR.2013.376"}],"container-title":["Multimedia Tools and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11042-022-14071-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11042-022-14071-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11042-022-14071-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,29]],"date-time":"2023-11-29T18:17:51Z","timestamp":1701281871000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11042-022-14071-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10,28]]},"references-count":42,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2023,5]]}},"alternative-id":["14071"],"URL":"https:\/\/doi.org\/10.1007\/s11042-022-14071-9","relation":{},"ISSN":["1380-7501","1573-7721"],"issn-type":[{"type":"print","value":"1380-7501"},{"type":"electronic","value":"1573-7721"}],"subject":[],"published":{"date-parts":[[2022,10,28]]},"assertion":[{"value":"20 May 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 September 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 October 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 October 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"<!--Emphasis Type='Bold' removed-->Conflict of Interests"}}]}}