{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T16:03:11Z","timestamp":1725552191857},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540312192"},{"type":"electronic","value":"9783540324331"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11612032_4","type":"book-chapter","created":{"date-parts":[[2006,1,13]],"date-time":"2006-01-13T15:35:22Z","timestamp":1137166522000},"page":"31-40","source":"Crossref","is-referenced-by-count":2,"title":["Stereo Matching Using Iterated Graph Cuts and Mean Shift Filtering"],"prefix":"10.1007","author":[{"given":"Ju Yong","family":"Chang","sequence":"first","affiliation":[]},{"given":"Kyoung Mu","family":"Lee","sequence":"additional","affiliation":[]},{"given":"Sang Uk","family":"Lee","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1023\/A:1014573219977","volume":"47","author":"D. Scharstein","year":"2002","unstructured":"Scharstein, D., Szeliski, R.: A taxonomy and evaluation of dense two-frame stereo correspondence algorithms. IJCV\u00a047, 7\u201342 (2002)","journal-title":"IJCV"},{"key":"4_CR2","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1109\/34.677269","volume":"20","author":"S. Birchfield","year":"1998","unstructured":"Birchfield, S., Tomasi, C.: A pixel dissimilarity measure that is insensitive to image sampling. PAMI\u00a020, 401\u2013406 (1998)","journal-title":"PAMI"},{"key":"4_CR3","doi-asserted-by":"crossref","first-page":"1222","DOI":"10.1109\/34.969114","volume":"23","author":"Y. Boykov","year":"2001","unstructured":"Boykov, Y., Veksler, O., Zabih, R.: Fast approximate energy minimization via graph cuts. PAMI\u00a023, 1222\u20131239 (2001)","journal-title":"PAMI"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Kolmogorov, V., Zabih, R.: Computing visual correspondence with occlusions using graph cuts. In: ICCV 2001, pp. 508\u2013515 (2001)","DOI":"10.1109\/ICCV.2001.937668"},{"key":"4_CR5","doi-asserted-by":"crossref","first-page":"787","DOI":"10.1109\/TPAMI.2003.1206509","volume":"25","author":"J. Sun","year":"2003","unstructured":"Sun, J., Zheng, N.N., Shum, H.Y.: Stereo matching using belief propagation. PAMI\u00a025, 787\u2013800 (2003)","journal-title":"PAMI"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Tao, H., Sawhney, H.: A global matching framework for stereo computation. In: ICCV 2001, vol. I, pp. 532\u2013539 (2001)","DOI":"10.1109\/ICCV.2001.937562"},{"key":"4_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/3-540-47967-8_15","volume-title":"Computer Vision - ECCV 2002","author":"F. Ernst","year":"2002","unstructured":"Ernst, F., Wilinski, P., Overveld, K.V.: Dense structure-from-motion: An approach based on segment matching. In: Heyden, A., Sparr, G., Nielsen, M., Johansen, P. (eds.) ECCV 2002. LNCS, vol.\u00a02351, pp. 217\u2013231. Springer, Heidelberg (2002)"},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"Hong, L., Chen, G.: Segment-based stereo matching using graph cuts. In: CVPR 2004, vol.\u00a0I, pp. 74\u201381 (2004)","DOI":"10.1109\/CVPR.2004.1315016"},{"key":"4_CR9","unstructured":"Wei, Y., Quan, L.: Region-based progressive stereo matching. In: CVPR 2004, vol.\u00a0I, pp. 106\u2013113 (2004)"},{"key":"4_CR10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/34.1000236","volume":"24","author":"D. Comaniciu","year":"2002","unstructured":"Comaniciu, D., Meer, P.: Mean shift: A robust approach toward feature space analysis. PAMI\u00a024, 1\u201318 (2002)","journal-title":"PAMI"},{"key":"4_CR11","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1109\/TPAMI.2004.1262177","volume":"26","author":"V. Kolmogorov","year":"2004","unstructured":"Kolmogorov, V., Zabih, R.: What energy functions can be minimized via graph cuts. PAMI\u00a026, 147\u2013159 (2004)","journal-title":"PAMI"}],"container-title":["Lecture Notes in Computer Science","Computer Vision \u2013 ACCV 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11612032_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:09:58Z","timestamp":1619492998000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11612032_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540312192","9783540324331"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/11612032_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}