Skip to main content
SpringerLink
Log in
Book cover

International Workshop on New Frontiers in Mining Complex Patterns

NFMCP 2014: New Frontiers in Mining Complex Patterns pp 56–68Cite as

Parallel Multicut Segmentation via Dual Decomposition

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 8983))

Abstract

We propose a new outer relaxation of the multicut polytope, along with a dual decomposition approach for correlation clustering and multicut segmentation, for general graphs. Each subproblem is a minimum \(st\)-cut problem and can thus be solved efficiently. An optimal reparameterization is found using subgradients and affords a new characterization of the basic LP relaxation of the multicut problem, as well as informed decoding heuristics. The algorithm we propose for solving the problem distributes the computation and is amenable to a parallel implementation.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Andres, B., Kappes, J.H., Beier, T., Köthe, U., Hamprecht, F.A.: Probabilistic image segmentation with closedness constraints. In: ICCV (2011)

    Google Scholar 

  2. Andres, B., Yarkony, J., Manjunath, B.S., Kirchhoff, S., Turetken, E., Fowlkes, C.C., Pfister, H.: Segmenting planar superpixel adjacency graphs w.r.t. non-planar superpixel affinity graphs. In: Heyden, A., Kahl, F., Olsson, C., Oskarsson, M., Tai, X.-C. (eds.) EMMCVPR 2013. LNCS, vol. 8081, pp. 266–279. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  3. Arbelaez, P., Maire, M., Fowlkes, C., Malik, J.: Contour detection and hierarchical image segmentation. TPAMI 33(5), 898–916 (2011)

    Article  Google Scholar 

  4. Barahona, F., Mahjoub, A.: On the cut polytope. Math. Program. 36(2), 157–173 (1986)

    Article  MATH  MathSciNet  Google Scholar 

  5. Chopra, S., Rao, M.R.: The partition problem. Math. Program. 59, 87–115 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  6. Deza, M.M., Grotschel, M., Laurent, M.: Complete descriptions of small multicut polytopes. In: Gritzmann, P., Sturmfels, B. (eds.) Applied Geometry and Discrete Mathematics, The Victor Klee Festschrift, vol. 4 (1991)

    Google Scholar 

  7. Deza, M.M., Laurent, M.: Geometry of Cuts and Metrics. Springer, New York (1997)

    Book  MATH  Google Scholar 

  8. Dahlhaus, E., Johnson, D.S., Papadimitriou, C.H., Seymour, P.D., Yannakakis, M.: The complexity of multiterminal cuts. SIAM J. Comput. 23, 864–894 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  9. Franc, V., Sonnenburg, S., Werner, T.: Cutting-plane methods in machine learning. In: Sra, S., Nowozin, S., Wright, S.J. (eds.) Optimization for Machine Learning, Chap. 7, pp. 185–218. MIT Press, Cambridge (2012)

    Google Scholar 

  10. Kohli, P., Torr, P.H.S.: Dynamic graph cuts for efficient inference in markov random fields. TPAMI 29(12), 2079–2088 (2007)

    Article  Google Scholar 

  11. Kolmogorov, V., Wainwright, M.J.: On the optimality of tree-reweighted max-product message-passing. CoRR abs/1207.1395 (2005)

    Google Scholar 

  12. Komodakis, N., Paragios, N., Tziritas, G.: MRF energy minimization and beyond via dual decomposition. TPAMI 33(3), 531–552 (2011)

    Article  Google Scholar 

  13. Laurent, M.: A comparison of the Sherali-Adams, Lovasz-Schrijver and Lasserre relaxations for 0–1 programming. Math. Oper. Res. 28, 470–496 (2001)

    Article  MathSciNet  Google Scholar 

  14. Martin, D., Fowlkes, C.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, pp. 416–423 (2001)

    Google Scholar 

  15. Rother, C., Kolmogorov, V., Lempitsky, V., Szummer, M.: Optimizing binary MRFs via extended roof duality. In: CVPR, pp. 1–8, June 2007

    Google Scholar 

  16. Sontag, D., Globerson, A., Jaakola, T.: Introduction to dual decomposition for inference (2010)

    Google Scholar 

  17. Sontag, D., Meltzer, T., Globerson, A., Jaakkola, T., Weiss, Y.: Tightening LP relaxations for MAP using message passing. In: UAI, pp. 503–510 (2008)

    Google Scholar 

  18. Yarkony, J., Ihler, A., Fowlkes, C.C.: Fast planar correlation clustering for image segmentation. In: Fitzgibbon, A., Lazebnik, S., Perona, P., Sato, Y., Schmid, C. (eds.) ECCV 2012, Part VI. LNCS, vol. 7577, pp. 568–581. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Heidelberg Collaboratory for Image Processing (HCI), University of Heidelberg, Heidelberg, Germany

    Julian Yarkony, Thorsten Beier & Fred A. Hamprecht

  2. Department of Computer Science, University of California, Irvine, Irvine, CA, USA

    Julian Yarkony & Pierre Baldi

Authors
  1. Julian Yarkony
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Thorsten Beier
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Pierre Baldi
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Fred A. Hamprecht
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Julian Yarkony .

Editor information

Editors and Affiliations

  1. Università degli Studi di Bari Aldo Moro, Bari, Italy

    Annalisa Appice

  2. Università degli Studi di Bari Aldo Moro, Bari, Italy

    Michelangelo Ceci

  3. Università degli Studi di Bari Aldo Moro, Bari, Italy

    Corrado Loglisci

  4. ICAR-CNR, Rende, Italy

    Giuseppe Manco

  5. ICAR-CNR, Rende, Italy

    Elio Masciari

  6. University of North Carolina, Charlotte, USA and Warsaw University of Technology, Warsaw, Poland

    Zbigniew W. Ras

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Yarkony, J., Beier, T., Baldi, P., Hamprecht, F.A. (2015). Parallel Multicut Segmentation via Dual Decomposition. In: Appice, A., Ceci, M., Loglisci, C., Manco, G., Masciari, E., Ras, Z. (eds) New Frontiers in Mining Complex Patterns. NFMCP 2014. Lecture Notes in Computer Science(), vol 8983. Springer, Cham. https://doi.org/10.1007/978-3-319-17876-9_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-17876-9_4

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-17875-2

  • Online ISBN: 978-3-319-17876-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation