Semantic Scholar uses AI to extract papers important to this topic.
Combinatorial min-cut algorithms on graphs have emerged as an increaseingly useful tool for problems in vision. Typically, the… Expand Combinatorial graph cut algorithms have been successfully applied to a wide range of problems in vision and graphics. This paper… Expand The problem of efficient, interactive foreground/background segmentation in still images is of great practical importance in… Expand In the last few years, several new algorithms based on graph cuts have been developed to solve energy minimization problems in… Expand In this paper we introduce a new algorithm for image and video texture synthesis. In our approach, patch regions from a sample… Expand Many tasks in computer vision involve assigning a label (such as disparity) to every pixel. A common constraint is that the… Expand In this paper we describe a new technique for general purpose interactive segmentation of N-dimensional images . The user marks… Expand We propose a novel approach for solving the perceptual grouping problem in vision. Rather than focusing on local features and… Expand In this paper we address the problem of minimizing a large class of energy functions that occur in early vision. The major… Expand We propose a novel approach for solving the perceptual grouping problem in vision. Rather than focusing on local features and… Expand