Jeff A. Bilmes's Publications
• Sorted by Date • Classified by Publication Type • Classified by Research Category • Sorted by First Author Last Name • Classified by Author Last Name •
Graph cuts with interacting edge weights: examples, approximations, and algorithms
Stefanie Jegelka and Jeff Bilmes. Graph cuts with interacting edge weights: examples, approximations, and algorithms. Mathematical Programming, pp. 1–42, 2016.
Download
[PDF] [gzipped postscript] [postscript] [HTML]
Abstract
We study an extension of the classical graph cut problem, wherein we replace the modular (sum of edge weights) cost function by a submodular set function defined over graph edges. Special cases of this problem have appeared in different applications in signal processing, machine learning, and computer vision. In this paper, we connect these applications via the generic formulation of cooperative graph cuts, for which we study complexity, algorithms, and connections to polymatroidal network flows. Finally, we compare the proposed algorithms empirically.
BibTeX
@Article{jegelka-coop-cut-journal-2016, author = "Stefanie Jegelka and Jeff Bilmes", title="Graph cuts with interacting edge weights: examples, approximations, and algorithms", journal="Mathematical Programming", year="2016", pages="1--42", abstract="We study an extension of the classical graph cut problem, wherein we replace the modular (sum of edge weights) cost function by a submodular set function defined over graph edges. Special cases of this problem have appeared in different applications in signal processing, machine learning, and computer vision. In this paper, we connect these applications via the generic formulation of ``cooperative graph cuts'', for which we study complexity, algorithms, and connections to polymatroidal network flows. Finally, we compare the proposed algorithms empirically.", issn="1436-4646", doi="10.1007/s10107-016-1038-y", url="http://dx.doi.org/10.1007/s10107-016-1038-y", }
Share
Generated by bib2html.pl (written by Patrick Riley ) on Mon Oct 14, 2024 00:38:45