{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T17:00:35Z","timestamp":1725814835210},"publisher-location":"Cham","reference-count":34,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319146119"},{"type":"electronic","value":"9783319146126"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-14612-6_2","type":"book-chapter","created":{"date-parts":[[2015,1,7]],"date-time":"2015-01-07T03:34:38Z","timestamp":1420601678000},"page":"15-28","source":"Crossref","is-referenced-by-count":5,"title":["Maximizing Flows with Message-Passing: Computing Spatially Continuous Min-Cuts"],"prefix":"10.1007","author":[{"given":"Egil","family":"Bae","sequence":"first","affiliation":[]},{"given":"Xue-Cheng","family":"Tai","sequence":"additional","affiliation":[]},{"given":"Jing","family":"Yuan","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"2_CR1","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1109\/TPAMI.2006.12","volume":"28","author":"B. Appleton","year":"2006","unstructured":"Appleton, B., Talbot, H.: Globally minimal surfaces by continuous maximal flows. IEEE Transactions on PAMI\u00a028, 106\u2013118 (2006)","journal-title":"IEEE Transactions on PAMI"},{"issue":"1","key":"2_CR2","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/s11263-010-0406-y","volume":"92","author":"E. Bae","year":"2011","unstructured":"Bae, E., Yuan, J., Tai, X.-C.: Global minimization for continuous multiphase partitioning problems using a dual approach. International Journal of Computer Vision\u00a092(1), 112\u2013129 (2011)","journal-title":"International Journal of Computer Vision"},{"key":"2_CR3","first-page":"1705","volume":"6","author":"A. Banerjee","year":"2005","unstructured":"Banerjee, A., Merugu, S., Dhillon, I.S., Ghosh, J.: Clustering with bregman divergences. Journal of Machine Learning Research\u00a06, 1705\u20131749 (2005)","journal-title":"Journal of Machine Learning Research"},{"key":"2_CR4","first-page":"359","volume":"26","author":"Y. Boykov","year":"2001","unstructured":"Boykov, Y., Kolmogorov, V.: An experimental comparison of min-cut\/max-flow algorithms for energy minimization in vision. IEEE Transactions on PAMI\u00a026, 359\u2013374 (2001)","journal-title":"IEEE Transactions on PAMI"},{"key":"2_CR5","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 Transactions on PAMI\u00a023, 1222 (2001)","journal-title":"IEEE Transactions on PAMI"},{"key":"2_CR6","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1016\/0041-5553(67)90040-7","volume":"7","author":"L.M. Bregman","year":"1967","unstructured":"Bregman, L.M.: The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming. USSR Computational Mathematics and Mathematical Physics\u00a07, 200\u2013217 (1967)","journal-title":"USSR Computational Mathematics and Mathematical Physics"},{"issue":"2","key":"2_CR7","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/s10851-007-0002-0","volume":"28","author":"X. Bresson","year":"2007","unstructured":"Bresson, X., Esedoglu, S., Vandergheynst, P., Thiran, J.P., Osher, S.: Fast global minimization of the active contour\/snake model. Journal of Mathematical Imaging and Vision\u00a028(2), 151\u2013167 (2007)","journal-title":"Journal of Mathematical Imaging and Vision"},{"key":"2_CR8","unstructured":"Censor, Y.A., Zenios, S.A.: Parallel Optimization: Theory, Algorithms and Applications. Oxford University Press (1997)"},{"key":"2_CR9","unstructured":"Chambolle, A., Cremers, D., Pock, T.: A convex approach for computing minimal partitions. Technical Report TR-2008-05, University of Bonn (November 2008)"},{"issue":"1","key":"2_CR10","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1007\/s10851-010-0251-1","volume":"40","author":"A. Chambolle","year":"2011","unstructured":"Chambolle, A., Pock, T.: A first-order primal-dual algorithm for convex problems with applications to imaging. Journal of Mathematical Imaging and Vision\u00a040(1), 120\u2013145 (2011)","journal-title":"Journal of Mathematical Imaging and Vision"},{"issue":"4","key":"2_CR11","doi-asserted-by":"publisher","first-page":"1015","DOI":"10.1137\/09076934X","volume":"3","author":"E. Esser","year":"2010","unstructured":"Esser, E., Zhang, X., Chan, T.F.: A general framework for a class of first order primal-dual algorithms for convex optimization in imaging science. SIAM J. Imaging Sciences\u00a03(4), 1015\u20131046 (2010)","journal-title":"SIAM J. Imaging Sciences"},{"key":"2_CR12","volume-title":"Flows in Networks","author":"L.R. Ford","year":"1962","unstructured":"Ford, L.R., Fulkerson, D.R.: Flows in Networks. Princeton University Press, Princeton (1962)"},{"key":"2_CR13","doi-asserted-by":"publisher","first-page":"399","DOI":"10.4153\/CJM-1956-045-5","volume":"8","author":"L.R. Ford Jr.","year":"1956","unstructured":"Ford Jr., L.R., Fulkerson, D.R.: Maximal flow through a network. Canad. J. Math.\u00a08, 399\u2013404 (1956)","journal-title":"Canad. J. Math."},{"issue":"4","key":"2_CR14","doi-asserted-by":"publisher","first-page":"921","DOI":"10.1145\/48014.61051","volume":"35","author":"A.V. Goldberg","year":"1988","unstructured":"Goldberg, A.V., Tarjan, R.E.: A new approach to the maximum-flow problem. J. ACM\u00a035(4), 921\u2013940 (1988)","journal-title":"J. ACM"},{"issue":"1-3","key":"2_CR15","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1007\/s10915-009-9331-z","volume":"45","author":"T. Goldstein","year":"2010","unstructured":"Goldstein, T., Bresson, X., Osher, S.: Geometric applications of the split bregman method: Segmentation and surface reconstruction. J. Sci. Comput.\u00a045(1-3), 272\u2013293 (2010)","journal-title":"J. Sci. Comput."},{"key":"2_CR16","doi-asserted-by":"crossref","unstructured":"Greig, D.M., Porteous, B.T., Seheult, A.H.: Exact maximum a posteriori estimation for binary images. J. Royal Stat. Soc., Series B, 271\u2013279 (1989)","DOI":"10.1111\/j.2517-6161.1989.tb01764.x"},{"issue":"4","key":"2_CR17","doi-asserted-by":"publisher","first-page":"992","DOI":"10.1287\/opre.1080.0524","volume":"56","author":"D.S. Hochbaum","year":"2008","unstructured":"Hochbaum, D.S.: The pseudoflow algorithm: A new algorithm for the maximum-flow problem. Operations Research\u00a056(4), 992\u20131009 (2008)","journal-title":"Operations Research"},{"issue":"4","key":"2_CR18","doi-asserted-by":"publisher","first-page":"790","DOI":"10.1287\/moor.19.4.790","volume":"19","author":"A.N. Iusem","year":"1994","unstructured":"Iusem, A.N., Svaiter, B.F., Teboulle, M.: Entropy-like proximal methods in convex programming. Mathematics of Operations Research\u00a019(4), 790\u2013814 (1994)","journal-title":"Mathematics of Operations Research"},{"key":"2_CR19","unstructured":"Kolmogorov, V., Wainwright, M.J.: On the optimality of tree-reweighted max-product message-passing. In: UAI, pp. 316\u2013323 (2005)"},{"key":"2_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1007\/978-3-642-02256-2_13","volume-title":"Scale Space and Variational Methods in Computer Vision","author":"J. Lellmann","year":"2009","unstructured":"Lellmann, J., Kappes, J., Yuan, J., Becker, F., Schn\u00f6rr, C.: Convex multi-class image labeling by simplex-constrained total variation. In: Tai, X.-C., M\u00f8rken, K., Lysaker, M., Lie, K.-A. (eds.) SSVM 2009. LNCS, vol.\u00a05567, pp. 150\u2013162. Springer, Heidelberg (2009)"},{"issue":"5","key":"2_CR21","doi-asserted-by":"publisher","first-page":"1632","DOI":"10.1137\/040615286","volume":"66","author":"M. Nikolova","year":"2006","unstructured":"Nikolova, M., Esedoglu, S., Chan, T.F.: Algorithms for finding global minimizers of image segmentation and denoising models. SIAM J. App. Math.\u00a066(5), 1632\u20131648 (2006)","journal-title":"SIAM J. App. Math."},{"key":"2_CR22","doi-asserted-by":"crossref","unstructured":"Olsson, C., Byr\u00f6d, M., Overgaard, N.C., Kahl, F.: Extending continuous cuts: Anisotropic metrics and expansion moves. In: ICCV, pp. 405\u2013412 (2009)","DOI":"10.1109\/ICCV.2009.5459206"},{"key":"2_CR23","volume-title":"Handbook of Mathematical Models in Computer Vision","author":"N. Paragios","year":"2005","unstructured":"Paragios, N., Chen, Y., Faugeras, O.: Handbook of Mathematical Models in Computer Vision. Springer-Verlag New York, Inc., Secaucus (2005)"},{"key":"2_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"792","DOI":"10.1007\/978-3-540-88690-7_59","volume-title":"Computer Vision \u2013 ECCV 2008","author":"T. Pock","year":"2008","unstructured":"Pock, T., Schoenemann, T., Graber, G., Bischof, H., Cremers, D.: A convex formulation of continuous multi-label problems. In: Forsyth, D., Torr, P., Zisserman, A. (eds.) ECCV 2008, Part III. LNCS, vol.\u00a05304, pp. 792\u2013805. Springer, Heidelberg (2008)"},{"issue":"2","key":"2_CR25","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1287\/moor.1.2.97","volume":"1","author":"R.T. Rockafellar","year":"1976","unstructured":"Rockafellar, R.T.: Augmented Lagrangians and applications of the proximal point algorithm in convex programming. Math. Oper. Res.\u00a01(2), 97\u2013116 (1976)","journal-title":"Math. Oper. Res."},{"key":"2_CR26","unstructured":"Rockafellar, R.T.: Convex analysis. Princeton Mathematical Series, vol. 28. Princeton University Press, Princeton (1970)"},{"issue":"5","key":"2_CR27","doi-asserted-by":"publisher","first-page":"877","DOI":"10.1137\/0314056","volume":"14","author":"R.T. Rockafellar","year":"1976","unstructured":"Rockafellar, R.T.: Monotone operators and the proximal point algorithm. SIAM J. Control Optimization\u00a014(5), 877\u2013898 (1976)","journal-title":"SIAM J. Control Optimization"},{"issue":"3","key":"2_CR28","doi-asserted-by":"publisher","first-page":"670","DOI":"10.1287\/moor.17.3.670","volume":"17","author":"M. Teboulle","year":"1992","unstructured":"Teboulle, M.: Entropic proximal mappings with applications to nonlinear programming. Math. Oper. Res.\u00a017(3), 670\u2013690 (1992)","journal-title":"Math. Oper. Res."},{"key":"2_CR29","first-page":"65","volume":"8","author":"M. Teboulle","year":"2007","unstructured":"Teboulle, M.: A unified continuous optimization framework for center-based clustering methods. J. Mach. Learn. Res.\u00a08, 65\u2013102 (2007)","journal-title":"J. Mach. Learn. Res."},{"key":"2_CR30","doi-asserted-by":"publisher","first-page":"3697","DOI":"10.1109\/TIT.2005.856938","volume":"51","author":"M. Wainwright","year":"2002","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, 3697\u20133717 (2002)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"11","key":"2_CR31","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., Willsky, A.S.: Map estimation via agreement on trees: message-passing and linear programming. IEEE Transactions on Information Theory\u00a051(11), 3697\u20133717 (2005)","journal-title":"IEEE Transactions on Information Theory"},{"key":"2_CR32","doi-asserted-by":"crossref","unstructured":"Yuan, J., Bae, E., Tai, X.C.: A study on continuous max-flow and min-cut approaches. In: CVPR, USA, San Francisco (2010)","DOI":"10.1109\/CVPR.2010.5539903"},{"key":"2_CR33","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1007\/s00211-013-0569-x","volume":"126","author":"J. Yuan","year":"2013","unstructured":"Yuan, J., Bae, E., Tai, X.-C., Boykov, Y.: A spatially continuous max-flow and min-cut framework for binary labeling problems. Numerische Mathematik\u00a0126, 559\u2013587 (2013)","journal-title":"Numerische Mathematik"},{"key":"2_CR34","unstructured":"Zach, C., Gallup, D., Frahm, J.-M., Niethammer, M.: Fast global labeling for real-time stereo using multiple plane sweeps. In: VMV 2008 (2008)"}],"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-319-14612-6_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,19]],"date-time":"2019-08-19T09:26:38Z","timestamp":1566206798000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-14612-6_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319146119","9783319146126"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-14612-6_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}