{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T19:21:25Z","timestamp":1742930485907,"version":"3.40.3"},"publisher-location":"Cham","reference-count":40,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030586065"},{"type":"electronic","value":"9783030586072"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-58607-2_15","type":"book-chapter","created":{"date-parts":[[2020,11,6]],"date-time":"2020-11-06T08:04:11Z","timestamp":1604649851000},"page":"251-267","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Layered Neighborhood Expansion for\u00a0Incremental Multiple Graph Matching"],"prefix":"10.1007","author":[{"given":"Zixuan","family":"Chen","sequence":"first","affiliation":[]},{"given":"Zhihui","family":"Xie","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9639-7679","authenticated-orcid":false,"given":"Junchi","family":"Yan","sequence":"additional","affiliation":[]},{"given":"Yinqiang","family":"Zheng","sequence":"additional","affiliation":[]},{"given":"Xiaokang","family":"Yang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,11,7]]},"reference":[{"key":"15_CR1","unstructured":"Bunke, H.: Graph matching: theoretical foundations, algorithms, and applications. In: Vision Interface (2000)"},{"issue":"6","key":"15_CR2","doi-asserted-by":"publisher","first-page":"1048","DOI":"10.1109\/TPAMI.2009.28","volume":"31","author":"T Caetano","year":"2009","unstructured":"Caetano, T., McAuley, J., Cheng, L., Le, Q., Smola, A.J.: Learning graph matching. TPAMI 31(6), 1048\u20131058 (2009)","journal-title":"TPAMI"},{"key":"15_CR3","unstructured":"Chen, Y., Guibas, L., Huang, Q.: Near-optimal joint object matching via convex relaxation. In: ICML (2014)"},{"key":"15_CR4","doi-asserted-by":"publisher","first-page":"2205","DOI":"10.1109\/TPAMI.2010.51","volume":"32","author":"M Chertok","year":"2010","unstructured":"Chertok, M., Keller, Y.: Efficient high order matching. TPAMI 32, 2205\u20132215 (2010)","journal-title":"TPAMI"},{"key":"15_CR5","doi-asserted-by":"crossref","unstructured":"Cho, M., Alahari, K., Ponce, J.: Learning graphs to match. In: ICCV (2013)","DOI":"10.1109\/ICCV.2013.11"},{"key":"15_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"492","DOI":"10.1007\/978-3-642-15555-0_36","volume-title":"Computer Vision \u2013 ECCV 2010","author":"M Cho","year":"2010","unstructured":"Cho, M., Lee, J., Lee, K.M.: Reweighted random walks for graph matching. In: Daniilidis, K., Maragos, P., Paragios, N. (eds.) ECCV 2010. LNCS, vol. 6315, pp. 492\u2013505. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15555-0_36"},{"key":"15_CR7","first-page":"265","volume":"18","author":"D Conte","year":"2004","unstructured":"Conte, D., Foggia, P., Sansone, C., Vento, M.: Thirty years of graph matching in pattern recognition. IJPRAI 18, 265\u2013298 (2004)","journal-title":"IJPRAI"},{"key":"15_CR8","doi-asserted-by":"publisher","first-page":"2383","DOI":"10.1109\/TPAMI.2011.110","volume":"33","author":"O Duchenne","year":"2011","unstructured":"Duchenne, O., Bach, F., Kweon, I., Ponce, J.: A tensor-based algorithm for high-order graph matching. TPAMI 33, 2383\u20132395 (2011)","journal-title":"TPAMI"},{"key":"15_CR9","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1109\/TPAMI.2012.51","volume":"35","author":"A Egozi","year":"2013","unstructured":"Egozi, A., Keller, Y., Guterman, H.: A probabilistic approach to spectral graph matching. TPAMI 35, 18\u201327 (2013)","journal-title":"TPAMI"},{"key":"15_CR10","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1145\/358669.358692","volume":"24","author":"MA Fischler","year":"1981","unstructured":"Fischler, M.A., Bolles, R.C.: Random sample consensus: a paradigm for model fitting with applications to image analysis and automated cartography. Commun. ACM 24, 381\u2013395 (1981)","journal-title":"Commun. ACM"},{"issue":"1","key":"15_CR11","first-page":"1450001","volume":"33","author":"P Foggia","year":"2014","unstructured":"Foggia, P., Percannella, G., Vento, M.: Graph matching and learning in pattern recognition in the last 10 years. IJPRAI 33(1), 1450001 (2014)","journal-title":"IJPRAI"},{"key":"15_CR12","volume-title":"Computers and Intractability; A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1990","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability; A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York (1990)"},{"key":"15_CR13","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. TPAMI 18, 377\u2013388 (1996)","journal-title":"TPAMI"},{"key":"15_CR14","unstructured":"Guibas, L.J., Huang, Q., Liang, Z.: A condition number for joint optimization of cycle-consistent networks. In: NeurIPS (2019)"},{"key":"15_CR15","doi-asserted-by":"crossref","unstructured":"Hu, N., Huang, Q., Thibert, B., Guibas, L.J.: Distributable consistent multi-object matching. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 2463\u20132471 (2018)","DOI":"10.1109\/CVPR.2018.00261"},{"key":"15_CR16","doi-asserted-by":"crossref","unstructured":"Hu, N., Rustamov, R.M., Guibas, L.: Graph matching with anchor nodes: a learning approach. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 2906\u20132913 (2013)","DOI":"10.1109\/CVPR.2013.374"},{"key":"15_CR17","doi-asserted-by":"crossref","unstructured":"Hu, N., Rustamov, R.M., Guibas, L.: Stable and informative spectral signatures for graph matching. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 2305\u20132312 (2014)","DOI":"10.1109\/CVPR.2014.296"},{"key":"15_CR18","first-page":"1","volume":"31","author":"Q Huang","year":"2012","unstructured":"Huang, Q., Zhang, G., Gao, L., Hu, S., Butscher, A., Guibas, L.: An optimization approach for extracting and encoding consistent maps in a shape collection. ACM Trans. Graph. (TOG) 31, 1\u201311 (2012)","journal-title":"ACM Trans. Graph. (TOG)"},{"key":"15_CR19","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1561\/2200000044","volume":"5","author":"A Kulesza","year":"2012","unstructured":"Kulesza, A., Taskar, B., Liu, L.: Determinantal point processes for machine learning. Found. Trends Mach. Learn. 5, 123\u2013286 (2012)","journal-title":"Found. Trends Mach. Learn."},{"key":"15_CR20","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. IJCV 96, 28\u201345 (2012)","journal-title":"IJCV"},{"key":"15_CR21","doi-asserted-by":"crossref","unstructured":"Leordeanu, M., Zanfir, A., Sminchisescu, C.: Semi-supervised learning and optimization for hypergraph matching. In: ICCV (2011)","DOI":"10.1109\/ICCV.2011.6126507"},{"key":"15_CR22","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1016\/j.ejor.2005.09.032","volume":"176","author":"EM Loiola","year":"2007","unstructured":"Loiola, E.M., de Abreu, N.M., Boaventura-Netto, P.O., Hahn, P., Querido, T.: A survey for the quadratic assignment problem. EJOR 176, 657\u2013690 (2007)","journal-title":"EJOR"},{"key":"15_CR23","unstructured":"Ngoc, Q., Gautier, A., Hein, M.: A flexible tensor block coordinate ascent scheme for hypergraph matching. In: CVPR (2015)"},{"key":"15_CR24","unstructured":"Pachauri, D., Kondor, R., Vikas, S.: Solving the multi-way matching problem by permutation synchronization. In: NIPS (2013)"},{"key":"15_CR25","doi-asserted-by":"crossref","unstructured":"Shi, X., Ling, H., Hu, W., Xing, J., Zhang, Y.: Tensor power iteration for multi-graph matching. In: CVPR (2016)","DOI":"10.1109\/CVPR.2016.547"},{"key":"15_CR26","first-page":"929","volume":"115","author":"A Sol\u00e9-Ribalta","year":"2011","unstructured":"Sol\u00e9-Ribalta, A., Serratosa, F.: Models and algorithms for computing the common labelling of a set of attributed graphs. CVIU 115, 929\u2013945 (2011)","journal-title":"CVIU"},{"key":"15_CR27","first-page":"1350001","volume":"27","author":"A Sol\u00e9-Ribalta","year":"2013","unstructured":"Sol\u00e9-Ribalta, A., Serratosa, F.: Graduated assignment algorithm for multiple graph matching based on a common labeling. IJPRAI 27, 1350001 (2013)","journal-title":"IJPRAI"},{"key":"15_CR28","doi-asserted-by":"crossref","unstructured":"Swoboda, P., Mokarian, A., Theobalt, C., Bernard, F., et al.: A convex relaxation for multi-graph matching. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 11156\u201311165 (2019)","DOI":"10.1109\/CVPR.2019.01141"},{"issue":"2","key":"15_CR29","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/j.patcog.2014.01.002","volume":"48","author":"M Vento","year":"2015","unstructured":"Vento, M.: A long trip in the charming world of graphs for pattern recognition. Pattern Recogn. 48(2), 291\u2013301 (2015)","journal-title":"Pattern Recogn."},{"key":"15_CR30","doi-asserted-by":"crossref","unstructured":"Wang, R., Yan, J., Yang, X.: Learning combinatorial embedding networks for deep graph matching. In: ICCV (2019)","DOI":"10.1109\/ICCV.2019.00315"},{"key":"15_CR31","doi-asserted-by":"publisher","first-page":"1228","DOI":"10.1109\/TPAMI.2015.2477832","volume":"38","author":"J Yan","year":"2016","unstructured":"Yan, J., Cho, M., Zha, H., Yang, X., Chu, S.: Multi-graph matching via affinity optimization with graduated consistency regularization. TPAMI 38, 1228\u20131242 (2016)","journal-title":"TPAMI"},{"key":"15_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/978-3-319-10590-1_27","volume-title":"Computer Vision \u2013 ECCV 2014","author":"J Yan","year":"2014","unstructured":"Yan, J., Li, Y., Liu, W., Zha, H., Yang, X., Chu, S.M.: Graduated consistency-regularized optimization for multi-graph matching. In: Fleet, D., Pajdla, T., Schiele, B., Tuytelaars, T. (eds.) ECCV 2014. LNCS, vol. 8689, pp. 407\u2013422. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-10590-1_27"},{"key":"15_CR33","doi-asserted-by":"crossref","unstructured":"Yan, J., Tian, Y., Zha, H., Yang, X., Zhang, Y., Chu, S.: Joint optimization for consistent multiple graph matching. In: ICCV (2013)","DOI":"10.1109\/ICCV.2013.207"},{"issue":"3","key":"15_CR34","doi-asserted-by":"publisher","first-page":"994","DOI":"10.1109\/TIP.2014.2387386","volume":"24","author":"J Yan","year":"2015","unstructured":"Yan, J., Wang, J., Zha, H., Yang, X., Chu, S.: Consistency-driven alternating optimization for multigraph matching: a unified approach. IEEE Trans. Image Process. 24(3), 994\u20131009 (2015)","journal-title":"IEEE Trans. Image Process."},{"key":"15_CR35","doi-asserted-by":"crossref","unstructured":"Yan, J., Xu, H., Zha, H., Yang, X., Liu, H., Chu, S.: A matrix decomposition perspective to multiple graph matching. In: ICCV (2015)","DOI":"10.1109\/ICCV.2015.31"},{"key":"15_CR36","doi-asserted-by":"crossref","unstructured":"Yan, J., Yin, X., Lin, W., Deng, C., Zha, H., Yang, X.: A short survey of recent advances in graph matching. In: ICMR (2016)","DOI":"10.1145\/2911996.2912035"},{"key":"15_CR37","doi-asserted-by":"crossref","unstructured":"Yan, J., Zhang, C., Zha, H., Liu, W., Yang, X., Chu, S.: Discrete hyper-graph matching. In: CVPR (2015)","DOI":"10.1109\/CVPR.2015.7298759"},{"key":"15_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/978-3-030-01261-8_9","volume-title":"Computer Vision \u2013 ECCV 2018","author":"T Yu","year":"2018","unstructured":"Yu, T., Yan, J., Liu, W., Li, B.: Incremental multi-graph matching via diversity and randomness based graph clustering. In: Ferrari, V., Hebert, M., Sminchisescu, C., Weiss, Y. (eds.) ECCV 2018. LNCS, vol. 11217, pp. 142\u2013158. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-01261-8_9"},{"key":"15_CR39","doi-asserted-by":"crossref","unstructured":"Zass, R., Shashua, A.: Probabilistic graph and hypergraph matching. In: CVPR (2008)","DOI":"10.1109\/CVPR.2008.4587500"},{"key":"15_CR40","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/BF01427149","volume":"13","author":"Z Zhang","year":"1994","unstructured":"Zhang, Z.: Iterative point matching for registration of free-form curves and surfaces. IJCV 13, 119\u2013152 (1994)","journal-title":"IJCV"}],"container-title":["Lecture Notes in Computer Science","Computer Vision \u2013 ECCV 2020"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-58607-2_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,6]],"date-time":"2024-11-06T00:43:50Z","timestamp":1730853830000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-58607-2_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030586065","9783030586072"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-58607-2_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"7 November 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ECCV","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Computer Vision","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Glasgow","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 August 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 August 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eccv2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eccv2020.eu\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"OpenReview","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5025","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1360","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"27% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"7","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}