1115 search results - page 51 / 223 » Active Graph Cuts |
MFCS
2004
Springer
14 years 1 months ago
2004
Springer
Let G = (V, E) be a (directed) graph with vertex set V and edge (arc) set E. Given a set P of (source-sink) pairs of vertices of G, an important problem that arises in the computat...
CVPR
1998
IEEE
14 years 10 months ago
1998
IEEE
Markov Random Fields (MRF's) can be used for a wide variety of vision problems. In this paper we focus on MRF's with two-valued clique potentials, which form a generaliz...
CVPR
2010
IEEE
14 years 4 months ago
2010
IEEE
Graph cuts have proven useful for image segmentation and for volumetric reconstruction in multiple view stereo. However, solutions are biased: the cost function tends to favour ei...
ICVGIP
2004
13 years 9 months ago
2004
Automatic content based schemes, as opposed to those with human endeavor, have become important as users attempt to organize massive data presented in the form of multimedia data ...
SCALESPACE
2009
Springer
14 years 18 days ago
2009
Springer
We propose a semi-supervised image segmentation method that relies on a non-local continuous version of the min-cut algorithm and labels or seeds provided by a user. The segmentati...