{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T16:35:47Z","timestamp":1772296547750,"version":"3.50.1"},"reference-count":48,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2013,4,19]],"date-time":"2013-04-19T00:00:00Z","timestamp":1366329600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int J Comput Vis"],"published-print":{"date-parts":[[2013,9]]},"DOI":"10.1007\/s11263-013-0619-y","type":"journal-article","created":{"date-parts":[[2013,4,18]],"date-time":"2013-04-18T16:00:53Z","timestamp":1366300853000},"page":"223-240","source":"Crossref","is-referenced-by-count":43,"title":["A Survey and Comparison of Discrete and Continuous Multi-label Optimization Approaches for the Potts Model"],"prefix":"10.1007","volume":"104","author":[{"given":"Claudia","family":"Nieuwenhuis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eno","family":"T\u00f6ppe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Cremers","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,4,19]]},"reference":[{"issue":"10","key":"619_CR1","doi-asserted-by":"crossref","first-page":"1846","DOI":"10.1109\/TPAMI.2009.194","volume":"32","author":"K Alahari","year":"2010","unstructured":"Alahari, K., Kohli, P., & Torr, P. H. S. (2010). Dynamic hybrid algorithms for MAP inference in discrete MRFs. IEEE Transactions on Pattern Analysis and Machine Intelligence, 32(10), 1846\u20131857.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"619_CR2","doi-asserted-by":"crossref","unstructured":"Batra, D. (2011). Making the right moves: Guiding alpha-expansion using local primal-dual gaps. In P. Kohli (Ed.), International Conference on Computer Vision and Pattern Recognition, Colorado Springs.","DOI":"10.1109\/CVPR.2011.5995449"},{"issue":"3","key":"619_CR3","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. (1986). On the statistical analysis of dirty pictures. Journal of Royal Statistical Society Series B, 48(3), 259\u2013302.","journal-title":"Journal of Royal Statistical Society Series B"},{"issue":"9","key":"619_CR4","doi-asserted-by":"crossref","first-page":"1124","DOI":"10.1109\/TPAMI.2004.60","volume":"26","author":"Y Boykov","year":"2004","unstructured":"Boykov, Y., & Kolmogorov, V. (2004). An experimental comparison of min-cut\/max-flow algorithms for energy minimization in vision. IEEE Transactions on Pattern Analysis and Machine Intelligence, 26(9), 1124\u20131137.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"issue":"11","key":"619_CR5","doi-asserted-by":"crossref","first-page":"1222","DOI":"10.1109\/34.969114","volume":"23","author":"Y Boykov","year":"2001","unstructured":"Boykov, Y., Veksler, O., & Zabih, R. (2001). Fast approximate energy minimization via graph cuts. IEEE Transactions on Pattern Analysis and Machine Intelligence, 23(11), 1222\u20131239.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"619_CR6","unstructured":"Chambolle, A., Cremers, D., Pock, T. (2008). A convex approach for computing minimal partitions. Technical Report TR-2008-05. Bonn: University of Bonn."},{"key":"619_CR7","doi-asserted-by":"crossref","unstructured":"Chan, T., & Esedoglu, S., & Nikolova, M., (2006). Algorithms for finding global minimizers of image segmentation and denoising models. SIAM Journal on Applied Mathematics, 66(5), 1632\u20131648.","DOI":"10.1137\/040615286"},{"issue":"2","key":"619_CR8","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1109\/83.902291","volume":"10","author":"T Chan","year":"2001","unstructured":"Chan, T., & Vese, L. (2001). Active contours without edges. IEEE Transactions on Image Processing, 10(2), 266\u2013277.","journal-title":"IEEE Transactions on Image Processing"},{"issue":"2","key":"619_CR9","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/s11263-006-8711-1","volume":"72","author":"D Cremers","year":"2007","unstructured":"Cremers, D., Rousson, M., & Deriche, R. (2007). A review of statistical approaches to level set segmentation: Integrating color, texture, motion and shape. International Journal of Computer Vision, 72(2), 195\u2013215.","journal-title":"International Journal of Computer Vision"},{"key":"619_CR10","unstructured":"Cremers, D., Sochen, N., & Schn\u00f6rr, C. (2004). Multiphase dynamic labeling for variational recognition-driven image segmentation. In T. Pajdla & V. Hlavac (Eds.), European Conference on Computer Vision volume of 3024 LNCS (pp. 74\u201386). New York: Springer."},{"key":"619_CR11","doi-asserted-by":"crossref","unstructured":"Cremers, D., Sochen, N., & Schn\u00f6rr, C. (2006). A multiphase dynamic labeling model for variational recognition-driven image segmentation. International Journal of Computer Vision, 66(1), 67\u201381.","DOI":"10.1007\/s11263-005-3676-z"},{"key":"619_CR12","doi-asserted-by":"crossref","unstructured":"Felzenszwalb, P., & Veksler, O. (2010). Tiered scene labeling with dynamic programming. In International Conference on Computer Vision and Pattern Recognition, San Francisco.","DOI":"10.1109\/CVPR.2010.5540067"},{"issue":"6","key":"619_CR13","doi-asserted-by":"crossref","first-page":"721","DOI":"10.1109\/TPAMI.1984.4767596","volume":"6","author":"S Geman","year":"1984","unstructured":"Geman, S., & Geman, D. (1984). Stochastic relaxation, Gibbs distributions, and the Bayesian restoration of images. IEEE Transactions on Pattern Analysis and Machine Intelligence, 6(6), 721\u2013741.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"619_CR14","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0304-3975(82)90092-5","volume":"21","author":"L Goldschlager","year":"1982","unstructured":"Goldschlager, L., Shaw, R., & Staples, J. (1982). The maximum flow problem is log space complete for P. Theoretical Computer Science, 21, 105\u2013111.","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"619_CR15","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1111\/j.2517-6161.1989.tb01764.x","volume":"51","author":"DM Greig","year":"1989","unstructured":"Greig, D. M., Porteous, B. T., & Seheult, A. H. (1989). Exact maximum a posteriori estimation for binary images. Journal of Royal Statistical Society Series B, 51(2), 271\u2013279.","journal-title":"Journal of Royal Statistical Society Series B"},{"issue":"10","key":"619_CR16","doi-asserted-by":"crossref","first-page":"1333","DOI":"10.1109\/TPAMI.2003.1233908","volume":"25","author":"H Ishikawa","year":"2003","unstructured":"Ishikawa, H. (2003). Exact optimization for Markov random fields with convex priors. IEEE Transactions on Pattern Analysis and Machine Intelligence, 25(10), 1333\u20131336.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"619_CR17","doi-asserted-by":"crossref","unstructured":"Kleinberg, J., & Tardos, E. (2002). Approximation algorithms for classification problems with pairwise relationships: Metric labeling and Markov random fields. Journal of the ACM, 49(5), 672\u2013713 .","DOI":"10.1145\/585265.585268"},{"key":"619_CR18","doi-asserted-by":"crossref","unstructured":"Klodt, M., Schoenemann, T., Kolev, K., Schikora, M., & Cremers, D. (2008). An experimental comparison of discrete and continuous shape optimization methods. In European Conference on Computer Vision, Marseille, France.","DOI":"10.1007\/978-3-540-88682-2_26"},{"key":"619_CR19","doi-asserted-by":"crossref","unstructured":"Kolev, K., Pock, T., & Cremers, D. (2010). Anisotropic minimal surfaces integrating photoconsistency and normal information for multiview stereo. In European Conference on Computer Vision, Crete.","DOI":"10.1007\/978-3-642-15558-1_39"},{"key":"619_CR20","doi-asserted-by":"crossref","first-page":"1568","DOI":"10.1109\/TPAMI.2006.200","volume":"28","author":"V Kolmogorov","year":"2006","unstructured":"Kolmogorov, V. (2006). Convergent tree-reweighted message passing for energy minimization. IEEE Transactions on Pattern Analysis and Machine Intelligence, 28, 1568\u20131583.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"619_CR21","doi-asserted-by":"crossref","unstructured":"Komodakis, N., & Tziritas, G. (2005). A new framework for approximate labeling via graph cuts. In IEEE International Conference on Computer Vision, New Orleans.","DOI":"10.1109\/ICCV.2005.14"},{"key":"619_CR22","doi-asserted-by":"crossref","unstructured":"Komodakis, N., Tziritas, G., & Paragios, N. (2007). Fast, approximately optimal solutions for single and dynamic MRFs. In International Conference on Computer Vision and Pattern Recognition, Ezhou.","DOI":"10.1109\/CVPR.2007.383095"},{"key":"619_CR23","doi-asserted-by":"crossref","unstructured":"Lellmann, J., Becker, F., & Schn\u00f6rr, C. (2009). Convex optimization for multi-class image labeling with a novel family of total variation based regularizers. In IEEE International Conference on Computer Vision (pp. 646\u2013653).","DOI":"10.1109\/ICCV.2009.5459176"},{"key":"619_CR24","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1007\/978-3-642-02256-2_13","volume":"5567","author":"J Lellmann","year":"2009","unstructured":"Lellmann, J., Kappes, J. H., Yuan, J., Becker, F., & Schn\u00f6rr, C. (2009). Convex multi-class image labeling by simplex-constrained total variation. Scale Space and Variational Methods in Computer Vision (SSVM), 5567, 150\u2013162.","journal-title":"Scale Space and Variational Methods in Computer Vision (SSVM)"},{"key":"619_CR25","unstructured":"Lellmann, J., Lenzen, F., & Schn\u00f6rr, C. (2011). Optimality bounds for a variational relaxation of the image partitioning problem. In International Conference on Energy Minimization Methods for Computer Vision and Pattern Recognition. New York: Springer."},{"key":"619_CR26","doi-asserted-by":"crossref","unstructured":"Lempitsky, V., Rother, C., & Blake, A. (2007). Logcut: Efficient graph cut optimization for Markov random fields. In IEEE International Conference on Computer Vision.","DOI":"10.1109\/ICCV.2007.4408907"},{"key":"619_CR27","unstructured":"Liu, X., Veksler, O., & Samarabandu, J. (2010). Order preserving moves for graph cut based optimization. IEEE Transaction on Pattern Analysis and Machine Intellignece, 32(7), 1317\u20131324."},{"key":"619_CR28","doi-asserted-by":"crossref","unstructured":"Michelot, C. (1986). A finite algorithm for finding the projection of a point onto the canonical simplex of $$R^n$$ . Journal of Optimization Theory and Applications, 50(1), 189\u2013193.","DOI":"10.1007\/BF00938486"},{"key":"619_CR29","doi-asserted-by":"crossref","first-page":"577","DOI":"10.1002\/cpa.3160420503","volume":"42","author":"D Mumford","year":"1989","unstructured":"Mumford, D., & Shah, J. (1989). Optimal approximation by piecewise smooth functions and associated variational problems. Communications on Pure and Applied Mathematics, 42, 577\u2013685.","journal-title":"Communications on Pure and Applied Mathematics"},{"key":"619_CR30","unstructured":"Nieuwenhuis, C., & Cremers, D. (2012). Spatially varying color distributions for interactive multi-label segmentation. In IEEE Transactions on Pattern Analysis and Machine Intelligence, Philadelphia."},{"key":"619_CR31","doi-asserted-by":"crossref","unstructured":"Nieuwenhuis, C., & T\u00f6ppe, E., & Cremers, D. (2011). Space-varying color distributions for interactive multiregion segmentation: Discrete versus continuous approaches. In International Conference on Energy Minimization Methods for Computer Vision and Pattern Recognition, New York.","DOI":"10.1007\/978-3-642-23094-3_13"},{"key":"619_CR32","doi-asserted-by":"crossref","unstructured":"Osokin, A., Vetrov, D., & Kolmogorov, V. (2011). Submodular decomposition framework for inference in associative markov networks with global constraints. In International Conference on Computer Vision and Pattern Recognition, St. Petersburg.","DOI":"10.1109\/CVPR.2011.5995361"},{"key":"619_CR33","volume-title":"Probabilistic reasoning in intelligent systems","author":"J Pearl","year":"1988","unstructured":"Pearl, J. (1988). Probabilistic reasoning in intelligent systems. San Mateo: Morgan Kauffmann."},{"key":"619_CR34","doi-asserted-by":"crossref","unstructured":"Pock, T., & Chambolle, A. (2011). Diagonal preconditioning for first order primal-dual algorithms in convex optimization. In IEEE International Conference on Computer Vision, Barcelona.","DOI":"10.1109\/ICCV.2011.6126441"},{"key":"619_CR35","unstructured":"Pock, T., Cremers, D., Bischof, H., & Chambolle, A. (2009). An algorithm for minimizing the piecewise smooth Mumford-Shah functional. In IEEE International Conference on Computer Vision, Kyoto."},{"issue":"4","key":"619_CR36","doi-asserted-by":"crossref","first-page":"1122","DOI":"10.1137\/090757617","volume":"3","author":"T Pock","year":"2010","unstructured":"Pock, T., Cremers, D., Bischof, H., & Chambolle, A. (2010). Global solutions of variational models with convex regularization. SIAM Journal of Imaging Sciences, 3(4), 1122\u20131145.","journal-title":"SIAM Journal of Imaging Sciences"},{"key":"619_CR37","unstructured":"Santner, J. (2010). Interactive multi-label segmentation. Ph.D. thesis, University of Graz, Graz."},{"key":"619_CR38","unstructured":"Schlesinger, M. I. (1976). Sintaksicheskiy analiz dvumernykh zritelnikh signalov v usloviyakh pomekh (syntactic analysis of two-dimensional visual signals in noisy conditions). Kibernetika, 4, 113\u2013130. (in Russian)."},{"key":"619_CR39","doi-asserted-by":"crossref","unstructured":"Strekalovskiy, E., & Cremers, D. (2011). Generalized ordering constraints for multilabel optimization. In IEEE International Conference on Computer Vision, Barcelona.","DOI":"10.1109\/ICCV.2011.6126551"},{"key":"619_CR40","doi-asserted-by":"crossref","unstructured":"Szeliski, R., Zabih, R., Scharstein, D., Veksler, O., Kolmogorov, V., Agarwala, A., Tappen, M., & Rother, C. (2006). A comparative study of energy minimization methods for Markov random fields. In European Conference on Computer Vision, volume 3952 of, Lecture Notes in Computer Science, Graz (pp. 16\u201329).","DOI":"10.1007\/11744047_2"},{"key":"619_CR41","doi-asserted-by":"crossref","unstructured":"Tsai, A., Yezzi, A., Wells, W., Tempany, C., Tucker, D., & Fan, A., et al. (2001). Model-based curve evolution technique for image segmentation. In Computer Vision Pattern Recognition, Kauai, Hawaii (pp. 463\u2013468).","DOI":"10.1109\/CVPR.2001.990511"},{"key":"619_CR42","doi-asserted-by":"crossref","unstructured":"Veksler, O. (2007). Graph cut based optimization for MRFs with truncated convex priors. In International Conference on Computer Vision and Pattern Recognition, Beijing.","DOI":"10.1109\/CVPR.2007.383249"},{"key":"619_CR43","doi-asserted-by":"crossref","unstructured":"Veksler, O. (2009). Multi-label moves for MRFs with truncated convex priors. In International Conference on Energy Minimization Methods for Computer Vision and Pattern Recognition, Bonn.","DOI":"10.1007\/978-3-642-03641-5_1"},{"key":"619_CR44","doi-asserted-by":"crossref","unstructured":"Wainwright, M., Jaakkola, T., & Willsky, A. (2005). Map estimation via agreement on (hyper)trees: Message-passing and linear-programming approaches. IEEE Transactions on Information Theory, 51, 3697\u20133717.","DOI":"10.1109\/TIT.2005.856938"},{"key":"619_CR45","doi-asserted-by":"crossref","unstructured":"Werner, T. (2007). A linear programming approach to maxsum problem: A review. IEEE Transactions on Pattern Analysis and Machine Intelligence, 29(7), 1165\u20131179.","DOI":"10.1109\/TPAMI.2007.1036"},{"key":"619_CR46","unstructured":"Zach, C., Gallup, D., Frahm, J. M., & Niethammer, M. (2008). Fast global labeling for real-time stereo using multiple plane sweeps. In Vision modeling and visualization workshop (VMV), Konstanz."},{"key":"619_CR47","doi-asserted-by":"crossref","unstructured":"Zach, C., H\u00e4ne, C., & Pollefeys, M. (2012). What is optimized in tight convex relaxations for multi-label problems? In International Conference on Computer Vision and Pattern Recognition, Lund Sweden.","DOI":"10.1109\/CVPR.2012.6247860"},{"key":"619_CR48","doi-asserted-by":"crossref","unstructured":"Zach, C., Niethammer, M., & Frahm, J. M. (2009). Continuous maximal flows and Wulff shapes: Application to MRFs. In International Conference on Computer Vision and Pattern Recognition, Bonn.","DOI":"10.1109\/CVPR.2009.5206565"}],"container-title":["International Journal of Computer Vision"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11263-013-0619-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11263-013-0619-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11263-013-0619-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,9]],"date-time":"2024-05-09T05:53:24Z","timestamp":1715234004000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11263-013-0619-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,4,19]]},"references-count":48,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2013,9]]}},"alternative-id":["619"],"URL":"https:\/\/doi.org\/10.1007\/s11263-013-0619-y","relation":{},"ISSN":["0920-5691","1573-1405"],"issn-type":[{"value":"0920-5691","type":"print"},{"value":"1573-1405","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,4,19]]}}}