{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T16:34:26Z","timestamp":1772296466987,"version":"3.50.1"},"reference-count":51,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2013,6,16]],"date-time":"2013-06-16T00:00:00Z","timestamp":1371340800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Numer. Math."],"published-print":{"date-parts":[[2014,3]]},"DOI":"10.1007\/s00211-013-0569-x","type":"journal-article","created":{"date-parts":[[2013,6,15]],"date-time":"2013-06-15T02:53:22Z","timestamp":1371264802000},"page":"559-587","source":"Crossref","is-referenced-by-count":45,"title":["A spatially continuous max-flow and min-cut framework for binary labeling problems"],"prefix":"10.1007","volume":"126","author":[{"given":"Jing","family":"Yuan","sequence":"first","affiliation":[]},{"given":"Egil","family":"Bae","sequence":"additional","affiliation":[]},{"given":"Xue-Cheng","family":"Tai","sequence":"additional","affiliation":[]},{"given":"Yuri","family":"Boykov","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,6,16]]},"reference":[{"key":"569_CR1","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1145\/1015706.1015718","volume":"23","author":"A Agarwala","year":"2004","unstructured":"Agarwala, A., Dontcheva, M., Agrawala, M., Drucker, S., Colburn, A., Curless, B., Salesin, D., Cohen, M.: Interactive digital photomontage. ACM Trans. Graph 23, 294\u2013302 (2004)","journal-title":"ACM Trans. Graph"},{"key":"569_CR2","unstructured":"Appleton, B., Talbot, H.: Globally optimal surfaces by continuous maximal flows. In: DICTA, pp 987\u2013996 (2003)"},{"issue":"1","key":"569_CR3","doi-asserted-by":"crossref","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 Trans. Pattern Anal. Mach. Intell. 28(1), 106\u2013118 (2006)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"569_CR4","unstructured":"Bae, E., Yuan, J., Tai, X.-C., Boycov, Y.: A fast continuous max-flow approach to non-convex multilabeling problems. Technical report CAM-10-62, UCLA (2010)"},{"key":"569_CR5","doi-asserted-by":"crossref","unstructured":"Bae, E., Tai, X.-C.: Efficient global minimization for the multiphase Chan-Vese model of image segmentation. In: Energy Minimization Methods in Computer Vision and Pattern Recognition, vol.\u00a05681, pp. 28\u201341. LNCS (2009)","DOI":"10.1007\/978-3-642-03641-5_3"},{"issue":"1","key":"569_CR6","doi-asserted-by":"crossref","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. Int. J. Comput. Vision 92(1), 112\u2013129 (2011)","journal-title":"Int. J. Comput. Vision"},{"key":"569_CR7","volume-title":"Nonlinear Programming","author":"DP Bertsekas","year":"1999","unstructured":"Bertsekas, D.P.: Nonlinear Programming. Athena Scientific, Belmont (1999)"},{"key":"569_CR8","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 Trans. Pattern Anal. Mach. Intell. 26, 359\u2013374 (2001)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"569_CR9","doi-asserted-by":"crossref","unstructured":"Boykov, Y., Kolmogorov, V.: Computing geodesics and minimal surfaces via graph cuts. In: ICCV, pp 26\u201333 (2003)","DOI":"10.1109\/ICCV.2003.1238310"},{"key":"569_CR10","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.: Fast approximate energy minimization via graph cuts. IEEE Trans. Pattern Anal. Mach. Intell. 23, 1222\u20131239 (2001)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"2","key":"569_CR11","doi-asserted-by":"crossref","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. J. Math. Imaging Vision 28(2), 151\u2013167 (2007)","journal-title":"J. Math. Imaging Vision"},{"issue":"1","key":"569_CR12","first-page":"89","volume":"20","author":"A Chambolle","year":"2004","unstructured":"Chambolle, A.: An algorithm for total variation minimization and applications. J. Math. Imaging Vision 20(1), 89\u201397 (2004)","journal-title":"J. Math. Imaging Vision"},{"key":"569_CR13","doi-asserted-by":"crossref","unstructured":"Chan, T.F., Esedo $$\\bar{{\\rm g}}$$ g \u00af lu, S., Nikolova, M.: Algorithms for finding global minimizers of image segmentation and denoising models. SIAM J. Appl. Math. 66(5):1632\u20131648 (electronic), (2006)","DOI":"10.1137\/040615286"},{"key":"569_CR14","volume-title":"Introduction to Algorithms","author":"TH Cormen","year":"2001","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press, Cambridge (2001)","edition":"2"},{"issue":"3","key":"569_CR15","doi-asserted-by":"crossref","first-page":"905","DOI":"10.1137\/100799186","volume":"4","author":"C Couprie","year":"2011","unstructured":"Couprie, C., Grady, L., Talbot, H., Najman, L.: Combinatorial continuous maximum flow. SIAM J. Img. Sci 4(3), 905\u2013930 (2011)","journal-title":"SIAM J. Img. Sci"},{"key":"569_CR16","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1007\/11685654_10","volume":"3859","author":"Y Dinitz","year":"2006","unstructured":"Dinitz, Y.: Dinitz\u2019 algorithm: the original version and even\u2019s version. Theor. Comput. Sci. 3859, 218\u2013240 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"569_CR17","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611971088","volume-title":"Convex analysis and variational problems","author":"I Ekeland","year":"1999","unstructured":"Ekeland, I., T\u00e9man, R.: Convex analysis and variational problems. Society for Industrial and Applied Mathematics, Philadelphia (1999)"},{"key":"569_CR18","volume-title":"Flows in Networks","author":"LR Ford","year":"1962","unstructured":"Ford, L.R., Fulkerson, D.R.: Flows in Networks. Princeton University Press, Princeton (1962)"},{"key":"569_CR19","unstructured":"Giusti, E.: Minimal surfaces and functions of bounded variation. Australian National University, Canberra (1977)"},{"issue":"4","key":"569_CR20","doi-asserted-by":"crossref","first-page":"921","DOI":"10.1145\/48014.61051","volume":"35","author":"A Goldberg","year":"1988","unstructured":"Goldberg, A., Tarjan, R.E.: A new approach to the maximum-flow problem. J. ACM 35(4), 921\u2013940 (1988)","journal-title":"J. ACM"},{"key":"569_CR21","unstructured":"Goldstein, T., Bresson, X., Osher, S.: Geometric applications of the split bregman method: Segmentation and surface reconstruction. Technical report CAM09-06, UCLA, CAM (2009)"},{"issue":"2","key":"569_CR22","doi-asserted-by":"crossref","first-page":"323343","DOI":"10.1137\/080725891","volume":"2","author":"T Goldstein","year":"2009","unstructured":"Goldstein, T., Osher, S.: The split bregman method for l1-regularized problems. SIAM J. Imaging Sci 2(2), 323343 (2009)","journal-title":"SIAM J. Imaging Sci"},{"key":"569_CR23","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.: Exact maximum a posteriori estimation for binary images. J. Royal Stat. Soc. Series B 51, 271\u2013279 (1989)","journal-title":"J. Royal Stat. Soc. Series B"},{"key":"569_CR24","volume-title":"Convex analysis and minimization algorithms. I, volume 305 of Grundlehren der Mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences]","author":"J-B Hiriart-Urruty","year":"1993","unstructured":"Hiriart-Urruty, J.-B., Lemar\u00e9chal, C.: Convex analysis and minimization algorithms. I, volume 305 of Grundlehren der Mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences]. Springer, Berlin (1993)"},{"issue":"4","key":"569_CR25","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1016\/S0168-9274(97)00097-4","volume":"25","author":"JM Hyman","year":"1997","unstructured":"Hyman, J.M., Shashkov, M.J.: Adjoint operators for the natural discretizations of the divergence, gradient and curl on logically rectangular grids. Appl. Numer. Math. 25(4), 413\u2013442 (1997)","journal-title":"Appl. Numer. Math."},{"issue":"4","key":"569_CR26","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/S0898-1221(97)00009-6","volume":"33","author":"JM Hyman","year":"1997","unstructured":"Hyman, J.M., Shashkov, M.J.: Natural discretizations for the divergence, gradient, and curl on logically rectangular grids. Comput. Math. Appl. 33(4), 81\u2013104 (1997)","journal-title":"Comput. Math. Appl."},{"key":"569_CR27","doi-asserted-by":"crossref","unstructured":"Ishikawa, H.: Higher-order clique reduction in binary graph cut. In: CVPR, pp. 2993\u20133000, (2009)","DOI":"10.1109\/CVPRW.2009.5206689"},{"issue":"9","key":"569_CR28","doi-asserted-by":"crossref","first-page":"1645","DOI":"10.1109\/TPAMI.2008.217","volume":"31","author":"P Kohli","year":"2009","unstructured":"Kohli, P., Pawan Kumar, M., Torr, P.H.S.: $$p^{3}$$ p 3 and beyond: Move making algorithms for solving higher order functions. IEEE Trans. Pattern Anal. Mach. Intell. 31(9), 1645\u20131656 (2009)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"569_CR29","doi-asserted-by":"crossref","unstructured":"Kolmogorov, V.: What metrics can be approximated by geo-cuts, or global optimization of length\/area and flux. In: ICCV, pp. 564\u2013571 (2005)","DOI":"10.1109\/ICCV.2005.252"},{"issue":"10","key":"569_CR30","doi-asserted-by":"crossref","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 Trans. Pattern Anal. Mach. Intell 28(10), 1568\u20131583 (2006)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell"},{"key":"569_CR31","doi-asserted-by":"crossref","unstructured":"Kolmogorov, V., Zabih, R.: Multi-camera scene reconstruction via graph cuts. In: European Conference on Computer Vision, pp. 82\u201396 (2002)","DOI":"10.1007\/3-540-47977-5_6"},{"key":"569_CR32","doi-asserted-by":"crossref","first-page":"65","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 Trans. Pattern Anal. Mach. Intell. 26, 65\u201381 (2004)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"569_CR33","unstructured":"Komodakis, N., Tziritas, G.: Approximate labeling via graph-cuts based on linear programming. Pattern Anal. Mach. Intell. 29, 1436\u20131453 (2007)"},{"issue":"3","key":"569_CR34","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1145\/882262.882264","volume":"22","author":"Vivek Kwatra","year":"2003","unstructured":"Kwatra, Vivek, Schoedl, Arno, Essa, Irfan, Turk, Greg, Bobick, Aaron: Graphcut textures: Image and video synthesis using graph cuts. ACM Trans. Graphics SIGGRAPH 22(3), 277\u2013286 (2003)","journal-title":"ACM Trans. Graphics SIGGRAPH"},{"key":"569_CR35","doi-asserted-by":"crossref","unstructured":"Lellmann, J., Kappes, J., Yuan, J., Becker, F., Schn\u00f6rr, C.: Convex multi-class image labeling by simplex-constrained total variation. Technical report, HCI, IWR, Uni. Heidelberg, IWR, Uni. Heidelberg (2008)","DOI":"10.1007\/978-3-642-02256-2_13"},{"key":"569_CR36","doi-asserted-by":"crossref","unstructured":"Lempitsky, V., Boykov, Y.: Global optimization for shape fitting. In: CVPR (2007)","DOI":"10.1109\/CVPR.2007.383293"},{"key":"569_CR37","doi-asserted-by":"crossref","unstructured":"Lempitsky, Victor. S., Boykov, Y., Ivanov, D.V.: Oriented visibility for multiview reconstruction. In: ECCV\u201906, pp. 226\u2013238 (2006)","DOI":"10.1007\/11744078_18"},{"key":"569_CR38","volume-title":"Markov random field modeling in image analysis","author":"SZ Li","year":"2001","unstructured":"Li, S.Z.: Markov random field modeling in image analysis. Springer, Secaucus (2001)"},{"issue":"5","key":"569_CR39","doi-asserted-by":"crossref","first-page":"1171","DOI":"10.1109\/TIP.2005.863956","volume":"15","author":"J Lie","year":"2006","unstructured":"Lie, J., Lysaker, M., Tai, X.C.: A binary level set model and some applications to mumford-shah image segmentation. IEEE Trans. Image Process. 15(5), 1171\u20131181 (2006)","journal-title":"IEEE Trans. Image Process."},{"key":"569_CR40","doi-asserted-by":"crossref","unstructured":"Lie, J., Lysaker, M., Tai, X.C.: A variant of the level set method and applications to image segmentation. Math. Comp., 75(255):1155\u20131174 (electronic), (2006)","DOI":"10.1090\/S0025-5718-06-01835-7"},{"issue":"2","key":"569_CR41","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1007\/BF01582067","volume":"63","author":"R Nozawa","year":"1994","unstructured":"Nozawa, R.: Examples of max-flow and min-cut problems with duality gaps in continuous networks. Math. Program 63(2), 213\u2013234 (1994)","journal-title":"Math. Program"},{"issue":"1","key":"569_CR42","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1016\/0021-9991(88)90002-2","volume":"79","author":"S Osher","year":"1988","unstructured":"Osher, S., Sethian, J.A.: Fronts propagating with curvature dependent speed: algorithms based on hamilton-jacobi formulations. J. Comput. Phys. 79(1), 12\u201349 (1988)","journal-title":"J. Comput. Phys."},{"key":"569_CR43","volume-title":"Handbook Math Models Comput Vision","author":"N Paragios","year":"2005","unstructured":"Paragios, N., Chen, Y., Faugeras, O.: Handbook Math Models Comput Vision. Springer-Verlag New York, Inc., Secaucus (2005)"},{"key":"569_CR44","doi-asserted-by":"crossref","unstructured":"Pock, T., Chambolle, A., Bischof, H., Cremers, D.: A convex relaxation approach for computing minimal partitions. In: IEEE Conference on Computer Vision and Pattern Recognition (CVPR), pp. 810\u2013817, Miami (2009)","DOI":"10.1109\/CVPR.2009.5206604"},{"key":"569_CR45","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/BF02592050","volume":"26","author":"G Strang","year":"1983","unstructured":"Strang, G.: Maximal flow through a domain. Math. Programm. 26, 123\u2013143 (1983)","journal-title":"Math. Programm."},{"key":"569_CR46","first-page":"1","volume":"III","author":"G Strang","year":"2008","unstructured":"Strang, G.: Maximum flows and minimum cuts in the plane. Adv. Mech. Math. III, 1\u201311 (2008)","journal-title":"Adv. Mech. Math."},{"key":"569_CR47","doi-asserted-by":"crossref","unstructured":"Szeliski, R., Zabih, R., Scharstein, D., Veksler, O., Agarwala, A., Rother, C.: A comparative study of energy minimization methods for markov random fields. In ECCV, pp. 16\u201329 (2006)","DOI":"10.1007\/11744047_2"},{"issue":"12","key":"569_CR48","doi-asserted-by":"crossref","first-page":"2241","DOI":"10.1109\/TPAMI.2007.70712","volume":"29","author":"G Vogiatzis","year":"2007","unstructured":"Vogiatzis, G., Esteban, C.H., Torr, P.H., Cipolla, R.: Multi-view stereo via volumetric graph-cuts and occlusion robust photo-consistency. PAMI 29(12), 2241\u20132246 (2007)","journal-title":"PAMI"},{"key":"569_CR49","doi-asserted-by":"crossref","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 Trans. Inform. Theory 51, 3697\u20133717 (2002)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"569_CR50","doi-asserted-by":"crossref","unstructured":"Yuan, J., Bae, E., Tai, X.C.: A study on continuous max-flow and min-cut approaches. In: IEEE Conference on Computer Vision and Pattern Recognition, pp. 2217\u20132224. San Francisco (2010)","DOI":"10.1109\/CVPR.2010.5539903"},{"key":"569_CR51","doi-asserted-by":"crossref","unstructured":"Yuan, Jing., Bae, Egil., Tai, Xue-Cheng., Boykov, Yuri.: A continuous max-flow approach to potts model. In: European Conference on Computer Vision, vol. 6316, pp. 379-392. LNCS (2010)","DOI":"10.1007\/978-3-642-15567-3_28"}],"container-title":["Numerische Mathematik"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00211-013-0569-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00211-013-0569-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00211-013-0569-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,12]],"date-time":"2024-05-12T12:08:55Z","timestamp":1715515735000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00211-013-0569-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,6,16]]},"references-count":51,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2014,3]]}},"alternative-id":["569"],"URL":"https:\/\/doi.org\/10.1007\/s00211-013-0569-x","relation":{},"ISSN":["0029-599X","0945-3245"],"issn-type":[{"value":"0029-599X","type":"print"},{"value":"0945-3245","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,6,16]]}}}