English
 
User Manual Privacy Policy Disclaimer Contact us
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
  Submodularity beyond submodular energies: coupling edges in graph cuts

Jegelka, S., & Bilmes, J. (2011). Submodularity beyond submodular energies: coupling edges in graph cuts. In IEEE Conference on Computer Vision and Pattern Recognition (CVPR 2011) (pp. 1897-1904).

Item is

Basic

show hide
Item Permalink: http://hdl.handle.net/11858/00-001M-0000-0010-75C1-1 Version Permalink: http://hdl.handle.net/11858/00-001M-0000-0028-5E3F-F
Genre: Conference Paper

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Jegelka, S.1, Author              
Bilmes, J.1, Author              
Affiliations:
1Dept. Empirical Inference, Max Planck Institute for Intelligent Systems, Max Planck Society, ou_1497647              

Content

show
hide
Free keywords: MPI für Intelligente Systeme; Abt. Schölkopf;
 Abstract: We propose a new family of non-submodular global energy functions that still use submodularity internally to couple edges in a graph cut. We show it is possible to develop an efficient approximation algorithm that, thanks to the internal submodularity, can use standard graph cuts as a subroutine. We demonstrate the advantages of edge coupling in a natural setting, namely image segmentation. In particular, for finestructured objects and objects with shading variation, our structured edge coupling leads to significant improvements over standard approaches.

Details

show
hide
Language(s):
 Dates: 2011-06-01
 Publication Status: Published in print
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show
hide
Title: IEEE Conference on Computer Vision and Pattern Recognition (CVPR 2011)
Source Genre: Proceedings
 Creator(s):
Affiliations:
Publ. Info: -
Pages: 7 Volume / Issue: - Sequence Number: - Start / End Page: 1897 - 1904 Identifier: -