{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T22:17:16Z","timestamp":1743113836880,"version":"3.40.3"},"publisher-location":"Cham","reference-count":40,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030012694"},{"type":"electronic","value":"9783030012700"}],"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-01270-0_38","type":"book-chapter","created":{"date-parts":[[2018,10,5]],"date-time":"2018-10-05T22:07:51Z","timestamp":1538777271000},"page":"646-662","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Adaptively Transforming Graph Matching"],"prefix":"10.1007","author":[{"given":"Fudong","family":"Wang","sequence":"first","affiliation":[]},{"given":"Nan","family":"Xue","sequence":"additional","affiliation":[]},{"given":"Yipeng","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Xiang","family":"Bai","sequence":"additional","affiliation":[]},{"given":"Gui-Song","family":"Xia","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,10,6]]},"reference":[{"issue":"4","key":"38_CR1","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1109\/34.993558","volume":"24","author":"SJ Belongie","year":"2002","unstructured":"Belongie, S.J., 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."},{"key":"38_CR2","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1016\/j.patrec.2016.10.001","volume":"87","author":"S Bougleux","year":"2017","unstructured":"Bougleux, S., Brun, L., Carletti, V., Foggia, P., Ga\u00fcz\u00e8re, B., Vento, M.: Graph edit distance as a quadratic assignment problem. Pattern Recognit. Lett. 87, 38\u201346 (2017)","journal-title":"Pattern Recognit. Lett."},{"issue":"6","key":"38_CR3","doi-asserted-by":"publisher","first-page":"1048","DOI":"10.1109\/TPAMI.2009.28","volume":"31","author":"TS Caetano","year":"2009","unstructured":"Caetano, T.S., McAuley, J.J., Cheng, L., Le, Q.V., Smola, A.J.: Learning graph matching. IEEE Trans. Pattern Anal. Mach. Intell. 31(6), 1048\u20131058 (2009)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"38_CR4","doi-asserted-by":"crossref","unstructured":"Cand\u00e8s, E.J., Wakin, M.B., Boyd, S.P.: Enhancing sparsity by reweighted $$l_1$$ minimization. J. Fourier Anal. Appl. 14(5), 877\u2013905 (2008)","DOI":"10.1007\/s00041-008-9045-x"},{"key":"38_CR5","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":"38_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. In: CVPR (2014)","DOI":"10.1109\/CVPR.2014.268"},{"key":"38_CR7","doi-asserted-by":"crossref","unstructured":"Cour, T., Srinivasan, P., Shi, J.: Balanced graph matching. In: NIPS (2006)","DOI":"10.7551\/mitpress\/7503.003.0044"},{"issue":"9","key":"38_CR8","doi-asserted-by":"publisher","first-page":"1853","DOI":"10.1109\/TPAMI.2016.2615921","volume":"39","author":"N Courty","year":"2017","unstructured":"Courty, N., Flamary, R., Tuia, D., Rakotomamonjy, A.: Optimal transport for domain adaptation. IEEE Trans. Pattern Anal. Mach. Intell. 39(9), 1853\u20131865 (2017)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"38_CR9","doi-asserted-by":"crossref","unstructured":"Duchenne, O., Joulin, A., Ponce, J.: A graph-matching kernel for object categorization. In: ICCV (2011)","DOI":"10.1109\/ICCV.2011.6126445"},{"issue":"1","key":"38_CR10","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. IEEE Trans. Pattern Anal. Mach. Intell. 35(1), 18\u201327 (2013)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"38_CR11","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & company, New York (1979)"},{"issue":"6","key":"38_CR12","doi-asserted-by":"publisher","first-page":"1258","DOI":"10.1109\/TPAMI.2015.2477823","volume":"38","author":"V Garro","year":"2016","unstructured":"Garro, V., Giachetti, A.: Scale space graph representation and Kernel matching for non rigid and textured 3D shape retrieval. IEEE Trans. Pattern Anal. Mach. Intell. 38(6), 1258\u20131271 (2016)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"4","key":"38_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. IEEE Trans. Pattern Anal. Mach. Intell. 18(4), 377\u2013388 (1996)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"1","key":"38_CR14","first-page":"147","volume":"3","author":"AA Goldstein","year":"1965","unstructured":"Goldstein, A.A.: On steepest descent. SIAM J. Control Optim. 3(1), 147\u2013151 (1965)","journal-title":"SIAM J. Control Optim."},{"key":"38_CR15","doi-asserted-by":"crossref","unstructured":"Jiang, B., Tang, J., Ding, C., Luo, B.: Binary constraint preserving graph matching. In: CVPR (2017)","DOI":"10.1109\/CVPR.2017.66"},{"issue":"4","key":"38_CR16","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/BF02278710","volume":"38","author":"R Jonker","year":"1987","unstructured":"Jonker, R., Volgenant, A.: A shortest augmenting path algorithm for dense and sparse linear assignment problems. Computing 38(4), 325\u2013340 (1987)","journal-title":"Computing"},{"key":"38_CR17","first-page":"29","volume-title":"50 Years of Integer Programming 1958-2008","author":"Harold W. Kuhn","year":"2009","unstructured":"Kuhn, H.W.: The Hungarian method for the assignment problem. In: 50 Years of Integer Programming 1958\u20132008 - From the Early Years to the State-of-the-Art, pp. 29\u201347. Springer, Berlin (2010)"},{"key":"38_CR18","unstructured":"Lacoste-Julien, S., Jaggi, M.: On the global linear convergence of Frank-Wolfe optimization variants. In: NIPS (2015)"},{"key":"38_CR19","doi-asserted-by":"crossref","unstructured":"L\u00ea-Huu, D.K., Paragios, N.: Alternating direction graph matching. In: CVPR (2017)","DOI":"10.1109\/CVPR.2017.522"},{"key":"38_CR20","doi-asserted-by":"crossref","unstructured":"Lee, J., Cho, M., Lee, K.M.: A graph matching algorithm using data-driven Markov chain Monte Carlo sampling. In: ICPR (2010)","DOI":"10.1109\/ICPR.2010.690"},{"key":"38_CR21","doi-asserted-by":"crossref","unstructured":"Lee, J., Cho, M., Lee, K.M.: Hyper-graph matching via reweighted random walks. In: CVPR (2011)","DOI":"10.1109\/CVPR.2011.5995387"},{"key":"38_CR22","doi-asserted-by":"crossref","unstructured":"Leordeanu, M., Hebert, M.: A spectral technique for correspondence problems using pairwise constraints. In: ICCV (2005)","DOI":"10.1109\/ICCV.2005.20"},{"key":"38_CR23","unstructured":"Leordeanu, M., Hebert, M., Sukthankar, R.: An integer projected fixed point method for graph matching and map inference. In: NIPS (2009)"},{"issue":"1","key":"38_CR24","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":"6","key":"38_CR25","doi-asserted-by":"publisher","first-page":"1258","DOI":"10.1109\/TPAMI.2013.223","volume":"36","author":"ZY Liu","year":"2014","unstructured":"Liu, Z.Y., Qiao, H.: GNCCP\u2014graduated nonconvexity and concavity procedure. IEEE Trans. Pattern Anal. Mach. Intell. 36(6), 1258\u20131267 (2014)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"3","key":"38_CR26","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/s11263-014-0707-7","volume":"109","author":"Z Liu","year":"2014","unstructured":"Liu, Z., Qiao, H., Yang, X., Hoi, S.C.H.: Graph matching by simplified convex-concave relaxation procedure. Int. J. Comput. Vis. 109(3), 169\u2013186 (2014)","journal-title":"Int. J. Comput. Vis."},{"issue":"2","key":"38_CR27","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.M., Netto, P.O.B., Hahn, P., Querido, T.M.: A survey for the quadratic assignment problem. Eur. J. Oper. Res. 176(2), 657\u2013690 (2007)","journal-title":"Eur. J. Oper. Res."},{"issue":"11","key":"38_CR28","doi-asserted-by":"publisher","first-page":"1105","DOI":"10.1109\/34.809105","volume":"21","author":"M Pelillo","year":"1999","unstructured":"Pelillo, M., Siddiqi, K., Zucker, S.W.: Matching hierarchical structures using association graphs. IEEE Trans. Pattern Anal. Mach. Intell. 21(11), 1105\u20131120 (1999)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"11","key":"38_CR29","doi-asserted-by":"publisher","first-page":"2171","DOI":"10.1109\/TPAMI.2016.2636200","volume":"39","author":"MA Pinheiro","year":"2017","unstructured":"Pinheiro, M.A., Kybic, J., Fua, P.: Geometric graph matching using Monte Carlo tree search. IEEE Trans. Pattern Anal. Mach. Intell. 39(11), 2171\u20132185 (2017)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"1","key":"38_CR30","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1016\/j.engappai.2008.04.006","volume":"22","author":"K Riesen","year":"2009","unstructured":"Riesen, K., Bunke, H.: Reducing the dimensionality of dissimilarity space embedding graph Kernels. Eng. Appl. AI 22(1), 48\u201356 (2009)","journal-title":"Eng. Appl. AI"},{"key":"38_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/978-3-319-46487-9_9","volume-title":"Computer Vision \u2013 ECCV 2016","author":"T Shen","year":"2016","unstructured":"Shen, T., Zhu, S., Fang, T., Zhang, R., Quan, L.: Graph-based consistent matching for structure-from-motion. In: Leibe, B., Matas, J., Sebe, N., Welling, M. (eds.) ECCV 2016. LNCS, vol. 9907, pp. 139\u2013155. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-46487-9_9"},{"issue":"2","key":"38_CR32","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1109\/TPAMI.2012.105","volume":"35","author":"L Torresani","year":"2013","unstructured":"Torresani, L., Kolmogorov, V., Rother, C.: A dual decomposition approach to feature correspondence. IEEE Trans. Pattern Anal. Mach. Intell. 35(2), 259\u2013271 (2013)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"1","key":"38_CR33","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1109\/TIP.2017.2754945","volume":"27","author":"N Xue","year":"2018","unstructured":"Xue, N., Xia, G., Bai, X., Zhang, L., Shen, W.: Anisotropic-scale junction detection and matching for indoor images. IEEE Trans. Image Process. 27(1), 78\u201391 (2018)","journal-title":"IEEE Trans. Image Process."},{"key":"38_CR34","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":"38_CR35","doi-asserted-by":"crossref","unstructured":"Yan, J., Zhang, C., Zha, H., Liu, W., Yang, X., Chu, S.M.: Discrete hyper-graph matching. In: CVPR (2015)","DOI":"10.1109\/CVPR.2015.7298759"},{"key":"38_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/978-3-642-33765-9_13","volume-title":"Computer Vision \u2013 ECCV 2012","author":"B Yao","year":"2012","unstructured":"Yao, B., Fei-Fei, L.: Action recognition with exemplar based 2.5D graph matching. In: Fitzgibbon, A., Lazebnik, S., Perona, P., Sato, Y., Schmid, C. (eds.) ECCV 2012. LNCS, vol. 7575, pp. 173\u2013186. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33765-9_13"},{"key":"38_CR37","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/j.patcog.2015.09.029","volume":"51","author":"JG Yu","year":"2016","unstructured":"Yu, J.G., Xia, G.S., Samal, A., Tian, J.: Globally consistent correspondence of multiple feature sets using proximal Gauss Seidel relaxation. Pattern Recognit. 51, 255\u2013267 (2016)","journal-title":"Pattern Recognit."},{"issue":"12","key":"38_CR38","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.: A path following algorithm for the graph matching problem. IEEE Trans. Pattern Anal. Mach. Intell. 31(12), 2227\u20132242 (2009)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"38_CR39","doi-asserted-by":"crossref","unstructured":"Zass, R., Shashua, A.: Probabilistic graph and hypergraph matching. In: CVPR (2008)","DOI":"10.1109\/CVPR.2008.4587500"},{"issue":"9","key":"38_CR40","doi-asserted-by":"publisher","first-page":"1774","DOI":"10.1109\/TPAMI.2015.2501802","volume":"38","author":"F Zhou","year":"2016","unstructured":"Zhou, F., la Torre, F.D.: Factorized graph matching. IEEE Trans. Pattern Anal. Mach. Intell. 38(9), 1774\u20131789 (2016)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."}],"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-01270-0_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,5]],"date-time":"2023-09-05T17:46:55Z","timestamp":1693936015000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-01270-0_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030012694","9783030012700"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-01270-0_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"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"}]}}