{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T18:20:13Z","timestamp":1725906013043},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319646978"},{"type":"electronic","value":"9783319646985"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-64698-5_10","type":"book-chapter","created":{"date-parts":[[2017,7,27]],"date-time":"2017-07-27T03:34:45Z","timestamp":1501126485000},"page":"105-115","source":"Crossref","is-referenced-by-count":0,"title":["Progressive Probabilistic Graph Matching with Local Consistency Regularization"],"prefix":"10.1007","author":[{"given":"Min","family":"Tang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenmin","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,7,28]]},"reference":[{"key":"10_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1007\/978-3-540-88688-4_44","volume-title":"Computer Vision \u2013 ECCV 2008","author":"L Torresani","year":"2008","unstructured":"Torresani, L., Kolmogorov, V., Rother, C.: Feature correspondence via graph matching: models and global optimization. In: Forsyth, D., Torr, P., Zisserman, A. (eds.) ECCV 2008. LNCS, vol. 5303, pp. 596\u2013609. Springer, Heidelberg (2008). doi: 10.1007\/978-3-540-88688-4_44"},{"key":"10_CR2","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":"10_CR3","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":"10_CR4","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":"10_CR5","doi-asserted-by":"crossref","unstructured":"Cour, T., Srinivasan, P., Shi, J.: Balanced graph matching. In: NIPS (2006)","DOI":"10.7551\/mitpress\/7503.003.0044"},{"key":"10_CR6","unstructured":"Leordeanu, M., Herbert, M.: An integer projected fixed point method for graph matching and map inference. In: NIPS (2009)"},{"key":"10_CR7","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). doi: 10.1007\/978-3-642-15555-0_36"},{"key":"10_CR8","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). doi: 10.1007\/978-3-642-33712-3_45"},{"key":"10_CR9","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":"10_CR10","unstructured":"Cho, M., Lee, K.M.: Progressive graph matching: making a move of graphs via probabilistic voting. In: CVPR (2012)"},{"key":"10_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"788","DOI":"10.1007\/978-3-319-10605-2_51","volume-title":"Computer Vision \u2013 ECCV 2014","author":"C Wang","year":"2014","unstructured":"Wang, C., Wang, L., Liu, L.: Progressive mode-seeking on graphs for sparse feature matching. In: Fleet, D., Pajdla, T., Schiele, B., Tuytelaars, T. (eds.) ECCV 2014. LNCS, vol. 8690, pp. 788\u2013802. Springer, Cham (2014). doi: 10.1007\/978-3-319-10605-2_51"},{"key":"10_CR12","doi-asserted-by":"crossref","unstructured":"Ham, B., Cho, M., Schmid, C., Ponce, J.: Proposal flow. In: CVPR (2016)","DOI":"10.1109\/CVPR.2016.378"},{"issue":"1","key":"10_CR13","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1214\/aos\/1176347978","volume":"19","author":"HP Lopuhaa","year":"1991","unstructured":"Lopuhaa, H.P., Rousseeuw, P.J.: Breakdown points of affine equivariant estimators of multivariate location and covariance matrices. Ann. Stat. 19(1), 229\u2013248 (1991)","journal-title":"Ann. Stat."},{"key":"10_CR14","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/BF01587094","volume":"44","author":"R Chandrasekaran","year":"1989","unstructured":"Chandrasekaran, R., Tamir, A.: Open questions concerning Weiszfeld algorithm for the Fermat-Weber location problem. Math. Program. 44, 293\u2013295 (1989)","journal-title":"Math. Program."},{"key":"10_CR15","doi-asserted-by":"crossref","unstructured":"Lowe, D.G.: Object recognition from local scale-invariant features. In: ICCV (1999)","DOI":"10.1109\/ICCV.1999.790410"}],"container-title":["Lecture Notes in Computer Science","Computer Analysis of Images and Patterns"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-64698-5_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,24]],"date-time":"2023-08-24T18:34:32Z","timestamp":1692902072000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-64698-5_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319646978","9783319646985"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-64698-5_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}