A new framework is presented for both understanding and developing graph-cut based combinatorial algorithms suitable for the approximate optimization of a very wide class of MRFs ...
— In the last decade, graph-cut optimization has been popular for a variety of labeling problems. Typically graph-cut methods are used to incorporate smoothness constraints on a ...
In this paper, we present a graph-based image segmentation method (patch-cuts) that incorporates features and spatial relations obtained from image patches. In the first step, pat...
Gerd Brunner, Deepak Roy Chittajallu, Uday Kurkure...