{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T06:52:12Z","timestamp":1759042332703,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":33,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642230936"},{"type":"electronic","value":"9783642230943"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-23094-3_4","type":"book-chapter","created":{"date-parts":[[2011,7,23]],"date-time":"2011-07-23T15:06:23Z","timestamp":1311433583000},"page":"45-58","source":"Crossref","is-referenced-by-count":5,"title":["A Fast Solver for Truncated-Convex Priors: Quantized-Convex Split Moves"],"prefix":"10.1007","author":[{"given":"Anna","family":"Jezierska","sequence":"first","affiliation":[]},{"given":"Hugues","family":"Talbot","sequence":"additional","affiliation":[]},{"given":"Olga","family":"Veksler","sequence":"additional","affiliation":[]},{"given":"Daniel","family":"Wesierski","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","unstructured":"Veksler, O.: Efficient graph-based energy minimization methods in computer vision. PhD thesis, Cornell University, Ithaca, NY, USA (1999)"},{"key":"4_CR2","unstructured":"Huang, J., Mumford, D.: Statistics of natural images and models. In: IEEE Computer Society Conference on Computer Vision, Computer Vision and Pattern Recognition, Fort Collins, CO, USA (1999)"},{"key":"4_CR3","doi-asserted-by":"publisher","first-page":"965","DOI":"10.1137\/S0036142901389165","volume":"40","author":"M. Nikolova","year":"2002","unstructured":"Nikolova, M.: Minimizers of cost-functions involving non-smooth data-fidelity terms. Application to the processing of outliers. SIAM J. on Numerical Analysis\u00a040, 965\u2013994 (2002)","journal-title":"SIAM J. on Numerical Analysis"},{"key":"4_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":"4_CR5","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 Transaction on Pattern Analysis and Machine Intelligence\u00a025, 1333\u20131336 (2003)","journal-title":"IEEE Transaction on Pattern Analysis and Machine Intelligence"},{"key":"4_CR6","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 Transaction on Pattern Analysis and Machine Intelligence\u00a023, 1222\u20131239 (2001)","journal-title":"IEEE Transaction on Pattern Analysis and Machine Intelligence"},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"Woodford, O.J., Torr, P.H.S., Reid, I.D., Fitzgibbon, A.W.: Global stereo reconstruction under second order smoothness priors. In: IEEE Conference on Computer Vision and Pattern Recognition (2008)","DOI":"10.1109\/CVPR.2008.4587672"},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"Sinha, S.N., Mordohai, P., Pollefeys, M.: Multi-view stereo via graph cuts on the dual of an adaptive tetrahedral mesh. In: IEEE 11th International Conference on Computer Vision, ICCV 2007, Rio de Janeiro, pp. 1\u20138 (2007)","DOI":"10.1109\/ICCV.2007.4408997"},{"key":"4_CR9","doi-asserted-by":"publisher","first-page":"1644","DOI":"10.1109\/TPAMI.2005.202","volume":"27","author":"J. Xiao","year":"2007","unstructured":"Xiao, J., Shah, M.: Motion layer extraction in the presence of occlusion using graph cuts. IEEE Transactions on Pattern Analysis and Machine Intelligence\u00a027, 1644\u20131659 (2007)","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"Boykov, Y., Jolly, M.P.: Interactive graph cuts for optimal boundary & region segmentation of objects in n-d images. In: Proceedings of the Eighth IEEE International Conference on Computer Vision, ICCV 2001, Vancouver, BC, Canada, pp. 105\u2013112 (2001)","DOI":"10.1109\/ICCV.2001.937505"},{"key":"4_CR11","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/s10851-006-0644-3","volume":"26","author":"J. Darbon","year":"2006","unstructured":"Darbon, J., Sigelle, M.: Image restoration with discrete constrained total variation part ii: Levelable functions, convex priors and non-convex cases. JMIV\u00a026, 277\u2013291 (2006)","journal-title":"JMIV"},{"key":"4_CR12","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. TPAMI\u00a06, 721\u2013741 (1984)","journal-title":"TPAMI"},{"key":"4_CR13","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1111\/j.2517-6161.1986.tb01412.x","volume":"48","author":"J. Besag","year":"1986","unstructured":"Besag, J.: On the statistical analysis of dirty pictures. Journal of the Royal Statistical Society. Series B (Methodological)\u00a048, 259\u2013302 (1986)","journal-title":"Journal of the Royal Statistical Society. Series B (Methodological)"},{"key":"4_CR14","unstructured":"Murota, K.: Algorithms in discrete convex analysis (2000)"},{"key":"4_CR15","doi-asserted-by":"publisher","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? IEEE Transaction on Pattern Analysis and Machine Intelligence\u00a026, 147\u2013159 (2004)","journal-title":"IEEE Transaction on Pattern Analysis and Machine Intelligence"},{"key":"4_CR16","unstructured":"Schlesinger, D., Flach, B.: Transforming an arbitrary minsum problem into a binary one. Technical report, Dresden University of Technology (2008)"},{"key":"4_CR17","doi-asserted-by":"crossref","unstructured":"Veksler, O.: Graph cut based optimization for MRFs with truncated convex priors. In: IEEE Conference on Computer Vision and Pattern Recognition, Minneapolis, MN, pp. 1\u20138 (2007)","DOI":"10.1109\/CVPR.2007.383249"},{"key":"4_CR18","unstructured":"Kumar, M.P., Torr, P.H.S.: Improved moves for truncated convex models. In: Proceedings of Advances in Neural Information Processing Systems (2008)"},{"key":"4_CR19","doi-asserted-by":"publisher","first-page":"1392","DOI":"10.1109\/TPAMI.2009.143","volume":"32","author":"V. Lempitsky","year":"2010","unstructured":"Lempitsky, V., Rother, C., Roth, S., Blake, A.: Fusion moves for markov random field optimization. IEEE Transactions on Pattern Analysis and Machine Intelligence\u00a032, 1392\u20131405 (2010)","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"4_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-03641-5_1","volume-title":"Energy Minimization Methods in Computer Vision and Pattern Recognition","author":"O. Veksler","year":"2009","unstructured":"Veksler, O.: Multi-label moves for mRFs with truncated convex priors. In: Cremers, D., Boykov, Y., Blake, A., Schmidt, F.R. (eds.) EMMCVPR 2009. LNCS, vol.\u00a05681, pp. 1\u20138. Springer, Heidelberg (2009)"},{"key":"4_CR21","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 Transactions on Pattern Analysis and Machine Intelligence\u00a030, 1068\u20131080 (2008)","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"4_CR22","unstructured":"Kumar, M.P., Koller, D.: MAP estimation of semi-metric MRFs via hierarchical graph cuts. In: Proceedings of the Twenty-Fifth Conference on Uncertainty in Artificial Intelligence, UAI 2009, pp. 313\u2013320. AUAI Press, Arlington (2009)"},{"key":"4_CR23","doi-asserted-by":"publisher","first-page":"699","DOI":"10.1137\/S1052623402419005","volume":"14","author":"K. Murota","year":"2004","unstructured":"Murota, K.: On steepest descent algorithms for discrete convex functions. SIAM Journal on Optimization\u00a014, 699\u2013707 (2004)","journal-title":"SIAM Journal on Optimization"},{"key":"4_CR24","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 Transactions on Pattern Analysis and Machine Intelligence\u00a028, 1568\u20131583 (2006)","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"4_CR25","doi-asserted-by":"publisher","first-page":"3697","DOI":"10.1109\/TIT.2005.856938","volume":"51","author":"M.J. 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 Transactions on Information Theory\u00a051, 3697\u20133717 (2005)","journal-title":"IEEE Transactions on Information Theory"},{"key":"4_CR26","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":"4_CR27","doi-asserted-by":"crossref","unstructured":"Felzenszwalb, P.F., Huttenlocher, D.R.: Efficient belief propagation for early vision. In: Proceedings of the 2004 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, CVPR 2004, pp. 261\u2013268 (2004)","DOI":"10.1109\/CVPR.2004.1315041"},{"key":"4_CR28","doi-asserted-by":"crossref","unstructured":"Gupta, A., Tardos, E.: A constant factor approximation algorithm for a class of classification problems. In: Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science, pp. 333\u2013342 (2000)","DOI":"10.1145\/335305.335397"},{"key":"4_CR29","volume-title":"Flows in Networks","author":"J.L.R. Ford","year":"1962","unstructured":"Ford, J.L.R., Fulkerson, D.R.: Flows in Networks. Princeton University Press, Princeton (1962)"},{"key":"4_CR30","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1016\/j.disopt.2009.04.006","volume":"6","author":"V. Kolmogorov","year":"2009","unstructured":"Kolmogorov, V., Shioura, A.: New algorithms for convex cost tension problem with application to computer vision. Discrete Optimization\u00a06, 378\u2013393 (2009)","journal-title":"Discrete Optimization"},{"key":"4_CR31","doi-asserted-by":"crossref","unstructured":"Rother, C., Kumar, S., Kolmogorov, V., Blake, A.: Digital tapestry [automatic image synthesis]. In: IEEE Computer Society Conference on Computer Vision and Pattern Recognition, CVPR 2005, pp. 589\u2013596 (2005)","DOI":"10.1109\/CVPR.2005.130"},{"key":"4_CR32","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. IEEE Transaction on Pattern Analysis and Machine Intelligence\u00a026, 1124\u20131137 (2004)","journal-title":"IEEE Transaction on Pattern Analysis and Machine Intelligence"},{"key":"4_CR33","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: Proceedings of Ninth IEEE International Conference on Computer Vision, Nice, France, pp. 900\u2013906 (2008)","DOI":"10.1109\/ICCV.2003.1238444"}],"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-23094-3_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,7]],"date-time":"2025-03-07T08:37:01Z","timestamp":1741336621000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23094-3_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642230936","9783642230943"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23094-3_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}