English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

Multi-label cooperative cuts

MPS-Authors
/persons/resource/persons83994

Jegelka,  S.
Dept. Empirical Inference, Max Planck Institute for Intelligent Systems, Max Planck Society;

/persons/resource/persons75286

Bilmes,  J.
Dept. Empirical Inference, Max Planck Institute for Intelligent Systems, Max Planck Society;

External Resource
No external resources are shared
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Jegelka, S., & Bilmes, J. (2011). Multi-label cooperative cuts. In CVPR 2011 Workshop on Inference in Graphical Models with Structured Potentials (pp. 1-4).


Cite as: http://hdl.handle.net/11858/00-001M-0000-0010-75BF-9
Abstract
Recently, a family of global, non-submodular energy functions has been proposed that is expressed as coupling edges in a graph cut. This formulation provides a rich modelling framework and also leads to efficient approximate inference algorithms. So far, the results addressed binary random variables. Here, we extend these results to the multi-label case, and combine edge coupling with move-making algorithms.