{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,4]],"date-time":"2025-12-04T01:44:49Z","timestamp":1764812689161,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540338369"},{"type":"electronic","value":"9783540338376"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"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":[[2006]]},"DOI":"10.1007\/11744078_16","type":"book-chapter","created":{"date-parts":[[2006,7,23]],"date-time":"2006-07-23T22:45:17Z","timestamp":1153694717000},"page":"201-212","source":"Crossref","is-referenced-by-count":29,"title":["A Fast Line Segment Based Dense Stereo Algorithm Using Tree Dynamic Programming"],"prefix":"10.1007","author":[{"given":"Yi","family":"Deng","sequence":"first","affiliation":[]},{"given":"Xueyin","family":"Lin","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"16_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. Int\u2019l J. Comput. Vision\u00a047(1), 7\u201342 (2002), http:\/\/cat.middlebury.edu\/stereo\/","journal-title":"Int\u2019l J. Comput. Vision"},{"issue":"8","key":"16_CR2","doi-asserted-by":"publisher","first-page":"993","DOI":"10.1109\/TPAMI.2003.1217603","volume":"25","author":"M.Z. Brown","year":"2003","unstructured":"Brown, M.Z., Burschka, D., Hager, G.D.: Advances in computational stereo. IEEE Trans. Pattern Anal. Machine Intell.\u00a025(8), 993\u20131008 (2003)","journal-title":"IEEE Trans. Pattern Anal. Machine Intell."},{"key":"16_CR3","unstructured":"Baker, H., Binford, T.: Depth from edge and intensity based stereo. In: Int\u2019l Joint Conf. on Artificial Intell., vol.\u00a02, pp. 384\u2013390 (1981)"},{"issue":"8","key":"16_CR4","first-page":"993","volume":"25","author":"I. Cox","year":"2003","unstructured":"Cox, I., Hingorani, S., Rao, S., Maggs, B.: A maximum likelyhood stereo algorithm. Computer Vision, Graphics and Image Processing\u00a025(8), 993\u20131008 (2003)","journal-title":"Computer Vision, Graphics and Image Processing"},{"key":"16_CR5","doi-asserted-by":"crossref","unstructured":"Sun, J., Li, Y., Kang, S.B., Shum, H.Y.: Symmetric stereo matching for occlusion handling. In: Proc. IEEE Int\u2019l Conf. on Computer Vision and Pattern Recognition, vol.\u00a02, pp. 399\u2013406 (2005)","DOI":"10.1109\/CVPR.2005.337"},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"Kolmogorov, V., Zabih, R.: Computing visual correspondence with occlusions using graph cuts. In: Proc. IEEE Int\u2019l Conf. on Computer Vision, vol.\u00a02, pp. 508\u2013515 (2001)","DOI":"10.1109\/ICCV.2001.937668"},{"issue":"2\/3","key":"16_CR7","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1023\/A:1008192004934","volume":"24","author":"S. Roy","year":"1999","unstructured":"Roy, S.: Stereo without epipolar lines: A maximum-flow formulation. Int\u2019l J. Comput. Vision\u00a024(2\/3), 147\u2013161 (1999)","journal-title":"Int\u2019l J. Comput. Vision"},{"key":"16_CR8","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1109\/TPAMI.1984.4767596","volume":"6","author":"S. Geman","year":"1984","unstructured":"Geman, S., Geman, D.: Gibbs distributions, and the baysian restoration of images. IEEE Trans. Pattern Anal. Machine Intell.\u00a06, 721\u2013741 (1984)","journal-title":"IEEE Trans. Pattern Anal. Machine Intell."},{"key":"16_CR9","doi-asserted-by":"crossref","unstructured":"Veksler, O.: Stereo correspondenc by dynamic programming on a tree. In: Proc. IEEE Int\u2019l Conf. on Computer Vision and Pattern Recognition, vol.\u00a02, pp. 384\u2013390 (2005)","DOI":"10.1109\/CVPR.2005.334"},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"Tao, H., Sawhney, H.S., Kumar, R.: A global matching framework for stereo computation. In: Proc. IEEE Int\u2019l Conf. on Computer Vision, vol.\u00a01, pp. 532\u2013539 (2001)","DOI":"10.1109\/ICCV.2001.937562"},{"key":"16_CR11","doi-asserted-by":"crossref","unstructured":"Wei, Y., Quan, L.: Region-based progressive stereo matching. In: Proc. IEEE Int\u2019l Conf. on Computer Vision and Pattern Recognition, vol.\u00a01, pp. 106\u2013113 (2004)","DOI":"10.1109\/CVPR.2004.1315020"},{"key":"16_CR12","doi-asserted-by":"crossref","unstructured":"Hong, L., Chen, G.: Segment-based stereo matching using graph cuts. In: Proc. IEEE Int\u2019l Conf. on Computer Vision and Pattern Recognition, vol.\u00a01, pp. 74\u201381 (2004)","DOI":"10.1109\/CVPR.2004.1315016"},{"key":"16_CR13","doi-asserted-by":"crossref","unstructured":"Deng, Y., Yang, Q., Lin, X., Tang, X.: A symmetric patch-based correspondence model for occlusion handling. In: Proc. IEEE Int\u2019l Conf. on Computer Vision, Beijing, China, vol.\u00a0II, pp. 1316\u20131322 (2005)","DOI":"10.1109\/ICCV.2005.23"},{"key":"16_CR14","doi-asserted-by":"crossref","unstructured":"Comaniciu, D., Meer, P.: Robust analysis of feature spaces: Color image segmentation. In: Proc. IEEE Int\u2019l Conf. on Computer Vision and Pattern Recognition, Puerto Rico, pp. 750\u2013755 (1997)","DOI":"10.1109\/CVPR.1997.609410"},{"issue":"8","key":"16_CR15","doi-asserted-by":"publisher","first-page":"888","DOI":"10.1109\/34.868688","volume":"22","author":"J. Shi","year":"2000","unstructured":"Shi, J., Malik, J.: Normalized cuts and image segmentation. IEEE Trans. Pattern Anal. Machine Intell.\u00a022(8), 888\u2013905 (2000)","journal-title":"IEEE Trans. Pattern Anal. Machine Intell."},{"issue":"3","key":"16_CR16","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1137\/S0036144598345802","volume":"41","author":"C.V. Stewart","year":"1999","unstructured":"Stewart, C.V.: Robust parameter estimation in computer vision. SIAM Reviews\u00a041(3), 513\u2013537 (1999)","journal-title":"SIAM Reviews"},{"key":"16_CR17","doi-asserted-by":"crossref","unstructured":"Felzenszwalb, P.F., Huttenlocher, D.P.: Efficient belief propagation for early vision. In: Proc. IEEE Int\u2019l Conf. on Computer Vision and Pattern Recognition, vol.\u00a01, pp. 261\u2013268 (2004)","DOI":"10.1109\/CVPR.2004.1315041"},{"issue":"4","key":"16_CR18","doi-asserted-by":"publisher","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. IEEE Trans. Pattern Anal. Machine Intell.\u00a020(4), 401\u2013406 (1998)","journal-title":"IEEE Trans. Pattern Anal. Machine Intell."},{"key":"16_CR19","doi-asserted-by":"crossref","unstructured":"Cox, I.J., Roy, S., Hingorani, S.L.: Dynamic histogram warping of image pairs for constant image brightness. In: Proc. Int\u2019l Conf. on Image Processing, vol.\u00a0II, pp. 366\u2013369 (1995)","DOI":"10.1109\/ICIP.1995.537491"}],"container-title":["Lecture Notes in Computer Science","Computer Vision \u2013 ECCV 2006"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11744078_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,10]],"date-time":"2025-01-10T01:30:52Z","timestamp":1736472652000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11744078_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540338369","9783540338376"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/11744078_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}