{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T08:39:48Z","timestamp":1774600788125,"version":"3.50.1"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319117515","type":"print"},{"value":"9783319117522","type":"electronic"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-11752-2_4","type":"book-chapter","created":{"date-parts":[[2014,10,14]],"date-time":"2014-10-14T06:05:43Z","timestamp":1413266743000},"page":"43-53","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":33,"title":["Semi-Global Matching: A Principled Derivation in Terms of Message Passing"],"prefix":"10.1007","author":[{"given":"Amnon","family":"Drory","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carsten","family":"Haubold","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shai","family":"Avidan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fred A.","family":"Hamprecht","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,10,15]]},"reference":[{"issue":"11","key":"4_CR1","doi-asserted-by":"publisher","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. IEEE Trans. Pattern Anal. Mach. Intell. 23(11), 1222\u20131239 (2001)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"7","key":"4_CR2","doi-asserted-by":"publisher","first-page":"077003","DOI":"10.1117\/1.3159869","volume":"48","author":"M Frank","year":"2009","unstructured":"Frank, M., Plaue, M., Hamprecht, F.A.: Denoising of continuous-wave time-of-flight depth images using confidence measures. Opt. Eng. 48(7), 077003 (2009)","journal-title":"Opt. Eng."},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"Geiger, A., Lenz, P., Urtasun, R.: Are we ready for autonomous driving? the kitti vision benchmark suite. In: 2012 IEEE Conference on Computer Vision and Pattern Recognition (CVPR), pp. 3354\u20133361. IEEE (2012)","DOI":"10.1109\/CVPR.2012.6248074"},{"key":"4_CR4","unstructured":"Heskes, T., et al.: Stable fixed points of loopy belief propagation are minima of the bethe free energy. In: Advances in Neural Information Processing Systems 15, pp. 359\u2013366 (2003)"},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"Hirschmuller, H.: Accurate and efficient stereo processing by semi-global matching and mutual information. In: IEEE Computer Society Conference on Computer Vision and Pattern Recognition, CVPR 2005, vol. 2, pp. 807\u2013814. IEEE (2005)","DOI":"10.1109\/CVPR.2005.56"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Hu, X., Mordohai, P.: Evaluation of stereo confidence indoors and outdoors. In: 2010 IEEE Conference on Computer Vision and Pattern Recognition (CVPR), pp. 1466\u20131473. IEEE (2010)","DOI":"10.1109\/CVPR.2010.5539798"},{"issue":"10","key":"4_CR7","doi-asserted-by":"publisher","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. IEEE Trans. Pattern Anal. Mach. Intell. 25(10), 1333\u20131336 (2003)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"4_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/11744047_3","volume-title":"Computer Vision \u2013 ECCV 2006","author":"P Kohli","year":"2006","unstructured":"Kohli, P., Torr, P.: Measuring uncertainty in graph cut solutions - efficiently computing min-marginal energies using dynamic graph cuts. In: Leonardis, A., Bischof, H., Pinz, A. (eds.) ECCV 2006. LNCS, vol. 3952, pp. 30\u201343. Springer, Heidelberg (2006)"},{"issue":"10","key":"4_CR9","doi-asserted-by":"publisher","first-page":"1568","DOI":"10.1109\/TPAMI.2006.200","volume":"28","author":"V Kolmogorov","year":"2006","unstructured":"Kolmogorov, V.: Convergent tree-reweighted message passing for energy minimization. IEEE Trans. Pattern Anal. Mach. Intell. 28(10), 1568\u20131583 (2006)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"2","key":"4_CR10","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1109\/TPAMI.2004.1262177","volume":"26","author":"V Kolmogorov","year":"2004","unstructured":"Kolmogorov, V., Zabin, R.: What energy functions can be minimized via graph cuts? IEEE Trans. Pattern Anal. Mach. Intell. 26(2), 147\u2013159 (2004)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"4_CR11","volume-title":"ProbabIlistic Reasoning in Intelligent Systems: Networks of Plausible Inference","author":"J Pearl","year":"1988","unstructured":"Pearl, J.: ProbabIlistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann, San Francisco (1988)"},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"Perrollaz, M., Spalanzani, A., Aubert, D.: Probabilistic representation of the uncertainty of stereo-vision and application to obstacle detection. In: 2010 IEEE Intelligent Vehicles Symposium (IV), pp. 313\u2013318. IEEE (2010)","DOI":"10.1109\/IVS.2010.5548010"},{"key":"4_CR13","volume-title":"Artificial Intelligence: A Modern Approach","author":"SJ Russell","year":"1996","unstructured":"Russell, S.J., Norvig, P., Candy, J.F., Malik, J.M., Edwards, D.D.: Artificial Intelligence: A Modern Approach. Prentice-Hall Inc, Upper Saddle River (1996)"},{"issue":"1\u20133","key":"4_CR14","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. J. Comput. Vis. 47(1\u20133), 7\u201342 (2002)","journal-title":"Int. J. Comput. Vis."},{"key":"4_CR15","unstructured":"Schraudolph, N.N., Kamenetsky, D.: Efficient exact inference in planar ising models. In: NIPS, pp. 1417\u20131424 (2008)"},{"issue":"6","key":"4_CR16","doi-asserted-by":"publisher","first-page":"1068","DOI":"10.1109\/TPAMI.2007.70844","volume":"30","author":"R Szeliski","year":"2008","unstructured":"Szeliski, R., Zabih, R., Scharstein, D., Veksler, O., Kolmogorov, V., Agarwala, A., Tappen, M., Rother, C.: A comparative study of energy minimization methods for markov random fields with smoothness-based priors. IEEE Trans. Pattern Anal. Mach. Intell. 30(6), 1068\u20131080 (2008)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"11","key":"4_CR17","doi-asserted-by":"publisher","first-page":"3697","DOI":"10.1109\/TIT.2005.856938","volume":"51","author":"MJ Wainwright","year":"2005","unstructured":"Wainwright, M.J., Jaakkola, T.S., Willsky, A.S.: Map estimation via agreement on trees: message-passing and linear programming. IEEE Trans. Inf. Theor. 51(11), 3697\u20133717 (2005)","journal-title":"IEEE Trans. Inf. Theor."},{"key":"4_CR18","unstructured":"Yedidia, J.S., Freeman, W.T., Weiss, Y.: Understanding belief propagation and its generalizations. In: Exploring Artificial Intelligence in the New Millennium, pp. 239\u2013269. Morgan Kaufmann Publishers Inc., San Francisco (2003). http:\/\/dl.acm.org\/citation.cfm?id=779343.779352"}],"container-title":["Lecture Notes in Computer Science","Pattern Recognition"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-11752-2_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,5]],"date-time":"2025-05-05T03:57:27Z","timestamp":1746417447000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-11752-2_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319117515","9783319117522"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-11752-2_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"15 October 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}