{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T15:46:53Z","timestamp":1772725613766,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642155543","type":"print"},{"value":"9783642155550","type":"electronic"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15555-0_36","type":"book-chapter","created":{"date-parts":[[2010,9,5]],"date-time":"2010-09-05T14:56:32Z","timestamp":1283698592000},"page":"492-505","source":"Crossref","is-referenced-by-count":240,"title":["Reweighted Random Walks for Graph Matching"],"prefix":"10.1007","author":[{"given":"Minsu","family":"Cho","sequence":"first","affiliation":[]},{"given":"Jungmin","family":"Lee","sequence":"additional","affiliation":[]},{"given":"Kyoung Mu","family":"Lee","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"36_CR1","doi-asserted-by":"crossref","unstructured":"Conte, D., Foggia, P., Sansone, C., Vento, M.: Thirty years of graph matching in pattern recognition. In: IJPRAI (2004)","DOI":"10.1142\/S0218001404003228"},{"key":"36_CR2","doi-asserted-by":"crossref","unstructured":"Berg, A.C., Berg, T.L., Malik, J.: Shape matching and object recognition using low distortion correspondences. In: CVPR (2005)","DOI":"10.1007\/11957959_25"},{"key":"36_CR3","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":"36_CR4","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":"36_CR5","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, Part II. LNCS, vol.\u00a05303, pp. 596\u2013609. Springer, Heidelberg (2008)"},{"key":"36_CR6","doi-asserted-by":"crossref","unstructured":"Zass, R., Shashua, A.: Probabilistic graph and hypergraph matching. In: CVPR (2008)","DOI":"10.1109\/CVPR.2008.4587500"},{"key":"36_CR7","doi-asserted-by":"crossref","unstructured":"Duchenne, O., Bach, F., Kweon, I., Ponce, J.: A tensor-based algorithm for high-order graph matching. In: CVPR (2009)","DOI":"10.1109\/CVPR.2009.5206619"},{"key":"36_CR8","unstructured":"Leordeanu, M., Herbert, M.: An integer projected fixed point method for graph matching and map inference. In: NIPS (2009)"},{"key":"36_CR9","doi-asserted-by":"crossref","unstructured":"Kleinberg, J.: Authoritative sources in a hyperlinked environment. Journal of the ACM (1999)","DOI":"10.1145\/324133.324140"},{"key":"36_CR10","unstructured":"Page, L., Brin, S., Motwani, R., Winograd, T.: The pagerank citation ranking: Bringing order to the web. Technical Report, Stanford University (1998)"},{"key":"36_CR11","doi-asserted-by":"crossref","unstructured":"Haveliwala, T.H.: Topic-sensitive pagerank. In: WWW (2002)","DOI":"10.1145\/511511.511513"},{"key":"36_CR12","doi-asserted-by":"crossref","unstructured":"Maciel, J., Costeira, J.P.: A global solution to sparse correspondence problems. PAMI (2003)","DOI":"10.1109\/TPAMI.2003.1177151"},{"key":"36_CR13","doi-asserted-by":"crossref","unstructured":"Gold, S., Rangarajan, A.: A graduated assignment algorithm for graph matching. PAMI (1996)","DOI":"10.1109\/CVPR.1996.517080"},{"key":"36_CR14","doi-asserted-by":"crossref","unstructured":"van Wyk, B.J., van Wyk, M.A.: A pocs-based graph matching algorithm. PAMI (2004)","DOI":"10.1109\/TPAMI.2004.95"},{"key":"36_CR15","doi-asserted-by":"crossref","unstructured":"Lee, J., Cho, M., Lee, K.M.: Graph matching algorithm using data-driven markov chain monte carlo sampling. In: ICPR (2010)","DOI":"10.1109\/ICPR.2010.690"},{"key":"36_CR16","doi-asserted-by":"crossref","unstructured":"Gori, M., Maggini, M., Sarti, L.: Exact and approximate graph matching using random walks. PAMI (2005)","DOI":"10.1109\/TPAMI.2005.138"},{"key":"36_CR17","doi-asserted-by":"crossref","unstructured":"Robles-Kelly, A., Hancock, E.R.: String edit distance, random walks and graph matching. In: IJPRAI (2004)","DOI":"10.1142\/S0218001404003277"},{"key":"36_CR18","doi-asserted-by":"crossref","unstructured":"Sinkhorn, R.: A relationship between arbitrary positive matrices and doubly stochastic matrices. Ann. Math. Statistics (1964)","DOI":"10.1214\/aoms\/1177703591"},{"key":"36_CR19","doi-asserted-by":"crossref","unstructured":"Langville, A.N., Meyer, C.D.: Deeper inside pagerank. Internet Mathematics (2003)","DOI":"10.1080\/15427951.2004.10129091"},{"key":"36_CR20","volume-title":"Non negative matrices and markov chains","author":"E. Seneta","year":"2006","unstructured":"Seneta, E.: Non negative matrices and markov chains. Springer, Heidelberg (2006)"},{"key":"36_CR21","volume-title":"Algorithms for the assignment and transportation problems","author":"J. Munkres","year":"1957","unstructured":"Munkres, J.: Algorithms for the assignment and transportation problems. SIAM, Philadelphia (1957)"},{"key":"36_CR22","doi-asserted-by":"crossref","unstructured":"Matas, J., Chum, O., Urban, M., Pajdla, T.: Robust wide baseline stereo from maximally stable extremal regions. In: BMVC (2002)","DOI":"10.5244\/C.16.36"},{"key":"36_CR23","doi-asserted-by":"crossref","unstructured":"Lowe, D.G.: Object recognition from local scale-invariant features. In: ICCV, pp. 1150\u20131157 (1999)","DOI":"10.1109\/ICCV.1999.790410"},{"key":"36_CR24","unstructured":"Cho, M., Lee, J., Lee, K.M.: Feature correspondence and deformable object matching via agglomerative correspondence clustering. In: ICCV (2009)"}],"container-title":["Lecture Notes in Computer Science","Computer Vision \u2013 ECCV 2010"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15555-0_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,30]],"date-time":"2024-03-30T04:34:58Z","timestamp":1711773298000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15555-0_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642155543","9783642155550"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15555-0_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}