Globally optimal image partitioning by multicuts

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6819 LNCS, Issue , 2011, Pages 31-44

  Kappes, Jörg Hendrik ^a   Speth, Markus ^a   Andres, Björn ^a   Reinelt, Gerhard ^a   Schnörr, Christoph ^a  

^a UNIVERSITY OF HEIDELBERG   (Germany)

Author keywords

cutting planes; image segmentation; integer programming; labeling; multicut polytope; multicuts; multiway cuts; partitioning

Indexed keywords

CUTTING PLANES; DATA SETS; IMAGE LABELING; IMAGE PARTITIONING; LABELING METHODS; MULTICUTS; MULTIWAY CUT; OPTIMAL IMAGES; OPTIMAL SOLUTIONS; OPTIMALITY; PARTITIONING; PERFORMANCE MEASURE; RUNTIMES;

COMPUTER VISION; INTEGER PROGRAMMING; OPTIMIZATION;

IMAGE SEGMENTATION;

EID: 80051777144     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-23094-3_3     Document Type: Conference Paper

References (21)

1. Kleinberg, J., Tardos, É Approximation algorithms for classification problems with pairwise relationships: Metric labeling and Markov random fields. In: FOCS (1999)
2. Wainwright, M.J., Jordan, M.I.: Graphical models, exponential families, and variational inference. FTML 1, 1-305 (2008)
3. Sontag, D., Jaakkola, T.: New outer bounds on the marginal polytope. In: NIPS (2007)
4. Kolmogorov, V.: Convergent tree-reweighted message passing for energy minimization. TPAMI 28, 1568-1583 (2006) (Pubitemid 46405078)
5. Deza, M., Grötschel, M., Laurent, M.: Complete descriptions of small multicut polytopes. In: Applied Geometry and Discrete Mathematics: The Victor Klee Festschrift. American Mathematical Society, Providence (1991)
6. Chopra, S., Rao, M.R.: On the multiway cut polyhedron. Networks 21, 51-89 (1991)
7. Chopra, S., Rao, M.R.: The partition problem. Mathematical Programming 59, 87-115 (1993)
8. Boykov, Y., Veksler, O., Zabih, R.: Markov random fields with efficient approximations. In: CVPR (1998)
9. Kolmogorov, V., Zabih, R.: What energy functions can be minimized via graph cuts? TPAMI 26, 147-159 (2004)
10. Dahlhaus, E., Johnson, D.S., Papadimitriou, C.H., Seymour, P.D., Yannakakis, M.: The complexity of multiway cuts (extended abstract). In: STOC (1992)
11. Mori, G.: http://www.cs.sfu.ca/~mori/research/superpixels/
12. Cǎlinescu, G., Karloff, H., Rabani, Y.: An improved approximation algorithm for multiway cut. JCSS 60, 564-574 (2000)
13. Boykov, Y., Veksler, O., Zabih, R.: Fast approximate energy minimization via graph cuts. TPAMI 23, 1222-1239 (2001) (Pubitemid 33137959)
14. Andres, B., Kappes, J.H., Beier, T., Köthe, U., Hamprecht, F.: Probabilistic image segmentation with closedness constraints (submitted to ICCV 2011)
15. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1979)
16. 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 30, 1068-1080 (2008) (Pubitemid 351650109)
17. Lellmann, J., Kappes, J., Yuan, J., Becker, F., Schnörr, C.: Convex multi-class image labeling by simplex-constrained total variation. In: Tai, X.-C., Mørken, K., Lysaker, M., Lie, K.-A. (eds.) SSVM 2009. LNCS, vol. 5567, pp. 150-162. Springer, Heidelberg (2009)
18. 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)
19. Arbeléez, P.: Boundary extraction in natural images using ultrametric contour maps. In: CVPRW (2006)
20. Maire, M., Arbeléez, P., Fowlkes, C., Malik, J.: Using contours to detect and localize junctions in natural images. In: CVPR (2008)
21. Ren, X.: Multi-scale improves boundary detection in natural images. In: Forsyth, D., Torr, P., Zisserman, A. (eds.) ECCV 2008, Part III. LNCS, vol. 5304, pp. 533-545. Springer, Heidelberg (2008)