{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,2]],"date-time":"2025-10-02T05:48:15Z","timestamp":1759384095904,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540338345"},{"type":"electronic","value":"9783540338352"}],"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\/11744047_1","type":"book-chapter","created":{"date-parts":[[2006,7,23]],"date-time":"2006-07-23T11:16:35Z","timestamp":1153653395000},"page":"1-15","source":"Crossref","is-referenced-by-count":27,"title":["Comparison of Energy Minimization Algorithms for Highly Connected Graphs"],"prefix":"10.1007","author":[{"given":"Vladimir","family":"Kolmogorov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carsten","family":"Rother","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"1_CR1","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.: Stochastic relaxation, Gibbs distributions, and the Bayesian restoration of images. IEEE Trans. Pattern Anal. Machine Intell.\u00a06, 721\u2013741 (1984)","journal-title":"IEEE Trans. Pattern Anal. Machine Intell."},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"Boykov, Y., Veksler, O., Zabih, R.: Fast approximate energy minimization via graph cuts. IEEE Transactions on Pattern Analysis and Machine Intelligence 23(11) (2001)","DOI":"10.1109\/34.969114"},{"key":"1_CR3","unstructured":"Kolmogorov, V., Zabih, R.: Computing visual correspondence with occlusions using graph cuts. In: IEEE International Conference on Computer Vision (2001)"},{"key":"1_CR4","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)"},{"issue":"7","key":"1_CR5","doi-asserted-by":"publisher","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. IEEE Transactions on Pattern Analysis and Machine Intelligence\u00a025(7), 787\u2013800 (2003)","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"issue":"8","key":"1_CR6","doi-asserted-by":"publisher","first-page":"710","DOI":"10.1109\/TPAMI.2004.54","volume":"26","author":"M. Lin","year":"2004","unstructured":"Lin, M., Tomasi, C.: Surfaces with occlusions from layered stereo. IEEE Transactions on Pattern Analysis and Machine Intelligence\u00a026(8), 710\u2013717 (2004)","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"1_CR7","unstructured":"Sun, J., Li, Y., Kang, S.B., Shum, H.: Symmetric stereo matching for occlusion handling. In: IEEE Conf. on Comp. Vis. and Pat. Recog. (2005)"},{"key":"1_CR8","unstructured":"Boykov, Y., Jolly, M.P.: Interactive graph cuts for optimal boundary and region segmentation of objects in N-D images. In: Proc. Int. Conf. Comp. Vision (2001)"},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"Kwatra, V., Sch\u00f6dl, A., Essa, I., Turk, G., Bobick, A.: Graphcut textures: Image and video synthesis using graph cuts. In: ACM Transactions on Graphics, SIGGRAPH (2003)","DOI":"10.1145\/1201775.882264"},{"key":"1_CR10","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. Computer Vision\u00a047, 7\u201342 (2002)","journal-title":"Int. J. Computer Vision"},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"Tappen, M.F., Freeman, W.T.: Comparison of graph cuts with belief propagation for stereo, using identical MRF parameters. In: Proc. Int. Conf. Comp. Vision (2003)","DOI":"10.1109\/ICCV.2003.1238444"},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"Kolmogorov, V.: Convergent tree-reweighted message passing for energy minimization. In: Artificial Intelligence and Statistics (2005)","DOI":"10.1109\/TPAMI.2006.200"},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"Meltzer, T., Yanover, C., Weiss, Y.: Globally optimal solutions for energy minimization in stereo vision using reweighted belief propagation. In: Proc. Int. Conf. Comp. Vision (2005)","DOI":"10.1109\/ICCV.2005.110"},{"key":"1_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/11744047_2","volume-title":"Computer Vision \u2013 ECCV 2006","author":"R. Szeliski","year":"2006","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. In: Leonardis, A., Bischof, H., Pinz, A. (eds.) ECCV 2006. LNCS, vol.\u00a03952, pp. 16\u201329. Springer, Heidelberg (2006)"},{"key":"1_CR15","unstructured":"Rother, C., Kumar, S., Kolmogorov, V., Blake, A.: Digital tapestry. In: IEEE Conf. on Comp. Vis. and Pat. Recog (2005)"},{"key":"1_CR16","unstructured":"Felzenszwalb, P., Huttenlocher, D.: Efficient belief propagation for early vision. In: IEEE Conf. on Comp. Vis. and Pat. Recog (2004)"},{"key":"1_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, Series B\u00a051, 271\u2013279 (1989)","journal-title":"Journal of the Royal Statistical Society, Series B"},{"issue":"10","key":"1_CR18","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. Machine Intell.\u00a025(10), 1333\u20131336 (2003)","journal-title":"IEEE Trans. Pattern Anal. Machine Intell."},{"key":"1_CR19","unstructured":"Veksler, O.: Efficient graph-based energy minimization methods in computer vision. PhD thesis, Cornell University, Dept. of Computer Science, Ithaca, NY (1999)"},{"key":"1_CR20","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1023\/A:1026501619075","volume":"40","author":"W.T. Freeman","year":"2000","unstructured":"Freeman, W.T., Pasztor, E.C., Carmichael, O.T.: Learning low-level vision. Int. J. Computer Vision\u00a040, 25\u201347 (2000)","journal-title":"Int. J. Computer Vision"},{"key":"1_CR21","unstructured":"Kumar, S., Herbert, M.: Discriminative fields for modeling spatial dependencies in natural images. In: Advances in Neural Information Processing Systems (2004)"},{"key":"1_CR22","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":"1_CR23","doi-asserted-by":"crossref","unstructured":"Barbu, A., Yuille, A.L.: Motion estimation by Swendsen-Wang cuts. In: CVPR (2004)","DOI":"10.1109\/ICCV.2003.1238362"},{"issue":"11","key":"1_CR24","doi-asserted-by":"publisher","first-page":"3697","DOI":"10.1109\/TIT.2005.856938","volume":"51","author":"M. Wainwright","year":"2005","unstructured":"Wainwright, M., Jaakkola, T., Willsky, A.: MAP estimation via agreement on (hyper)trees: Message-passing and linear-programming approaches. IEEE Transactions on Information Theory\u00a051(11), 3697\u20133717 (2005)","journal-title":"IEEE Transactions on Information Theory"},{"key":"1_CR25","unstructured":"Scharstein, D., Szelsiki, R.: High-accuracy stereo depth maps using structured light. In: IEEE Conf. on Comp. Vis. and Pat. Recog (2003)"},{"key":"1_CR26","doi-asserted-by":"crossref","unstructured":"Kolmogorov, V., Rother, C.: Comparison of energy minimization algorithms for highly connected graphs. Technical Report MSR-TR-2006-19 (2006)","DOI":"10.1007\/11744047_1"}],"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\/11744047_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,10]],"date-time":"2025-01-10T01:28:25Z","timestamp":1736472505000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11744047_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540338345","9783540338352"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/11744047_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}