{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,27]],"date-time":"2026-01-27T09:40:55Z","timestamp":1769506855020,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"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_3","type":"book-chapter","created":{"date-parts":[[2011,7,23]],"date-time":"2011-07-23T15:06:23Z","timestamp":1311433583000},"page":"31-44","source":"Crossref","is-referenced-by-count":48,"title":["Globally Optimal Image Partitioning by Multicuts"],"prefix":"10.1007","author":[{"given":"J\u00f6rg Hendrik","family":"Kappes","sequence":"first","affiliation":[]},{"given":"Markus","family":"Speth","sequence":"additional","affiliation":[]},{"given":"Bj\u00f6rn","family":"Andres","sequence":"additional","affiliation":[]},{"given":"Gerhard","family":"Reinelt","sequence":"additional","affiliation":[]},{"given":"Christoph","family":"Schn","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"3_CR1","unstructured":"Kleinberg, J., Tardos, \u00c9.: Approximation algorithms for classification problems with pairwise relationships: Metric labeling and Markov random fields. In: FOCS (1999)"},{"key":"3_CR2","first-page":"1","volume":"1","author":"M.J. Wainwright","year":"2008","unstructured":"Wainwright, M.J., Jordan, M.I.: Graphical models, exponential families, and variational inference. FTML\u00a01, 1\u2013305 (2008)","journal-title":"FTML"},{"key":"3_CR3","unstructured":"Sontag, D., Jaakkola, T.: New outer bounds on the marginal polytope. In: NIPS (2007)"},{"key":"3_CR4","doi-asserted-by":"publisher","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. TPAMI\u00a028, 1568\u20131583 (2006)","journal-title":"TPAMI"},{"key":"3_CR5","volume-title":"Applied Geometry and Discrete Mathematics: The Victor Klee Festschrift","author":"M. Deza","year":"1991","unstructured":"Deza, M., Gr\u00f6tschel, M., Laurent, M.: Complete descriptions of small multicut polytopes. In: Applied Geometry and Discrete Mathematics: The Victor Klee Festschrift. American Mathematical Society, Providence (1991)"},{"key":"3_CR6","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1002\/net.3230210106","volume":"21","author":"S. Chopra","year":"1991","unstructured":"Chopra, S., Rao, M.R.: On the multiway cut polyhedron. Networks\u00a021, 51\u201389 (1991)","journal-title":"Networks"},{"key":"3_CR7","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/BF01581239","volume":"59","author":"S. Chopra","year":"1993","unstructured":"Chopra, S., Rao, M.R.: The partition problem. Mathematical Programming\u00a059, 87\u2013115 (1993)","journal-title":"Mathematical Programming"},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"Boykov, Y., Veksler, O., Zabih, R.: Markov random fields with efficient approximations. In: CVPR (1998)","DOI":"10.1109\/CVPR.1998.698673"},{"key":"3_CR9","doi-asserted-by":"publisher","first-page":"147","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? TPAMI\u00a026, 147\u2013159 (2004)","journal-title":"TPAMI"},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"Dahlhaus, E., Johnson, D.S., Papadimitriou, C.H., Seymour, P.D., Yannakakis, M.: The complexity of multiway cuts (extended abstract). In: STOC (1992)","DOI":"10.1145\/129712.129736"},{"key":"3_CR11","unstructured":"Mori, G.: http:\/\/www.cs.sfu.ca\/~mori\/research\/superpixels\/"},{"key":"3_CR12","first-page":"564","volume":"60","author":"G. C\u0103linescu","year":"2000","unstructured":"C\u0103linescu, G., Karloff, H., Rabani, Y.: An improved approximation algorithm for multiway cut. JCSS\u00a060, 564\u2013574 (2000)","journal-title":"JCSS"},{"key":"3_CR13","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. TPAMI\u00a023, 1222\u20131239 (2001)","journal-title":"TPAMI"},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"Andres, B., Kappes, J.H., Beier, T., K\u00f6the, U., Hamprecht, F.: Probabilistic image segmentation with closedness constraints (submitted to ICCV 2011)","DOI":"10.1109\/ICCV.2011.6126550"},{"key":"3_CR15","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1979)"},{"key":"3_CR16","doi-asserted-by":"publisher","first-page":"1068","DOI":"10.1109\/TPAMI.2007.70844","volume":"30","author":"R. Szeliski","year":"2008","unstructured":"Szeliski, R., Zabih, R., Scharstein, D., Veksler, O., Kolmogorov, V., Agarwala, A., Tappen, M., Rother, C.: A comparative study of energy minimization methods for Markov random fields with smoothness-based priors. TPAMI\u00a030, 1068\u20131080 (2008)","journal-title":"TPAMI"},{"key":"3_CR17","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)"},{"key":"3_CR18","doi-asserted-by":"crossref","unstructured":"Martin, D., Fowlkes, C., Tal, D., Malik, J.: A database of human segmented natural images and its application to evaluating segmentation algorithms and measuring ecological statistics. In: ICCV (2001)","DOI":"10.1109\/ICCV.2001.937655"},{"key":"3_CR19","unstructured":"Arbel\u00e1ez, P.: Boundary extraction in natural images using ultrametric contour maps. In: CVPRW (2006)"},{"key":"3_CR20","doi-asserted-by":"crossref","unstructured":"Maire, M., Arbel\u00e1ez, P., Fowlkes, C., Malik, J.: Using contours to detect and localize junctions in natural images. In: CVPR (2008)","DOI":"10.1109\/CVPR.2008.4587420"},{"key":"3_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1007\/978-3-540-88690-7_40","volume-title":"Computer Vision \u2013 ECCV 2008","author":"X. Ren","year":"2008","unstructured":"Ren, X.: Multi-scale improves boundary detection in natural images. In: Forsyth, D., Torr, P., Zisserman, A. (eds.) ECCV 2008, Part III. LNCS, vol.\u00a05304, pp. 533\u2013545. Springer, Heidelberg (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-642-23094-3_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,13]],"date-time":"2019-06-13T07:31:50Z","timestamp":1560411110000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23094-3_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642230936","9783642230943"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23094-3_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}