{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T16:38:12Z","timestamp":1778258292301,"version":"3.51.4"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,3,1]],"date-time":"2022-03-01T00:00:00Z","timestamp":1646092800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,3,1]],"date-time":"2022-03-01T00:00:00Z","timestamp":1646092800000},"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":["No. ZR2019MF013"],"award-info":[{"award-number":["No. ZR2019MF013"]}],"id":[{"id":"10.13039\/501100007129","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Project of Jinan Scientific Research Leader\u2019s Laboratory","award":["No. 2018GXRC023"],"award-info":[{"award-number":["No. 2018GXRC023"]}]},{"DOI":"10.13039\/501100007129","name":"Natural Science Foundation of Shandong Province","doi-asserted-by":"publisher","award":["No. ZR2019BF026"],"award-info":[{"award-number":["No. ZR2019BF026"]}],"id":[{"id":"10.13039\/501100007129","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Vis Comput"],"published-print":{"date-parts":[[2023,2]]},"DOI":"10.1007\/s00371-021-02369-y","type":"journal-article","created":{"date-parts":[[2022,3,1]],"date-time":"2022-03-01T11:03:21Z","timestamp":1646132601000},"page":"711-722","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Graph matching based on feature and spatial location information"],"prefix":"10.1007","volume":"39","author":[{"given":"Chuanju","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dongmei","family":"Niu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xinghai","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiuyang","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,3,1]]},"reference":[{"key":"2369_CR1","doi-asserted-by":"crossref","unstructured":"Almasri, I., Gao, X., Fedoroff, N.: Quick mining of isomorphic exact large patterns from large graphs. In: IEEE International Conference on Data Mining Workshop (2015)","DOI":"10.1109\/ICDMW.2014.65"},{"issue":"1","key":"2369_CR2","doi-asserted-by":"publisher","first-page":"53","DOI":"10.2307\/1907742","volume":"25","author":"KM Beckmann","year":"1957","unstructured":"Beckmann, K.M.: Assignment problems and the location of economic activities. Econometrica 25(1), 53\u201376 (1957)","journal-title":"Econometrica"},{"issue":"4","key":"2369_CR3","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1109\/34.993558","volume":"24","author":"S Belongie","year":"2002","unstructured":"Belongie, S., Malik, J., Puzicha, J.: Shape matching and object recognition using shape contexts. IEEE Trans. Pattern Anal. Mach. Intell. 24(4), 509\u2013522 (2002)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"4","key":"2369_CR4","doi-asserted-by":"publisher","first-page":"804","DOI":"10.1109\/TPAMI.2017.2696940","volume":"40","author":"V Carletti","year":"2018","unstructured":"Carletti, V., Foggia, P., Saggese, A., Vento, M.: Challenging the time complexity of exact subgraph isomorphism for huge and dense graphs with vf3. IEEE Trans. Pattern Anal. Mach. Intell. 40(4), 804\u2013818 (2018)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"2369_CR5","doi-asserted-by":"crossref","unstructured":"Cho, M., Lee, J., Lee, K.M.: Reweighted random walks for graph matching. In: European Conf. on Computer Vision , 492\u2013505 (2010)","DOI":"10.1007\/978-3-642-15555-0_36"},{"key":"2369_CR6","doi-asserted-by":"crossref","unstructured":"Cho, M., Sun, J., Duchenne, O., Ponce, J.: Finding matches in a haystack: a max-pooling strategy for graph matching in the presence of outliers. Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition pp. 2083\u20132090 (2014)","DOI":"10.1109\/CVPR.2014.268"},{"issue":"2","key":"2369_CR7","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1016\/S1077-3142(03)00009-2","volume":"89","author":"H Chui","year":"2003","unstructured":"Chui, H., Rangarajan, A.: A new point matching algorithm for non-rigid registration. Comput. Vis. Image Underst. 89(2), 114\u2013141 (2003)","journal-title":"Comput. Vis. Image Underst."},{"key":"2369_CR8","doi-asserted-by":"crossref","unstructured":"Cour, T., Srinivasan, P., Shi, J.: Balanced graph matching. In: Advances in Neural Information Processing Systems, pp. 313\u2013320 (2007)","DOI":"10.7551\/mitpress\/7503.003.0044"},{"key":"2369_CR9","doi-asserted-by":"crossref","unstructured":"Duchenne, O., Joulin, A., Ponce, J.: A graph-matching kernel for object categorization. In: International Conference on Computer Vision, pp. 1792\u20131799 (2011)","DOI":"10.1109\/ICCV.2011.6126445"},{"issue":"4","key":"2369_CR10","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1109\/34.491619","volume":"18","author":"S Gold","year":"1996","unstructured":"Gold, S., Rangarajan, A.: A graduated assignment algorithm for graph matching. IEEE Trans. Pattern Anal. Mach. Intell. 18(4), 377\u2013388 (1996)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"2369_CR11","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.: Lagrangian relaxation graph matching. Pattern Recogn. 61, 255\u2013265 (2017)","journal-title":"Pattern Recogn."},{"key":"2369_CR12","doi-asserted-by":"crossref","unstructured":"Jiang, B., Tang, J., Ding, C., Luo, B.: A local sparse model for matching problem. In: Twenty-ninth Aaai Conference on Artificial Intelligence, pp. 3790\u20133796 (2015)","DOI":"10.1609\/aaai.v29i1.9785"},{"key":"2369_CR13","doi-asserted-by":"crossref","unstructured":"Jiang, B., Tang, J., Luo, B.: Efficient feature matching via nonnegative orthogonal relaxation. Int. J. Comput. Vision 127(1),(2019)","DOI":"10.1007\/s11263-019-01185-1"},{"key":"2369_CR14","doi-asserted-by":"crossref","unstructured":"L-Huu, D.K., Paragios, N.: Alternating direction graph matching. In: Computer Vision and Pattern Recognition, pp. 6253\u20136261 (2017)","DOI":"10.1109\/CVPR.2017.522"},{"issue":"4","key":"2369_CR15","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1287\/mnsc.9.4.586","volume":"9","author":"EL Lawler","year":"1963","unstructured":"Lawler, E.L.: The quadratic assignment problem. Manage. Sci. 9(4), 586\u2013599 (1963)","journal-title":"Manage. Sci."},{"key":"2369_CR16","doi-asserted-by":"crossref","unstructured":"Leordeanu, M., Hebert, M.: A spectral technique for correspondence problems using pairwise constraints. In: Tenth IEEE International Conference on Computer Vision, 2, 1482\u20131489 (2005)","DOI":"10.1109\/ICCV.2005.20"},{"key":"2369_CR17","unstructured":"Leordeanu, M., Hebert, M., Sukthankar, R.: An integer projected fixed point method for graph matching and map inference. In: International Conference on Neural Information Processing Systems, pp. 1114\u20131122 (2009)"},{"issue":"1","key":"2369_CR18","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.: Unsupervised learning for graph matching. Int. J. Comput. Vision 96(1), 28\u201345 (2012)","journal-title":"Int. J. Comput. Vision"},{"key":"2369_CR19","doi-asserted-by":"crossref","unstructured":"Riesen, K., Jiang, X., Bunke, H.: Exact and inexact graph matching: methodology and applications. Manag Min Graph Data , 217\u2013247 (2010)","DOI":"10.1007\/978-1-4419-6045-0_7"},{"key":"2369_CR20","doi-asserted-by":"crossref","unstructured":"Shen, T., Zhu, S., Fang, T., Zhang, R., Quan, L.: Graph-based consistent matching for structure-from-motion. In: European Conference on Computer Vision (2016)","DOI":"10.1007\/978-3-319-46487-9_9"},{"issue":"12\u201313","key":"2369_CR21","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.: Alldifferent-based filtering for subgraph isomorphism. Artif. Intell. 174(12\u201313), 850\u2013864 (2010)","journal-title":"Artif. Intell."},{"key":"2369_CR22","doi-asserted-by":"crossref","unstructured":"Ullmann, J., R.: An algorithm for subgraph isomorphism. J. of the Acm 23(1), 31\u201342 (1976)","DOI":"10.1145\/321921.321925"},{"key":"2369_CR23","doi-asserted-by":"crossref","unstructured":"Wang, F., Xue, N., Yu, J.G., Xia, G.S.: Zero-assignment constraint for graph matching with outliers. In: Proceedings of the IEEE\/CVF conference on computer vision and pattern recognition, pp. 3033\u20133042 (2020)","DOI":"10.1109\/CVPR42600.2020.00310"},{"key":"2369_CR24","doi-asserted-by":"crossref","unstructured":"Wang, F.D., Xia, G.S., Xue, N., Zhang, Y., Pelillo, M.: A functional representation for graph matching. IEEE Transactions on Pattern Analysis and Machine Intelligence (2019)","DOI":"10.1109\/TPAMI.2019.2919308"},{"issue":"12","key":"2369_CR25","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.: Graph matching with adaptive and branching path following. IEEE Trans. Pattern Anal. Mach. Intell. 40(12), 2853\u20132867 (2018)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"1","key":"2369_CR26","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1109\/LCOMM.2010.111910.101806","volume":"15","author":"Z Wang","year":"2011","unstructured":"Wang, Z., Feng, Z., Zhang, P.: An iterative hungarian algorithm based coordinated spectrum sensing strategy. IEEE Commun. Lett. 15(1), 49\u201351 (2011)","journal-title":"IEEE Commun. Lett."},{"issue":"11","key":"2369_CR27","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, Y.D., Xiao, Z.B., Lu, M.Y., Wang, C.L.: Learning a hybrid similarity measure for image retrieval. Pattern Recogn. 46(11), 2927\u20132939 (2013)","journal-title":"Pattern Recogn."},{"key":"2369_CR28","doi-asserted-by":"crossref","unstructured":"Yan, J., Yin, X.C., Lin, W., Deng, C., Zha, H., Yang,: X.: A short survey of recent advances in graph matching. In: Proceedings of the 2016 ACM on International Conference on Multimedia Retrieval, pp. 167\u2013174 (2016)","DOI":"10.1145\/2911996.2912035"},{"key":"2369_CR29","unstructured":"Yu, T., Yan, J., Wang, Y., Liu, W., et\u00a0al.: Generalizing graph matching beyond quadratic assignment model. In: Advances in neural information processing systems, pp. 853\u2013863 (2018)"},{"key":"2369_CR30","doi-asserted-by":"crossref","unstructured":"Zass, R., Shashua, A.: Probabilistic graph and hypergraph matching. In: 2008 IEEE Conference on Computer Vision and Pattern Recognition (2008)","DOI":"10.1109\/CVPR.2008.4587500"},{"issue":"9","key":"2369_CR31","doi-asserted-by":"publisher","first-page":"1774","DOI":"10.1109\/TPAMI.2015.2501802","volume":"38","author":"F Zhou","year":"2016","unstructured":"Zhou, F., De la Torre, F.: Factorized graph matching. IEEE Trans. Pattern Anal. Mach. Intell. 38(9), 1774\u20131789 (2016)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."}],"container-title":["The Visual Computer"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00371-021-02369-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00371-021-02369-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00371-021-02369-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,18]],"date-time":"2023-11-18T07:23:07Z","timestamp":1700292187000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00371-021-02369-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,1]]},"references-count":31,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,2]]}},"alternative-id":["2369"],"URL":"https:\/\/doi.org\/10.1007\/s00371-021-02369-y","relation":{},"ISSN":["0178-2789","1432-2315"],"issn-type":[{"value":"0178-2789","type":"print"},{"value":"1432-2315","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,3,1]]},"assertion":[{"value":"10 November 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 March 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}