Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Cut (graph theory)

Known as: Cutset, Sparsest cut problem, Cut 
In graph theory, a cut is a partition of the vertices of a graph into two disjoint subsets. Any cut determines a cut-set, the set of edges that have… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2006
Highly Cited
2006
Combinatorial graph cut algorithms have been successfully applied to a wide range of problems in vision and graphics. This paper… Expand
  • figure 1
Is this relevant?
Highly Cited
2004
Highly Cited
2004
In the last few years, several new algorithms based on graph cuts have been developed to solve energy minimization problems in… Expand
Is this relevant?
Highly Cited
2004
Highly Cited
2004
The problem of efficient, interactive foreground/background segmentation in still images is of great practical importance in… Expand
  • figure 2
  • figure 5
  • figure 3
  • figure 4
  • figure 6
Is this relevant?
Highly Cited
2004
Highly Cited
2004
The problem of efficient, interactive foreground/background segmentation in still images is of great practical importance in… Expand
Is this relevant?
Highly Cited
2003
Highly Cited
2003
In this paper we introduce a new algorithm for image and video texture synthesis. In our approach, patch regions from a sample… Expand
  • figure 1
  • figure 3
  • figure 2
  • figure 5
  • figure 4
Is this relevant?
Highly Cited
2001
Highly Cited
2001
Many tasks in computer vision involve assigning a label (such as disparity) to every pixel. A common constraint is that the… Expand
Is this relevant?
Highly Cited
2001
Highly Cited
2001
Several new algorithms for visual correspondence based on graph cuts have recently been developed. While these methods give very… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2001
Highly Cited
2001
In this paper we describe a new technique for general purpose interactive segmentation of N-dimensional images. The user marks… Expand
  • figure 1
  • figure 3
  • figure 2
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2000
Highly Cited
2000
We propose a novel approach for solving the perceptual grouping problem in vision. Rather than focusing on local features and… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1999
Highly Cited
1999
In this paper we address the problem of minimizing a large class of energy functions that occur in early vision. The major… Expand
  • figure 2
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?