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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1956-2017
010020030019562016

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2007
Highly Cited
2007
A new framework is presented for both understanding and developing graph-cut-based combinatorial algorithms suitable for the… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
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… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2005
Highly Cited
2005
In the short time since publication of Boykov and Jolly's seminal paper [2001], graph cuts have become well established as a… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2005
Highly Cited
2005
The recent explosion of interest in graph cut methods in computer vision naturally spawns the question: what energy functions can… (More)
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… (More)
  • figure 2
  • figure 3
  • figure 5
  • figure 4
  • figure 6
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Geodesic active contours and graph cuts are two standard image segmentation techniques. We introduce a new segmentation method… (More)
  • figure 3
  • figure 1
  • figure 2
  • figure 4
  • figure 6
Is this relevant?
Highly Cited
2003
Highly Cited
2003
In this paper we present a graph cuts based active contours (GCBAC) approach to object segmentation. GCBAC approach is a… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2002
Highly Cited
2002
In the last few years, several new algorithms based on graph cuts have been developed to solve energy minimization problems in… (More)
  • figure 1
  • figure 2
  • table 3
  • table 6
  • figure 3
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… (More)
  • figure 2
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
1997
Highly Cited
1997
w e propose Q novel approach for solving the perceptual grouping problem in vision. Rather than focusing on local features and… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?