{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T15:29:19Z","timestamp":1743089359279,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"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_3","type":"book-chapter","created":{"date-parts":[[2006,7,23]],"date-time":"2006-07-23T11:16:35Z","timestamp":1153653395000},"page":"30-43","source":"Crossref","is-referenced-by-count":15,"title":["Measuring Uncertainty in Graph Cut Solutions \u2013 Efficiently Computing Min-marginal Energies Using Dynamic Graph Cuts"],"prefix":"10.1007","author":[{"given":"Pushmeet","family":"Kohli","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Philip H. S.","family":"Torr","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_CR1","unstructured":"Kolmogorov, V.: Convergent tree-reweighted message passing for energy minimization. In: AISTATS 2005, pp. 182\u2013189 (2005)"},{"key":"3_CR2","unstructured":"Wainwright, M.J., Willsky, T.S.J., Map, A.S.: estimation via agreement on (hyper)trees: Message-passing and linear-programming approaches. Technical Report UCB\/CSD-03-1269 (2003)"},{"key":"3_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/3-540-47977-5_5","volume-title":"Computer Vision - ECCV 2002","author":"V. Kolmogorov","year":"2002","unstructured":"Kolmogorov, V., Zabih, R.: What energy functions can be minimized via graph cuts? In: Heyden, A., Sparr, G., Nielsen, M., Johansen, P. (eds.) ECCV 2002. LNCS, vol.\u00a02352, pp. 65\u201381. Springer, Heidelberg (2002)"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Boykov, Y., Veksler, O., Zabih, R.: Markov random fields with efficient approximations. In: CVPR 1998, pp. 648\u2013655 (1998)","DOI":"10.1109\/CVPR.1998.698673"},{"key":"3_CR5","doi-asserted-by":"publisher","first-page":"1124","DOI":"10.1109\/TPAMI.2004.60","volume":"26","author":"Y. Boykov","year":"2004","unstructured":"Boykov, Y., Kolmogorov, V.: An experimental comparison of min-cut\/max-flow algorithms for energy minimization in vision. PAMI\u00a026, 1124\u20131137 (2004)","journal-title":"PAMI"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"Kohli, P., Torr, P.: Eficiently solving dynamic markov random fields using graph cuts. In: ICCV (2005)","DOI":"10.1109\/ICCV.2005.81"},{"key":"3_CR7","unstructured":"Chiang, Y.J., Tamassia, R.: Dynamic algorithms in computational geometry. Technical Report CS-91-24 (1991)"},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"Boykov, Y., Jolly, M.: Interactive graph cuts for optimal boundary and region segmentation of objects in n-d images. In: ICCV 2001, pp. I:105\u2013112 (2001)","DOI":"10.1109\/ICCV.2001.937505"},{"key":"3_CR9","doi-asserted-by":"crossref","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 (2001)","DOI":"10.1109\/18.910585"},{"key":"3_CR10","volume-title":"Advances in Neural Information Processing Systems 16","author":"C. Yanover","year":"2004","unstructured":"Yanover, C., Weiss, Y.: Finding the m most probable configurations in arbitrary graphical models. In: Advances in Neural Information Processing Systems 16, MIT Press, Cambridge (2004)"},{"key":"3_CR11","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/BF01890546","volume":"2","author":"P. Dawid","year":"1992","unstructured":"Dawid, P.: Applications of a general propagation algorithm for probabilistic expert systems. Statistics and Computing\u00a02, 25\u201336 (1992)","journal-title":"Statistics and Computing"},{"key":"3_CR12","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1023\/A:1008990218483","volume":"8","author":"D. Nilsson","year":"1998","unstructured":"Nilsson, D.: An efficient algorithm for finding the m most probable configurations in bayesian networks. Statistics and Computing\u00a08, 159\u2013173 (1998)","journal-title":"Statistics and Computing"},{"key":"3_CR13","volume-title":"Flows in Networks","author":"L. Ford","year":"1962","unstructured":"Ford, L., Fulkerson, D.: Flows in Networks. Princeton University Press, Princeton (1962)"},{"key":"3_CR14","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. PAMI\u00a025, 1333\u20131336 (2003)","journal-title":"PAMI"},{"key":"3_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"642","DOI":"10.1007\/11744047_49","volume-title":"Computer Vision \u2013 ECCV 2006","author":"M. Bray","year":"2006","unstructured":"Bray, M., Kohli, P., Torr, P.: poseCut: Simultaneous segmentation and 3D pose estimation of humans using dynamic graph-cuts. In: Leonardis, A., Bischof, H., Pinz, A. (eds.) ECCV 2006. LNCS, vol.\u00a03952, pp. 642\u2013655. Springer, Heidelberg (2006)"}],"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_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,10]],"date-time":"2025-01-10T01:28:15Z","timestamp":1736472495000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11744047_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540338345","9783540338352"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/11744047_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}