{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T08:23:16Z","timestamp":1759134196385,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540886815"},{"type":"electronic","value":"9783540886822"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-88682-2_26","type":"book-chapter","created":{"date-parts":[[2008,10,11]],"date-time":"2008-10-11T19:59:49Z","timestamp":1223755189000},"page":"332-345","source":"Crossref","is-referenced-by-count":29,"title":["An Experimental Comparison of Discrete and Continuous Shape Optimization Methods"],"prefix":"10.1007","author":[{"given":"Maria","family":"Klodt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Schoenemann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kalin","family":"Kolev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marek","family":"Schikora","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Cremers","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"26_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 Trans. Pattern Anal. Mach. Intell.\u00a028(1), 106\u2013118 (2006)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"26_CR2","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/7132.001.0001","volume-title":"Visual Reconstruction","author":"A. Blake","year":"1987","unstructured":"Blake, A., Zisserman, A.: Visual Reconstruction. MIT Press, Cambridge (1987)"},{"key":"26_CR3","doi-asserted-by":"crossref","unstructured":"Boykov, Y., Kolmogorov, V.: Computing geodesics and minimal surfaces via graph cuts. In: IEEE Int. Conf. on Computer Vision, Nice, pp. 26\u201333 (2003)","DOI":"10.1109\/ICCV.2003.1238310"},{"issue":"9","key":"26_CR4","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 Trans. on Patt. Anal. and Mach. Intell.\u00a026(9), 1124\u20131137 (2004)","journal-title":"IEEE Trans. on Patt. Anal. and Mach. Intell."},{"key":"26_CR5","doi-asserted-by":"crossref","unstructured":"Boykov, Y., Veksler, O., Zabih, R.: Markov random fields with efficient approximations. In: Proc.\u00a0IEEE Conf.\u00a0on Comp.\u00a0Vision Patt.\u00a0Recog.\u00a0(CVPR 1998), Santa Barbara, California, pp. 648\u2013655 (1998)","DOI":"10.1109\/CVPR.1998.698673"},{"key":"26_CR6","doi-asserted-by":"crossref","unstructured":"Caselles, V., Kimmel, R., Sapiro, G.: Geodesic active contours. In: Proc. IEEE Intl. Conf. on Comp. Vis., Boston, USA, pp. 694\u2013699 (1995)","DOI":"10.1109\/ICCV.1995.466871"},{"key":"26_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1007\/11585978_10","volume-title":"Energy Minimization Methods in Computer Vision and Pattern Recognition","author":"A. Chambolle","year":"2005","unstructured":"Chambolle, A.: Total variation minimization and a class of binary MRF models. In: Rangarajan, A., Vemuri, B.C., Yuille, A.L. (eds.) EMMCVPR 2005. LNCS, vol.\u00a03757, pp. 136\u2013152. Springer, Heidelberg (2005)"},{"issue":"5","key":"26_CR8","doi-asserted-by":"publisher","first-page":"1632","DOI":"10.1137\/040615286","volume":"66","author":"T. Chan","year":"2006","unstructured":"Chan, T., Esedo\u1e21lu, S., Nikolova, M.: Algorithms for finding global minimizers of image segmentation and denoising models. SIAM Journal on Applied Mathematics\u00a066(5), 1632\u20131648 (2006)","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"26_CR9","doi-asserted-by":"crossref","unstructured":"Delong, A., Boykov, Y.: A scalable graph-cut algorithm for n-d grids. In: Int. Conf. on Computer Vision and Pattern Recognition, Anchorage, Alaska (2008)","DOI":"10.1109\/CVPR.2008.4587464"},{"key":"26_CR10","first-page":"1277","volume":"11","author":"E.A. Dinic","year":"1970","unstructured":"Dinic, E.A.: Algorithm for the solution of a problem of maximum flow in a network with power estimation. Soviet Mathematics Doklady\u00a011, 1277\u20131280 (1970)","journal-title":"Soviet Mathematics Doklady"},{"key":"26_CR11","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1145\/321694.321699","volume":"19","author":"J. Edmonds","year":"1972","unstructured":"Edmonds, J., Karp, R.: Theoretical improvements in algorithmic efficiency for network flow problems. Journal of the ACM\u00a019, 248\u2013264 (1972)","journal-title":"Journal of the ACM"},{"issue":"3","key":"26_CR12","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1109\/83.661183","volume":"7","author":"O. Faugeras","year":"1998","unstructured":"Faugeras, O., Keriven, R.: Variational principles, surface evolution, PDE\u2019s, level set methods, and the stereo problem. IEEE Trans. on Image Processing\u00a07(3), 336\u2013344 (1998)","journal-title":"IEEE Trans. on Image Processing"},{"key":"26_CR13","volume-title":"Flows in Networks","author":"L. Ford","year":"1962","unstructured":"Ford, L., Fulkerson, D.: Flows in Networks. Princeton University Press, Princeton (1962)"},{"key":"26_CR14","doi-asserted-by":"crossref","unstructured":"Freedman, D., Drineas, P.: Energy minimization via graph cuts: settling what is possible. In: Int. Conf. on Computer Vision and Pattern Recognition, San Diego, USA, vol.\u00a02, pp. 939\u2013946 (June 2005)","DOI":"10.1109\/CVPR.2005.143"},{"issue":"6","key":"26_CR15","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. IEEE Trans. on Patt. Anal. and Mach. Intell.\u00a06(6), 721\u2013741 (1984)","journal-title":"IEEE Trans. on Patt. Anal. and Mach. Intell."},{"issue":"4","key":"26_CR16","doi-asserted-by":"publisher","first-page":"921","DOI":"10.1145\/48014.61051","volume":"35","author":"A. Goldberg","year":"1988","unstructured":"Goldberg, A., Tarjan, R.: A new approach to the maximum flow problem. Journal of the ACM\u00a035(4), 921\u2013940 (1988)","journal-title":"Journal of the ACM"},{"key":"26_CR17","doi-asserted-by":"publisher","first-page":"783","DOI":"10.1145\/290179.290181","volume":"45","author":"A.V. Goldberg","year":"1998","unstructured":"Goldberg, A.V., Rao, S.: Beyond the flow decomposition barrier. Journal of the ACM\u00a045, 783\u2013797 (1998)","journal-title":"Journal of the ACM"},{"issue":"2","key":"26_CR18","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1111\/j.2517-6161.1989.tb01764.x","volume":"51","author":"D.M. Greig","year":"1989","unstructured":"Greig, D.M., Porteous, B.T., Seheult, A.H.: Exact maximum a posteriori estimation for binary images. J. Roy. Statist. Soc., Ser. B\u00a051(2), 271\u2013279 (1989)","journal-title":"J. Roy. Statist. Soc., Ser. B"},{"key":"26_CR19","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/BF02980577","volume":"23","author":"E. Ising","year":"1925","unstructured":"Ising, E.: Beitrag zur Theorie des Ferromagnetismus. Zeitschrift f\u00fcr Physik\u00a023, 253\u2013258 (1925)","journal-title":"Zeitschrift f\u00fcr Physik"},{"issue":"10","key":"26_CR20","doi-asserted-by":"publisher","first-page":"1075","DOI":"10.1109\/34.954599","volume":"23","author":"I.H. Jermyn","year":"2001","unstructured":"Jermyn, I.H., Ishikawa, H.: Globally optimal regions and boundaries as minimum ratio weight cycles. IEEE Trans. on Patt. Anal. and Mach. Intell.\u00a023(10), 1075\u20131088 (2001)","journal-title":"IEEE Trans. on Patt. Anal. and Mach. Intell."},{"issue":"4","key":"26_CR21","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/BF00133570","volume":"1","author":"M. Kass","year":"1988","unstructured":"Kass, M., Witkin, A., Terzopoulos, D.: Snakes: Active contour models. Int.\u00a0J.\u00a0of\u00a0Computer Vision\u00a01(4), 321\u2013331 (1988)","journal-title":"Int.\u00a0J.\u00a0of\u00a0Computer Vision"},{"key":"26_CR22","doi-asserted-by":"crossref","unstructured":"Kichenassamy, S., Kumar, A., Olver, P.J., Tannenbaum, A., Yezzi, A.J.: Gradient flows and geometric active contour models. In: IEEE Int. Conf. on Computer Vision, pp. 810\u2013815 (1995)","DOI":"10.1109\/ICCV.1995.466855"},{"key":"26_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1007\/978-3-540-74198-5_34","volume-title":"Energy Minimization Methods in Computer Vision and Pattern Recognition","author":"K. Kolev","year":"2007","unstructured":"Kolev, K., Klodt, M., Brox, T., Esedoglu, S., Cremers, D.: Continuous global optimization in multiview 3d reconstruction. In: Yuille, A.L., Zhu, S.-C., Cremers, D., Wang, Y. (eds.) EMMCVPR 2007. LNCS, vol.\u00a04679, pp. 441\u2013452. Springer, Heidelberg (2007)"},{"key":"26_CR24","doi-asserted-by":"crossref","unstructured":"Kolmogorov, V., Boykov, Y.: What metrics can be approximated by Geo Cuts or global optimization of length\/area and flux. In: IEEE Int. Conf. on Computer Vision, Beijing (2005)","DOI":"10.1109\/ICCV.2005.252"},{"key":"26_CR25","doi-asserted-by":"crossref","unstructured":"Kolmogorov, V., Boykov, Y., Rother, C.: Applications of parametric maxflow in vision. In: IEEE Int. Conf. on Computer Vision, Rio de Janeiro, Brasil (2007)","DOI":"10.1109\/ICCV.2007.4408910"},{"issue":"5","key":"26_CR26","first-page":"657","volume":"24","author":"V. Kolmogorov","year":"2004","unstructured":"Kolmogorov, V., Zabih, R.: What energy functions can be minimized via graph cuts?. IEEE Trans. on Patt. Anal. and Mach. Intell.\u00a024(5), 657\u2013673 (2004)","journal-title":"IEEE Trans. on Patt. Anal. and Mach. Intell."},{"key":"26_CR27","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1002\/cpa.3160420503","volume":"42","author":"D. Mumford","year":"1989","unstructured":"Mumford, D., Shah, J.: Optimal approximations by piecewise smooth functions and associated variational problems. Comm. Pure Appl. Math.\u00a042, 577\u2013685 (1989)","journal-title":"Comm. Pure Appl. Math."},{"issue":"3","key":"26_CR28","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1145\/1015706.1015720","volume":"23","author":"C. Rother","year":"2004","unstructured":"Rother, C., Kolmogorov, V., Blake, A.: GrabCut: interactive foreground extraction using iterated graph cuts. ACM Trans. Graph\u00a023(3), 309\u2013314 (2004)","journal-title":"ACM Trans. Graph"},{"issue":"8","key":"26_CR29","doi-asserted-by":"publisher","first-page":"888","DOI":"10.1109\/34.868688","volume":"22","author":"J. Shi","year":"2000","unstructured":"Shi, J., Malik, J.: Normalized cuts and image segmentation. IEEE Trans. on Patt. Anal. and Mach. Intell.\u00a022(8), 888\u2013905 (2000)","journal-title":"IEEE Trans. on Patt. Anal. and Mach. Intell."},{"issue":"2","key":"26_CR30","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. Mathematical Programming\u00a026(2), 123\u2013143 (1983)","journal-title":"Mathematical Programming"},{"key":"26_CR31","doi-asserted-by":"crossref","unstructured":"Vogiatzis, G., Torr, P., Cippola, R.: Multi-view stereo via volumetric graph-cuts. In: Int. Conf. on Computer Vision and Pattern Recognition, pp. 391\u2013399 (2005)","DOI":"10.1109\/CVPR.2005.238"}],"container-title":["Lecture Notes in Computer Science","Computer Vision \u2013 ECCV 2008"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-88682-2_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,1]],"date-time":"2025-02-01T18:16:00Z","timestamp":1738433760000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-88682-2_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540886815","9783540886822"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-88682-2_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}