{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,11]],"date-time":"2025-01-11T22:40:20Z","timestamp":1736635220630,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540446309"},{"type":"electronic","value":"9783540446323"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11864349_55","type":"book-chapter","created":{"date-parts":[[2006,10,3]],"date-time":"2006-10-03T13:14:44Z","timestamp":1159881284000},"page":"598-609","source":"Crossref","is-referenced-by-count":0,"title":["A New Stereo Matching Model Using Visibility Constraint Based on Disparity Consistency"],"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":"55_CR1","unstructured":"Sun, J., Li, Y., Kang, S.B., Shum, H.Y.: Symmetric stereo matching for occlusion handling. In: CVPR 2005, vol.\u00a0II, pp. 399\u2013406 (2005)"},{"key":"55_CR2","unstructured":"Wei, Y., Quan, L.: Asymmetrical occlusion handling using graph cut for multi-view stereo. In: CVPR 2005, vol.\u00a0II, pp. 902\u2013909 (2005)"},{"key":"55_CR3","doi-asserted-by":"crossref","unstructured":"Williams, O., Isard, M., MacCormick, J.: Estimating disparity and occlusions in stereo video sequences. In: CVPR 2005, vol.\u00a0II, pp. 250\u2013257 (2005)","DOI":"10.1109\/CVPR.2005.146"},{"key":"55_CR4","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1126\/science.968482","volume":"194","author":"D. Marr","year":"1976","unstructured":"Marr, D., Poggio, T.A.: Cooperative computation of stereo disparity. Science\u00a0194, 283\u2013287 (1976)","journal-title":"Science"},{"key":"55_CR5","doi-asserted-by":"crossref","first-page":"675","DOI":"10.1109\/34.865184","volume":"22","author":"C.L. Zitnick","year":"2000","unstructured":"Zitnick, C.L., Kanade, T.: A cooperative algorithm for stereo matching and occlusion detection. PAMI\u00a022, 675\u2013684 (2000)","journal-title":"PAMI"},{"key":"55_CR6","unstructured":"Kolmogorov, V., Zabih, R.: Computing visual correspondence with occlusions via graph cuts. In: CVPR 2004, vol.\u00a0I, pp. 261\u2013268 (2004)"},{"key":"55_CR7","doi-asserted-by":"crossref","unstructured":"Ogale, A.S., Aloimonos, Y.: Stereo correspondence with slanted surface: critical implication of horizontal slant. In: CVPR 2004, vol.\u00a0I, pp. 568\u2013573 (2004)","DOI":"10.1109\/CVPR.2004.1315082"},{"key":"55_CR8","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":"55_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1007\/3-540-47977-5_6","volume-title":"Computer Vision - ECCV 2002","author":"V. Kolmogorov","year":"2002","unstructured":"Kolmogorov, V., Zabih, R.: Multi-camera scene reconstruction via graph cuts. In: Heyden, A., Sparr, G., Nielsen, M., Johansen, P. (eds.) ECCV 2002. LNCS, vol.\u00a02352, pp. 82\u201396. Springer, Heidelberg (2002)"},{"key":"55_CR10","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":"55_CR11","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., Shum, H.: Stereo matching using belief propagation. PAMI\u00a025, 787\u2013800 (2003)","journal-title":"PAMI"},{"key":"55_CR12","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"},{"key":"55_CR13","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1109\/18.910584","volume":"47","author":"Y. Weiss","year":"2001","unstructured":"Weiss, Y., Freeman, W.T.: On the optimality of solutions of the max-product belief propagation algorithm in arbitrary graphs. IEEE Transactions on Information Theory\u00a047, 723\u2013735 (2001)","journal-title":"IEEE Transactions on Information Theory"},{"key":"55_CR14","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":"55_CR15","doi-asserted-by":"crossref","unstructured":"Felzenszwalb, P.R., Huttenlocher, D.P.: Efficient belief propagation for early vision. In: CVPR 2004, vol.\u00a0I, pp. 261\u2013268 (2004)","DOI":"10.1109\/CVPR.2004.1315041"},{"key":"55_CR16","doi-asserted-by":"crossref","first-page":"721","DOI":"10.1109\/TPAMI.1984.4767596","volume":"6","author":"S. Geman","year":"1984","unstructured":"Geman, S., Geman, D.: Stochastic relaxation, gibbs distributions, and the bayesian restoration of images. PAMI\u00a06, 721\u2013741 (1984)","journal-title":"PAMI"},{"key":"55_CR17","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1111\/j.2517-6161.1989.tb01764.x","volume":"51","author":"D. Greig","year":"1989","unstructured":"Greig, D., Porteous, B., Seheult, A.: Exact maximum a posteriori estimation for binary images. Journal of the Royal Statistical Society\u00a051, 271\u2013279 (1989)","journal-title":"Journal of the Royal Statistical Society"},{"key":"55_CR18","doi-asserted-by":"crossref","first-page":"1333","DOI":"10.1109\/TPAMI.2003.1233908","volume":"25","author":"H. Ishikawa","year":"2003","unstructured":"Ishikawa, H.: Exact optimization for markov random fields with convex priors. PAMI\u00a025, 1333\u20131336 (2003)","journal-title":"PAMI"},{"volume-title":"Probabilistic reasoning in intelligent systems: networks of plausible inference","year":"1988","key":"55_CR19","unstructured":"Pearl, J. (ed.): Probabilistic reasoning in intelligent systems: networks of plausible inference. Morgan Kaufmann Publishers Inc., San Francisco (1988)"},{"key":"55_CR20","unstructured":"Yedidia, J.S., Freeman, W.T., Weiss, Y.: Generalized belief propagation. In: Advances in Neural Information Processing Systems, pp. 689\u2013695 (2000)"},{"key":"55_CR21","doi-asserted-by":"crossref","unstructured":"Tappen, F., Freeman, W.T.: Comparison of graph cuts with belief propagation for stereo, using identical mrf parameters. In: ICCV 2003, vol.\u00a0II, pp. 900\u2013906 (2003)","DOI":"10.1109\/ICCV.2003.1238444"},{"key":"55_CR22","first-page":"603","volume":"23","author":"D. Comaniciu","year":"2001","unstructured":"Comaniciu, D., Meer, P.: Mean shift: A robust approach toward feature space analysis. PAMI\u00a023, 603\u2013619 (2001)","journal-title":"PAMI"},{"key":"55_CR23","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":"55_CR24","doi-asserted-by":"crossref","unstructured":"Deng, Y., Yang, Q., Lin, X., Tang, X.: A symmetric patch-based correspondence model for occlusion handling. In: ICCV 2005 (2005)","DOI":"10.1109\/ICCV.2005.23"},{"key":"55_CR25","doi-asserted-by":"crossref","first-page":"1073","DOI":"10.1109\/TPAMI.2004.54","volume":"26","author":"M. Lin","year":"2004","unstructured":"Lin, M., Tomasi, C.: Surfaces with oclusions from layered stereo. PAMI\u00a026, 1073\u20131078 (2004)","journal-title":"PAMI"}],"container-title":["Lecture Notes in Computer Science","Advanced Concepts for Intelligent Vision Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11864349_55.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,11]],"date-time":"2025-01-11T03:09:49Z","timestamp":1736564989000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11864349_55"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540446309","9783540446323"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/11864349_55","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}