{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T16:03:44Z","timestamp":1761581024077,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642337116"},{"type":"electronic","value":"9783642337123"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"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":[[2012]]},"DOI":"10.1007\/978-3-642-33712-3_45","type":"book-chapter","created":{"date-parts":[[2012,9,26]],"date-time":"2012-09-26T03:00:38Z","timestamp":1348628438000},"page":"624-637","source":"Crossref","is-referenced-by-count":21,"title":["Graph Matching via Sequential Monte Carlo"],"prefix":"10.1007","author":[{"given":"Yumin","family":"Suh","sequence":"first","affiliation":[]},{"given":"Minsu","family":"Cho","sequence":"additional","affiliation":[]},{"given":"Kyoung Mu","family":"Lee","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"45_CR1","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"},{"key":"45_CR2","doi-asserted-by":"crossref","unstructured":"Cao, Y., Zhang, Z., Czogiel, I., Dryden, I., Wang, S.: 2d nonrigid partial shape matching using mcmc and contour subdivision. In: CVPR (2011)","DOI":"10.1109\/CVPR.2011.5995588"},{"key":"45_CR3","unstructured":"Birchfield, S.: KLT: An implementation of the kanade-lucas-tomasi feature tracker (1998)"},{"key":"45_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":"45_CR5","unstructured":"Leordeanu, M., Hebert, M.: An integer projected fixed point method for graph matching and map inference. In: NIPS (2009)"},{"key":"45_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, Part V. LNCS, vol.\u00a06315, pp. 492\u2013505. Springer, Heidelberg (2010)"},{"key":"45_CR7","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":"45_CR8","doi-asserted-by":"crossref","unstructured":"Duchenne, O., Bach, F., Kweon, I.S., Ponce, J.: A tensor-based algorithm for high-order graph matching. PAMI (2010)","DOI":"10.1109\/CVPRW.2009.5206619"},{"key":"45_CR9","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":"45_CR10","doi-asserted-by":"crossref","unstructured":"Caetano, T., McAuley, J., Cheng, L., Le, Q., Smola, A.: Learning graph matching. PAMI (2009)","DOI":"10.1109\/TPAMI.2009.28"},{"key":"45_CR11","doi-asserted-by":"crossref","unstructured":"Leordeanu, M., Hebert, M.: Unsupervised learning for graph matching. In: CVPR (2009)","DOI":"10.1109\/CVPRW.2009.5206533"},{"key":"45_CR12","unstructured":"Cho, M., Lee, K.M.: Progressive graph matching: Making a move of graphs via probabilistic voting. In: CVPR (2012)"},{"key":"45_CR13","doi-asserted-by":"crossref","unstructured":"Capp\u00e9, O., Godsill, S., Moulines, E.: An overview of existing methods and recent advances in sequential monte carlo. Proc. IEEE (2007)","DOI":"10.1109\/JPROC.2007.893250"},{"key":"45_CR14","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1109\/TPAMI.2003.1177151","volume":"25","author":"J. Maciel","year":"2003","unstructured":"Maciel, J., Costeira, J.P.: A global solution to sparse correspondence problems. PAMI\u00a025, 187\u2013199 (2003)","journal-title":"PAMI"},{"key":"45_CR15","doi-asserted-by":"crossref","unstructured":"Gold, S., Rangarajan, A.: A graduated assignment algorithm for graph matching. PAMI, 411\u2013436 (1996)","DOI":"10.1109\/CVPR.1996.517080"},{"key":"45_CR16","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":"45_CR17","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":"45_CR18","unstructured":"Dellaert, F., Seitz, S.M., Thrun, S., Thorpe, C.: Feature correspondence: A markov chain monte carlo approach. In: NIPS (2001)"},{"key":"45_CR19","doi-asserted-by":"crossref","unstructured":"Tamminen, T., Lampinen, J.: Sequential monte carlo for bayesian matching of objects with occlusions. PAMI (2006)","DOI":"10.1109\/TPAMI.2006.128"},{"key":"45_CR20","unstructured":"Lu, C., Latecki, L.J., Adluru, N., Yang, X., Ling, H.: Shape guided contour grouping with particle filters. In: ICCV (2009)"},{"key":"45_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"757","DOI":"10.1007\/978-3-642-15555-0_55","volume-title":"Computer Vision \u2013 ECCV 2010","author":"X. Yang","year":"2010","unstructured":"Yang, X., Latecki, L.J.: Weakly Supervised Shape Based Object Detection with Particle Filter. In: Daniilidis, K., Maragos, P., Paragios, N. (eds.) ECCV 2010, Part V. LNCS, vol.\u00a06315, pp. 757\u2013770. Springer, Heidelberg (2010)"},{"key":"45_CR22","unstructured":"Isard, M., Blake, A.: Condensation - conditional density propagation for visual tracking. IJCV (1998)"},{"key":"45_CR23","doi-asserted-by":"crossref","unstructured":"Moral, P.D., Doucet, A.: Sequential monte carlo for bayesian computation. Journal of the Royal Statistical Society (2007)","DOI":"10.1002\/0471667196.ess5089"},{"key":"45_CR24","doi-asserted-by":"crossref","unstructured":"Moral, P.D., Doucet, A., Jarsa, A.: Sequential monte carlo samplers. Journal of the Royal Statistical Society, 411\u2013436 (2006)","DOI":"10.1111\/j.1467-9868.2006.00553.x"},{"key":"45_CR25","doi-asserted-by":"crossref","unstructured":"Zass, R., Shashua, A.: Probabilistic graph and hypergraph matching. In: CVPR (2008)","DOI":"10.1109\/CVPR.2008.4587500"},{"key":"45_CR26","doi-asserted-by":"crossref","unstructured":"Munkres, J.: Algorithms for the assignment and transportation problems. SIAM (1957)","DOI":"10.1002\/nav.3800040112"},{"key":"45_CR27","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"}],"container-title":["Lecture Notes in Computer Science","Computer Vision \u2013 ECCV 2012"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33712-3_45","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,29]],"date-time":"2024-04-29T20:21:48Z","timestamp":1714422108000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33712-3_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642337116","9783642337123"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33712-3_45","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}