{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,11]],"date-time":"2025-02-11T20:10:25Z","timestamp":1739304625584,"version":"3.37.0"},"publisher-location":"Berlin, Heidelberg","reference-count":33,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642036408"},{"type":"electronic","value":"9783642036415"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-03641-5_1","type":"book-chapter","created":{"date-parts":[[2009,8,17]],"date-time":"2009-08-17T11:06:23Z","timestamp":1250507183000},"page":"1-13","source":"Crossref","is-referenced-by-count":6,"title":["Multi-label Moves for MRFs with Truncated Convex Priors"],"prefix":"10.1007","author":[{"given":"Olga","family":"Veksler","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"1_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1007\/BFb0055670","volume-title":"Computer Vision - ECCV\u201998","author":"H. Ishikawa","year":"1998","unstructured":"Ishikawa, H., Geiger, D.: Occlusions, discontinuities, and epipolar lines in stereo. In: Burkhardt, H.-J., Neumann, B. (eds.) ECCV 1998. LNCS, vol.\u00a01406, p. 232. Springer, Heidelberg (1998)"},{"issue":"11","key":"1_CR2","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. PAMI\u00a023(11), 1222\u20131239 (2001)","journal-title":"PAMI"},{"key":"1_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":"1_CR4","doi-asserted-by":"crossref","unstructured":"Boykov, Y., Veksler, O., Zabih, R.: Markov random fields with efficient approximations. In: CVPR, pp. 648\u2013655 (1998)","DOI":"10.1109\/CVPR.1998.698673"},{"key":"1_CR5","doi-asserted-by":"crossref","unstructured":"Kolmogorov, V., Zabih, R.: Computing visual correspondence with occlusions via graph cuts. In: ICCV, vol. II, pp. 508\u2013515 (2001)","DOI":"10.1109\/ICCV.2001.937668"},{"key":"1_CR6","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":"1_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1007\/11744078_18","volume-title":"Computer Vision \u2013 ECCV 2006","author":"V. Lempitsky","year":"2006","unstructured":"Lempitsky, V., Boykov, Y., Ivanov, D.: Oriented visibility for multiview reconstruction. In: Leonardis, A., Bischof, H., Pinz, A. (eds.) ECCV 2006. LNCS, vol.\u00a03953, pp. 226\u2013238. Springer, Heidelberg (2006)"},{"key":"1_CR8","unstructured":"Wills, J., Agarwal, S., Belongie, S.: What went where. In: CVPR, vol.\u00a0I, pp. 37\u201344 (2003)"},{"issue":"10","key":"1_CR9","doi-asserted-by":"publisher","first-page":"1644","DOI":"10.1109\/TPAMI.2005.202","volume":"27","author":"J. Xiao","year":"2005","unstructured":"Xiao, J., Shah, M.: Motion layer extraction in the presence of occlusion using graph cuts. PAMI\u00a027(10), 1644\u20131659 (2005)","journal-title":"PAMI"},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"Schoenemann, T., Cremers, D.: High resolution motion layer decomposition using dual-space graph cuts. In: CVPR, pp. 1\u20137 (2008)","DOI":"10.1109\/CVPR.2008.4587445"},{"issue":"3","key":"1_CR11","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1145\/882262.882264","volume":"22","author":"V. Kwatra","year":"2003","unstructured":"Kwatra, V., Sch\u00f6dl, A., Essa, I., Turk, G., Bobick, A.: Graphcut textures: Image and video synthesis using graph cuts. ACM Transactions on Graphics, SIGGRAPH 2003\u00a022(3), 277\u2013286 (2003)","journal-title":"ACM Transactions on Graphics, SIGGRAPH 2003"},{"key":"1_CR12","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, vol. I, pp. 105\u2013112 (2001)","DOI":"10.1109\/ICCV.2001.937505"},{"key":"1_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1007\/978-3-540-24670-1_33","volume-title":"Computer Vision - ECCV 2004","author":"A. Blake","year":"2004","unstructured":"Blake, A., Rother, C., Brown, M., Perez, P., Torr, P.: Interactive image segmentation using an adaptive GMMRF model. In: Pajdla, T., Matas, J(G.) (eds.) ECCV 2004. LNCS, vol.\u00a03021, pp. 428\u2013441. Springer, Heidelberg (2004)"},{"key":"1_CR14","doi-asserted-by":"crossref","unstructured":"Rother, C., Minka, T., Blake, A., Kolmogorov, V.: Cosegmentation of image pairs by histogram matching: Incorporating a global constraint into mrfs. In: CVPR, vol. I, pp. 993\u20131000 (2006)","DOI":"10.1109\/CVPR.2006.91"},{"issue":"9","key":"1_CR15","doi-asserted-by":"publisher","first-page":"1480","DOI":"10.1109\/TPAMI.2006.193","volume":"28","author":"V. Kolmogorov","year":"2006","unstructured":"Kolmogorov, V., Criminisi, A., Blake, A., Cross, G., Rother, C.: Probabilistic fusion of stereo with color and contrast for bilayer segmentation. PAMI\u00a028(9), 1480\u20131492 (2006)","journal-title":"PAMI"},{"key":"1_CR16","doi-asserted-by":"crossref","unstructured":"Agarwala, A., Dontcheva, M., Agrawala, M., Drucker, S., Colburn, A., Curless, B., Salesin, D., Cohen, M.: Iteractive digital photomontage. In: ACM Transactions on Graphics, SIGGRAPH (2004)","DOI":"10.1145\/1186562.1015718"},{"issue":"10","key":"1_CR17","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(10), 1333\u20131336 (2003)","journal-title":"PAMI"},{"issue":"6","key":"1_CR18","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 Transacions on Pattern Analysis and Machine Intellegence\u00a030(6), 1068\u20131080 (2008)","journal-title":"IEEE Transacions on Pattern Analysis and Machine Intellegence"},{"issue":"10","key":"1_CR19","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. PAMI\u00a028(10), 1568\u20131583 (2006)","journal-title":"PAMI"},{"key":"1_CR20","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_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11744047_1","volume-title":"Computer Vision \u2013 ECCV 2006","author":"V. Kolmogorov","year":"2006","unstructured":"Kolmogorov, V., Rother, C.: Comparison of energy minimization algorithms for highly connected graphs. In: Leonardis, A., Bischof, H., Pinz, A. (eds.) ECCV 2006. LNCS, vol.\u00a03952, pp. 1\u201315. Springer, Heidelberg (2006)"},{"key":"1_CR22","doi-asserted-by":"crossref","unstructured":"Veksler, O.: Graph cut based optimization for mrfs with truncated convex priors. In: CVPR, pp. 1\u20138 (2007)","DOI":"10.1109\/CVPR.2007.383249"},{"key":"1_CR23","doi-asserted-by":"crossref","unstructured":"Liu, X., Veksler, O., Samarabandu, J.: Graph cut with ordering constraints on labels and its applications. In: CVPR, pp. 1\u20138 (2008)","DOI":"10.1109\/CVPR.2008.4587470"},{"key":"1_CR24","unstructured":"Kumar, M.P., Torr, P.H.S.: Improved moves for truncated convex models. In: Koller, D., Schuurmans, D., Bengio, Y., Bottou, L. (eds.) Advances in Neural Information Processing Systems 21, pp. 889\u2013896 (2009)"},{"key":"1_CR25","unstructured":"Torr, P.H.S.: In: Personal communication (2008)"},{"key":"1_CR26","doi-asserted-by":"crossref","unstructured":"Hunter, D.R., Lange, K.: A tutorial on MM algorithms. The American Statistician\u00a0(58) (2004)","DOI":"10.1198\/0003130042836"},{"key":"1_CR27","unstructured":"Schlesinger, D., Flach, B.: Transforming an arbitrary minsum problem into a binary one. Technical Report TUD-FI06-01, Dresden University of Technology (2006)"},{"key":"1_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/978-3-540-78275-9_20","volume-title":"Combinatorial Image Analysis","author":"J. Darbon","year":"2008","unstructured":"Darbon, J.: Global optimization for first order markov random fields with submodular priors. In: Brimkov, V.E., Barneva, R.P., Hauptman, H.A. (eds.) IWCIA 2008. LNCS, vol.\u00a04958, pp. 229\u2013237. Springer, Heidelberg (2008)"},{"key":"1_CR29","unstructured":"Kolmogorov, V.: Primal-dual algorithm for convex markov random fields. Technical Report MSR-TR-2005-117, Microsoft (2005)"},{"key":"1_CR30","doi-asserted-by":"crossref","unstructured":"Rother, C., Kumar, S., Kolmogorov, V., Blake, A.: Digital tapestry. In: CVPR, vol. I, pp. 589\u2013596 (2005)","DOI":"10.1109\/CVPR.2005.130"},{"issue":"1-3","key":"1_CR31","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(1-3), 7\u201342 (2002)","journal-title":"IJCV"},{"key":"1_CR32","doi-asserted-by":"crossref","unstructured":"Scharstein, D., Szeliski, R.: High-accuracy stereo depth maps using structured light. In: CVPR, vol. I, pp. 195\u2013202 (2003)","DOI":"10.1109\/CVPR.2003.1211354"},{"key":"1_CR33","doi-asserted-by":"crossref","unstructured":"Alahari, K., Kohli, P., Torr, P.: Reduce, reuse, recycle: Efficiently solving multi-label mrfs. In: CVPR, pp. 1\u20138 (2008)","DOI":"10.1109\/CVPR.2008.4587402"}],"container-title":["Lecture Notes in Computer Science","Energy Minimization Methods in Computer Vision and Pattern Recognition"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03641-5_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,11]],"date-time":"2025-02-11T19:30:29Z","timestamp":1739302229000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03641-5_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642036408","9783642036415"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03641-5_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}