{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T19:53:55Z","timestamp":1775246035626,"version":"3.50.1"},"publisher-location":"Cham","reference-count":45,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030012601","type":"print"},{"value":"9783030012618","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-01261-8_9","type":"book-chapter","created":{"date-parts":[[2018,10,8]],"date-time":"2018-10-08T12:14:51Z","timestamp":1539000891000},"page":"142-158","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Incremental Multi-graph Matching via Diversity and Randomness Based Graph Clustering"],"prefix":"10.1007","author":[{"given":"Tianshu","family":"Yu","sequence":"first","affiliation":[]},{"given":"Junchi","family":"Yan","sequence":"additional","affiliation":[]},{"given":"Wei","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Baoxin","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,10,6]]},"reference":[{"issue":"2","key":"9_CR1","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(2), 657\u2013690 (2007)","journal-title":"EJOR"},{"key":"9_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"756","DOI":"10.1007\/978-3-319-10590-1_49","volume-title":"Computer Vision \u2013 ECCV 2014","author":"W Wang","year":"2014","unstructured":"Wang, W., Lin, W., Chen, Y., Wu, J., Wang, J., Sheng, B.: Finding coherent motions and semantic regions in crowd scenes: a diffusion and clustering approach. In: Fleet, D., Pajdla, T., Schiele, B., Tuytelaars, T. (eds.) ECCV 2014. LNCS, vol. 8689, pp. 756\u2013771. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-10590-1_49"},{"key":"9_CR3","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1016\/j.neucom.2014.02.040","volume":"139","author":"W Nie","year":"2014","unstructured":"Nie, W., et al.: Single\/cross-camera multiple-person tracking by graph matching. Neurocomputing 139, 220\u2013232 (2014)","journal-title":"Neurocomputing"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Duchenne, O., Joulin, A., Ponce, J.: A graph-matching kernel for object categorization. In: ICCV, pp. 1792\u20131799 (2011)","DOI":"10.1109\/ICCV.2011.6126445"},{"key":"9_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"},{"issue":"3","key":"9_CR6","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.: 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."},{"issue":"6","key":"9_CR7","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(6), 1228\u20131242 (2016)","journal-title":"TPAMI"},{"issue":"11\u201313","key":"9_CR8","doi-asserted-by":"publisher","first-page":"1275","DOI":"10.1016\/S0167-8655(97)00117-7","volume":"18","author":"ML Williams","year":"1997","unstructured":"Williams, M.L., Wilson, R.C., Hancock, E.: Multiple graph matching with bayesian inference. Pattern Recognit. Lett. 18(11\u201313), 1275\u20131281 (1997)","journal-title":"Pattern Recognit. Lett."},{"key":"9_CR9","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, pp. 1649\u20131656 (2013)","DOI":"10.1109\/ICCV.2013.207"},{"issue":"01","key":"9_CR10","first-page":"1350001","volume":"27","author":"A Sole-Ribalta","year":"2013","unstructured":"Sole-Ribalta, A., Serratosa, F.: Graduated assignment algorithm for multiple graph matching based on a common labeling. IJPRAI 27(01), 1350001 (2013)","journal-title":"IJPRAI"},{"key":"9_CR11","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":"9_CR12","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, pp. 199\u2013207 (2015)","DOI":"10.1109\/ICCV.2015.31"},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"Shi, X., Ling, H., Hu, W., Xing, J., Zhang, Y.: Tensor power iteration for multi-graph matching. In: CVPR, pp. 5026\u20135070 (2016)","DOI":"10.1109\/CVPR.2016.547"},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"Hu, N., Thibert, B., Guibas, L.: Distributable consistent multi-graph matching. In: CVPR (2018)","DOI":"10.1109\/CVPR.2018.00261"},{"key":"9_CR15","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, pp. 167\u2013174 (2016)","DOI":"10.1145\/2911996.2912035"},{"issue":"1","key":"9_CR16","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. Vis. 96(1), 28\u201345 (2012)","journal-title":"Int. J. Comput. Vis."},{"issue":"4","key":"9_CR17","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(4), 377\u2013388 (1996)","journal-title":"TPAMI"},{"key":"9_CR18","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"},{"issue":"6","key":"9_CR19","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"},{"issue":"1","key":"9_CR20","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(1), 18\u201327 (2013)","journal-title":"TPAMI"},{"key":"9_CR21","series-title":"A Guide to the Theory of NP-Completeness","volume-title":"Computers and Intractability","author":"MR Garey","year":"1990","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability. A Guide to the Theory of NP-Completeness. Freeman and Co., New York (1990)"},{"key":"9_CR22","doi-asserted-by":"crossref","unstructured":"Zass, R., Shashua, A.: Probabilistic graph and hypergraph matching. In: CVPR (2008)","DOI":"10.1109\/CVPR.2008.4587500"},{"key":"9_CR23","doi-asserted-by":"crossref","unstructured":"Chertok, M., Keller, Y.: Efficient high order matching. TPAMI (2010)","DOI":"10.1109\/TPAMI.2010.51"},{"key":"9_CR24","doi-asserted-by":"crossref","unstructured":"Duchenne, O., Bach, F., Kweon, I., Ponce, J.: A tensor-based algorithm for high-order graph matching. TPAMI (2011)","DOI":"10.1109\/TPAMI.2011.110"},{"key":"9_CR25","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":"9_CR26","doi-asserted-by":"crossref","unstructured":"Ngoc, Q., Gautier, A., Hein, M.: A flexible tensor block coordinate ascent scheme for hypergraph matching. In: CVPR, pp. 5270\u20135278 (2015)","DOI":"10.1109\/CVPR.2015.7299164"},{"key":"9_CR27","doi-asserted-by":"crossref","unstructured":"Leordeanu, M., Hebert, M.: A spectral technique for correspondence problems using pairwise constraints. In: ICCV, vol. 2, pp. 1482\u20131489 (2005)","DOI":"10.1109\/ICCV.2005.20"},{"key":"9_CR28","unstructured":"Leordeanu, M., Hebert, M., Sukthankar, R.: An integer projected fixed point method for graph matching and map inference. In: NIPS, pp. 1114\u20131122 (2009)"},{"key":"9_CR29","unstructured":"Torr, P.H.S.: Solving markov random fields using semidefinite programmin. In: AISTATS (2003)"},{"key":"9_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/11585978_12","volume-title":"Energy Minimization Methods in Computer Vision and Pattern Recognition","author":"C Schellewald","year":"2005","unstructured":"Schellewald, C., Schn\u00f6rr, C.: Probabilistic subgraph matching based on convex relaxation. In: Rangarajan, A., Vemuri, B., Yuille, A.L. (eds.) EMMCVPR 2005. LNCS, vol. 3757, pp. 171\u2013186. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11585978_12"},{"key":"9_CR31","doi-asserted-by":"crossref","unstructured":"Cour, T., Srinivasan, P., Shi, J.: Balanced graph matching. In: NIPS, pp. 313\u2013320 (2006)","DOI":"10.7551\/mitpress\/7503.003.0044"},{"issue":"12","key":"9_CR32","doi-asserted-by":"publisher","first-page":"2227","DOI":"10.1109\/TPAMI.2008.245","volume":"31","author":"M Zaslavskiy","year":"2009","unstructured":"Zaslavskiy, M., Bach, F.R., Vert, J.P.: A path following algorithm for the graph matching problem. TPAMI 31(12), 2227\u20132242 (2009)","journal-title":"TPAMI"},{"key":"9_CR33","doi-asserted-by":"crossref","unstructured":"Zhou, F., Torre, F.: Factorized graph matching. TPAMI (2016)","DOI":"10.1109\/TPAMI.2015.2501802"},{"key":"9_CR34","doi-asserted-by":"crossref","unstructured":"Lee, J., Cho, M., Lee, K.: A graph matching algorithm using data-driven Markov chain Monte Carlo sampling. In: ICPR, pp. 2816\u20132819 (2010)","DOI":"10.1109\/ICPR.2010.690"},{"key":"9_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"624","DOI":"10.1007\/978-3-642-33712-3_45","volume-title":"Computer Vision \u2013 ECCV 2012","author":"Y Suh","year":"2012","unstructured":"Suh, Y., Cho, M., Lee, K.M.: Graph matching via sequential Monte Carlo. In: Fitzgibbon, A., Lazebnik, S., Perona, P., Sato, Y., Schmid, C. (eds.) ECCV 2012. LNCS, vol. 7574, pp. 624\u2013637. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33712-3_45"},{"key":"9_CR36","doi-asserted-by":"crossref","unstructured":"Adamczewski, K., Suh, Y., Lee, K.: Discrete tabu search for graph matching. In: ICCV (2015)","DOI":"10.1109\/ICCV.2015.21"},{"issue":"7","key":"9_CR37","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(7), 929\u2013945 (2011)","journal-title":"CVIU"},{"issue":"6","key":"9_CR38","first-page":"167","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(6), 167 (2012)","journal-title":"ACM Trans. Graph. (TOG)"},{"key":"9_CR39","unstructured":"Pachauri, D., Kondor, R., Vikas, S.: Solving the multi-way matching problem by permutation synchronization. In: NIPS, pp. 1860\u20131868 (2013)"},{"key":"9_CR40","unstructured":"Chen, Y., Leonidas, G., Huang, Q.: Matching partially similar objects via matrix completion. In: ICML (2014)"},{"issue":"3","key":"9_CR41","doi-asserted-by":"publisher","first-page":"532","DOI":"10.1109\/TPAMI.2015.2456892","volume":"38","author":"Q Zhang","year":"2016","unstructured":"Zhang, Q., Song, X., Shao, X., Zhao, H., Shibasaki, R.: Object discovery: soft attributed graph mining. TPAMI 38(3), 532\u2013545 (2016)","journal-title":"TPAMI"},{"key":"9_CR42","doi-asserted-by":"crossref","unstructured":"Zhou, X., Zhu, M., Daniilidis, K.: Multi-image matching via fast alternating minimization. In: ICCV (2015)","DOI":"10.1109\/ICCV.2015.459"},{"issue":"2-3","key":"9_CR43","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1561\/2200000044","volume":"5","author":"Alex Kulesza","year":"2012","unstructured":"Kulesza, A., Taskar, B.: Determinantal point processes for machine learning. Found. Trends$${\\textregistered }$$ Mach. Learn. 5(2\u20133), 123\u2013286 (2012)","journal-title":"Foundations and Trends\u00ae in Machine Learning"},{"key":"9_CR44","unstructured":"Kulesza, A., Taskar, B.: k-DPPs: Fixed-size determinantal point processes. In: ICML, pp. 1193\u20131200 (2011)"},{"issue":"13","key":"9_CR45","doi-asserted-by":"publisher","first-page":"1233","DOI":"10.1080\/03610927808827707","volume":"7","author":"KV Mardia","year":"1978","unstructured":"Mardia, K.V.: Some properties of clasical multi-dimesional scaling. Commun. Stat. Theory Methods 7(13), 1233\u20131241 (1978)","journal-title":"Commun. Stat. Theory Methods"}],"container-title":["Lecture Notes in Computer Science","Computer Vision \u2013 ECCV 2018"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-01261-8_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T18:58:42Z","timestamp":1775242722000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-01261-8_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030012601","9783030012618"],"references-count":45,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-01261-8_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"6 October 2018","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":"Munich","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 September 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 September 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eccv2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eccv2018.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}