{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T17:52:30Z","timestamp":1775065950268,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642230936","type":"print"},{"value":"9783642230943","type":"electronic"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-23094-3_16","type":"book-chapter","created":{"date-parts":[[2011,7,23]],"date-time":"2011-07-23T15:06:23Z","timestamp":1311433583000},"page":"219-232","source":"Crossref","is-referenced-by-count":17,"title":["SlimCuts: GraphCuts for High Resolution Images Using Graph Reduction"],"prefix":"10.1007","author":[{"given":"Bj\u00f6rn","family":"Scheuermann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bodo","family":"Rosenhahn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"9","key":"16_CR1","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 Pattern Analysis and Machine Intelligence (TPAMI)\u00a026(9), 1124\u20131137 (2004)","journal-title":"IEEE Trans. on Pattern Analysis and Machine Intelligence (TPAMI)"},{"key":"16_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1007\/978-3-540-24670-1_33","volume-title":"Computer Vision - ECCV 2004","author":"A. Blake","year":"2004","unstructured":"Blake, A., Rother, C., Brown, M., Perez, P., Torr, P.: Interactive image segmentation using an adaptive GMMRF model. In: Pajdla, T., Matas, J(G.) (eds.) ECCV 2004. LNCS, vol.\u00a03021, pp. 428\u2013441. Springer, Heidelberg (2004)"},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"Boykov, Y., Kolmogorov, V.: Computing geodesics and minimal surfaces via graph cuts. In: Nineth IEEE Int. Conf. on Computer Vision (ICCV), pp. 26\u201333 (2003)","DOI":"10.1109\/ICCV.2003.1238310"},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"Lempitsky, V., Boykov, Y.: Global optimization for shape fitting. In: Comp. Vision and Pattern Recognition (CVPR), pp. 1\u20138 (2007)","DOI":"10.1109\/CVPR.2007.383293"},{"issue":"11","key":"16_CR5","doi-asserted-by":"publisher","first-page":"1222","DOI":"10.1109\/34.969114","volume":"23","author":"Y. Boykov","year":"2002","unstructured":"Boykov, Y., Veksler, O., Zabih, R.: Fast approximate energy minimization via graph cuts. IEEE Trans. on Pattern Analysis and Machine Intelligence (TPAMI)\u00a023(11), 1222\u20131239 (2002)","journal-title":"IEEE Trans. on Pattern Analysis and Machine Intelligence (TPAMI)"},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"Kohli, P., Torr, P.H.S.: Efficiently solving dynamic markov random fields using graph cuts. In: Tenth IEEE Int. Conf. on Computer Vision (ICCV), vol.\u00a02, pp. 922\u2013929 (2005)","DOI":"10.1109\/ICCV.2005.81"},{"issue":"3","key":"16_CR7","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. SIGGRAPH\u00a023(3), 309\u2013314 (2004)","journal-title":"SIGGRAPH"},{"key":"16_CR8","doi-asserted-by":"crossref","unstructured":"Delong, A., Boykov, Y.: A scalable graph-cut algorithm for n-d grids. In: Comp. Vision and Pattern Recognition, CVPR (2008)","DOI":"10.1109\/CVPR.2008.4587464"},{"key":"16_CR9","doi-asserted-by":"crossref","unstructured":"Boykov, Y., Jolly, M.P.: Interactive graph cuts for optimal boundary & region segmentation of objects in nd images. In: Eighth IEEE Int. Conf. on Computer Vision (ICCV), vol.\u00a01, pp. 105\u2013112 (2001)","DOI":"10.1109\/ICCV.2001.937505"},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"Strandmark, P., Kahl, F.: Parallel and distributed graph cuts by dual decomposition. In: Comp. Vision and Pattern Recognition, CVPR (2010)","DOI":"10.1109\/CVPR.2010.5539886"},{"key":"16_CR11","doi-asserted-by":"crossref","unstructured":"Vineet, V., Narayanan, P.: Cuda cuts: Fast graph cuts on the gpu. In: Comp. Vision and Pattern Recognition Workshops, CVPRW (2008)","DOI":"10.1109\/CVPRW.2008.4563095"},{"issue":"10","key":"16_CR12","doi-asserted-by":"publisher","first-page":"1866","DOI":"10.1109\/TPAMI.2008.82","volume":"30","author":"A. Bhusnurmath","year":"2008","unstructured":"Bhusnurmath, A., Taylor, C.J.: Graph cuts via l 1 norm minimization. IEEE Trans. on Pattern Analysis and Machine Intelligence (TPAMI)\u00a030(10), 1866\u20131871 (2008)","journal-title":"IEEE Trans. on Pattern Analysis and Machine Intelligence (TPAMI)"},{"key":"16_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1007\/978-3-540-88682-2_26","volume-title":"Computer Vision \u2013 ECCV 2008","author":"M. Klodt","year":"2008","unstructured":"Klodt, M., Schoenemann, T., Kolev, K., Schikora, M., Cremers, D.: An experimental comparison of discrete and continuous shape optimization methods. In: Forsyth, D., Torr, P., Zisserman, A. (eds.) ECCV 2008, Part I. LNCS, vol.\u00a05302, pp. 332\u2013345. Springer, Heidelberg (2008)"},{"key":"16_CR14","doi-asserted-by":"crossref","unstructured":"Puzicha, J., Buhmann, J.M.: Multiscale annealing for grouping and unsupervised texture segmentation. In: Comp. Vision and Image Understanding, vol.\u00a076(3), pp. 213\u2013230 (1999)","DOI":"10.1006\/cviu.1999.0805"},{"key":"16_CR15","doi-asserted-by":"crossref","unstructured":"Lombaert, H., Sun, Y., Grady, L., Xu, C.: A multilevel banded graph cuts method for fast image segmentation. In: Tenth IEEE Int. Conf. on Computer Vision (ICCV), vol.\u00a01, pp. 259\u2013265 (2005)","DOI":"10.1109\/ICCV.2005.13"},{"key":"16_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"896","DOI":"10.1007\/11866763_110","volume-title":"Medical Image Computing and Computer-Assisted Intervention \u2013 MICCAI 2006","author":"A.K. Sinop","year":"2006","unstructured":"Sinop, A.K., Grady, L.: Accurate banded graph cut segmentation of thin structures using laplacian pyramids. In: Larsen, R., Nielsen, M., Sporring, J. (eds.) MICCAI 2006. LNCS, vol.\u00a04191, pp. 896\u2013903. Springer, Heidelberg (2006)"},{"key":"16_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1007\/978-3-642-15986-2_25","volume-title":"Pattern Recognition","author":"P. Kohli","year":"2010","unstructured":"Kohli, P., Lempitsky, V., Rother, C.: Uncertainty driven multi-scale optimization. In: Goesele, M., Roth, S., Kuijper, A., Schiele, B., Schindler, K. (eds.) Pattern Recognition. LNCS, vol.\u00a06376, pp. 242\u2013251. Springer, Heidelberg (2010)"},{"issue":"4","key":"16_CR18","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1145\/234533.234534","volume":"43","author":"D.R. Karger","year":"1996","unstructured":"Karger, D.R., Stein, C.: A new approach to the minimum cut problem. Journal of the ACM (JACM)\u00a043(4), 601\u2013640 (1996)","journal-title":"Journal of the ACM (JACM)"},{"key":"16_CR19","doi-asserted-by":"crossref","unstructured":"Bencz\u00far, A.A., Karger, D.R.: Approximating s-t minimum cuts in \u00d5(n2) time. In: Proceedings of the Twenty-eighth Annual ACM Symposium on Theory of Computing. STOC 1996, pp. 47\u201355 (1996)","DOI":"10.1145\/237814.237827"},{"key":"16_CR20","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1145\/1007352.1007372","volume-title":"Proceedings of the Thirty-sixth Annual ACM Symposium on Theory of Computing STOC 2004","author":"D.A. Spielman","year":"2004","unstructured":"Spielman, D.A., Teng, S.H.: Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems. In: Proceedings of the Thirty-sixth Annual ACM Symposium on Theory of Computing STOC 2004, pp. 81\u201390. ACM, New York (2004)"},{"key":"16_CR21","first-page":"324","volume-title":"Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms SODA 1997","author":"C.S. Chekuri","year":"1997","unstructured":"Chekuri, C.S., Goldberg, A.V., Karger, D.R., Levine, M.S., Stein, C.: Experimental study of minimum cut algorithms. In: Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms SODA 1997, pp. 324\u2013333. SIAM, Philadelphia (1997)"},{"issue":"1","key":"16_CR22","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/BF01580850","volume":"47","author":"M. Padberg","year":"1990","unstructured":"Padberg, M., Rinaldi, G.: An efficient algorithm for the minimum capacity cut problem. Mathematical Programming\u00a047(1), 19\u201336 (1990)","journal-title":"Mathematical Programming"},{"issue":"4","key":"16_CR23","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1145\/544397.544408","volume":"28","author":"K. Hogstedt","year":"2001","unstructured":"Hogstedt, K., Kimelman, D., Rajan, V.T., Roth, T., Wegman, M.: Graph cutting algorithms for distributed applications partitioning. ACM SIGMETRICS Performance Evaluation Review\u00a028(4), 27\u201329 (2001)","journal-title":"ACM SIGMETRICS Performance Evaluation Review"},{"key":"16_CR24","doi-asserted-by":"publisher","first-page":"299","DOI":"10.4153\/CJM-1956-045-5","volume":"8","author":"L. Ford","year":"1956","unstructured":"Ford, L., Fulkerson, D.: Maximum flow through a network. Canadian J. of Math.\u00a08, 299\u2013404 (1956)","journal-title":"Canadian J. of Math."}],"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-642-23094-3_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,7]],"date-time":"2025-03-07T08:36:30Z","timestamp":1741336590000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23094-3_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642230936","9783642230943"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23094-3_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}