While there has been substantial progress in segmenting natural im-
ages, state-of-the-art methods that perform well in such tasks unfortunately tend
to underperform ...
A. Lucchi, K. Smith, R. Achanta, V. Lepetit, P. Fu...
This paper adds a number of novel concepts into global s/t cut methods improving their efficiency and making them relevant for a wider class of applications in vision where algor...
Abstract. This paper presents an approach based on graph cuts initially used for motion segmentation that is being applied to the nonrigid registration problem. The main contributi...
We present a novel approach to image segmentation using iterated Graph Cuts based on multi-scale smoothing. We compute the prior probability obtained by the likelihood from a color...
Graph cuts based interactive segmentation has become very popular over the last decade. In standard graph cuts, the extraction of foreground object in a complex background often le...
We present a method to segment a collection of unlabeled images while exploiting automatically discovered appearance patterns shared between them. Given an unlabeled pool of multi...
Graph cuts methods are at the core of many state-of-theart algorithms in computer vision due to their efficiency in computing globally optimal solutions. In this paper, we solve t...
In this paper we introduce a new shape constraint for interactive image segmentation. It is an extension of Veksler's star-convexity prior, in two ways: from a single star to ...
Varun Gulshan, Carsten Rother, Antonio Criminisi, ...
Abstract. Graph Cuts have been shown as a powerful interactive segmentation technique in several medical domains. We propose to automate the Graph Cuts in order to automatically se...
Abstract. Being able to find the silhouette of an object is a very important front-end processing step for many high-level computer vision techniques, such as Shape-from-Silhouette...