{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T10:23:27Z","timestamp":1725791007185},"publisher-location":"Berlin, Heidelberg","reference-count":33,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642547737"},{"type":"electronic","value":"9783642547744"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-642-54774-4_7","type":"book-chapter","created":{"date-parts":[[2014,4,1]],"date-time":"2014-04-01T05:46:25Z","timestamp":1396331185000},"page":"134-154","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["A Fast Continuous Max-Flow Approach to Non-convex Multi-labeling Problems"],"prefix":"10.1007","author":[{"given":"Egil","family":"Bae","sequence":"first","affiliation":[]},{"given":"Jing","family":"Yuan","sequence":"additional","affiliation":[]},{"given":"Xue-Cheng","family":"Tai","sequence":"additional","affiliation":[]},{"given":"Yuri","family":"Boykov","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,4,2]]},"reference":[{"key":"7_CR1","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 Trans. Pattern Anal. Mach. Intell. 23, 1222\u20131239 (2001)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"7_CR2","unstructured":"Appleton, B., Talbot, H.: Globally optimal surfaces by continuous maximal flows. In: DICTA, pp. 987\u2013996 (2003)"},{"key":"7_CR3","series-title":"LNCS","first-page":"82","volume-title":"ECCV 2002, Part III","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, Part III. LNCS, vol. 2352, pp. 82\u201396. Springer, Heidelberg (2002)"},{"key":"7_CR4","doi-asserted-by":"publisher","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":"7_CR5","doi-asserted-by":"crossref","unstructured":"Lempitsky, V., Boykov, Y.: Global optimization for shape fitting. In: CVPR (2007)","DOI":"10.1109\/CVPR.2007.383293"},{"key":"7_CR6","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 Trans. Pattern Anal. Mach. Intell. 25, 1333\u20131336 (2003)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"7_CR7","doi-asserted-by":"publisher","first-page":"1645","DOI":"10.1109\/TPAMI.2008.217","volume":"31","author":"P Kohli","year":"2009","unstructured":"Kohli, P., Kumar, M.P., Torr, P.H.: $$p^3$$ and beyond: move making algorithms for solving higher order functions. IEEE Trans. Pattern Anal. Mach. Intell. 31, 1645\u20131656 (2009)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"7_CR8","doi-asserted-by":"publisher","first-page":"1632","DOI":"10.1137\/040615286","volume":"66","author":"TF Chan","year":"2006","unstructured":"Chan, T.F., Esedog\u0304lu, S., Nikolova, M.: Algorithms for finding global minimizers of image segmentation and denoising models. SIAM J. Appl. Math. 66, 1632\u20131648 (2006). (electronic)","journal-title":"SIAM J. Appl. Math."},{"key":"7_CR9","series-title":"LNCS","first-page":"792","volume-title":"ECCV 2008, Part III","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. 5304, pp. 792\u2013805. Springer, Heidelberg (2008)"},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"Pock, T., Cremers, D., Bischof, H., Chambolle, A.: Global solutions of variational models with convex regularization. Technical report, Institute for Computer Graphics and Vision, Graz University of Technology (2010)","DOI":"10.1137\/090757617"},{"key":"7_CR11","unstructured":"Bouchitt\u2019e, G.: Recent convexity arguments in the calculus of variations. In: Lecture Notes from the 3rd International Summer School on the Calculus of Variations, Pisa (1998)"},{"key":"7_CR12","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/s005260100152","volume":"16","author":"G Alberti","year":"2003","unstructured":"Alberti, G., Bouchitt\u00e9, G., Maso, G.D.: The calibration method for the mumford-shah functional and free-discontinuity problems. Calc. Var. Partial Differ. Eqn. 16, 299\u2013333 (2003)","journal-title":"Calc. Var. Partial Differ. Eqn."},{"key":"7_CR13","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":"7_CR14","doi-asserted-by":"publisher","first-page":"399","DOI":"10.4153\/CJM-1956-045-5","volume":"8","author":"LR Ford","year":"1956","unstructured":"Ford, L.R., Fulkerson, D.R.: Maximal flow through a network. Can. J. Math. 8, 399\u2013404 (1956)","journal-title":"Can. J. Math."},{"key":"7_CR15","doi-asserted-by":"publisher","first-page":"921","DOI":"10.1145\/48014.61051","volume":"35","author":"AV Goldberg","year":"1988","unstructured":"Goldberg, A.V., Tarjan, R.E.: A new approach to the maximum-flow problem. J. ACM 35, 921\u2013940 (1988)","journal-title":"J. ACM"},{"key":"7_CR16","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"},{"key":"7_CR17","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/BF02592050","volume":"26","author":"G Strang","year":"1983","unstructured":"Strang, G.: Maximal flow through a domain. Math. Program. 26, 123\u2013143 (1983)","journal-title":"Math. Program."},{"key":"7_CR18","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 Trans. Pattern Anal. Mach. Intell. 28, 106\u2013118 (2006)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"7_CR19","doi-asserted-by":"crossref","unstructured":"Yuan, J., Bae, E., Tai, X.: A study on continuous max-flow and min-cut approaches. In: IEEE Conference on Computer Vision and Pattern Recognition, San Francisco, USA, pp. 2217\u20132224 (2010)","DOI":"10.1109\/CVPR.2010.5539903"},{"key":"7_CR20","doi-asserted-by":"crossref","unstructured":"Yuan, J., Bae, E., Tai, X., Boykov, Y.: A study on continuous max-flow and min-cut approaches. Technical report CAM10-61, UCLA, CAM (2010)","DOI":"10.1109\/CVPR.2010.5539903"},{"key":"7_CR21","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/978-3-642-15567-3_28","volume-title":"ECCV 2010, Part VI","author":"J Yuan","year":"2010","unstructured":"Yuan, J., Bae, E., Tai, X.-C., Boykov, Y.: A continuous max-flow approach to potts model. In: Daniilidis, K., Maragos, P., Paragios, N. (eds.) ECCV 2010, Part VI. LNCS, vol. 6316, pp. 379\u2013392. Springer, Heidelberg (2010)"},{"key":"7_CR22","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. J. Math. Imaging Vis. 40, 120\u2013145 (2011)","journal-title":"J. Math. Imaging Vis."},{"key":"7_CR23","unstructured":"Bae, E., Yuan, J., Tai, X., Boykov, Y.: A fast continuous max-flow approach to non-convex multilabeling problems. Technical report, UCLA, CAM-report 10-62 (2010)"},{"key":"7_CR24","series-title":"LNCS","first-page":"1","volume-title":"SSVM 2009","author":"E Bae","year":"2009","unstructured":"Bae, E., Tai, X.-C.: Graph cut optimization for the piecewise constant level set method applied to multiphase image segmentation. In: Tai, X.-C., M\u00f8rken, K., Lysaker, M., Lie, K.-A. (eds.) SSVM 2009. LNCS, vol. 5567, pp. 1\u201313. Springer, Heidelberg (2009)"},{"key":"7_CR25","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. Int. J. Comput. Vision 92, 112\u2013129 (2011)","journal-title":"Int. J. Comput. Vision"},{"key":"7_CR26","series-title":"Ergebnisse der Mathematik und ihrer Grenzgebiete. 3. Folge A Series of Modern Surveys in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-06218-0","volume-title":"Cartesian Currents in the Calculus of Variations I","author":"M Giaquinta","year":"1998","unstructured":"Giaquinta, M., Modica, G., Soucek, J.: Cartesian Currents in the Calculus of Variations I. Ergebnisse der Mathematik und ihrer Grenzgebiete. 3. Folge A Series of Modern Surveys in Mathematics, vol. 37. Springer, Heidelberg (1998)"},{"key":"7_CR27","series-title":"Ergebnisse der Mathematik und ihrer Grenzgebiete. 3. Folge A Series of Modern Surveys in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-06218-0","volume-title":"Cartesian Currents in the Calculus of Variations II","author":"M Giaquinta","year":"1998","unstructured":"Giaquinta, M., Modica, G., Soucek, J.: Cartesian Currents in the Calculus of Variations II. Ergebnisse der Mathematik und ihrer Grenzgebiete. 3. Folge A Series of Modern Surveys in Mathematics, vol. 38. Springer, Heidelberg (1998)"},{"key":"7_CR28","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1023\/B:JMIV.0000011320.81911.38","volume":"20","author":"A Chambolle","year":"2004","unstructured":"Chambolle, A.: An algorithm for total variation minimization and applications. J. Math. Imaging Vis. 20, 89\u201397 (2004)","journal-title":"J. Math. Imaging Vis."},{"key":"7_CR29","volume-title":"Nonlinear Programming","author":"DP Bertsekas","year":"1999","unstructured":"Bertsekas, D.P.: Nonlinear Programming. Athena Scientific, Belmont (1999)"},{"key":"7_CR30","unstructured":"Esser, J.E.: Primal dual algorithms for convex models and applications to image restoration, registration and nonlocal inpainting (2010)"},{"key":"7_CR31","doi-asserted-by":"publisher","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, 81\u2013104 (1997)","journal-title":"Comput. Math. Appl."},{"key":"7_CR32","doi-asserted-by":"publisher","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, 413\u2013442 (1997)","journal-title":"Appl. Numer. Math."},{"key":"7_CR33","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."}],"container-title":["Lecture Notes in Computer Science","Efficient Algorithms for Global Optimization Methods in Computer Vision"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-54774-4_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,19]],"date-time":"2023-02-19T21:33:03Z","timestamp":1676842383000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-54774-4_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783642547737","9783642547744"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-54774-4_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"2 April 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}