1133 search results - page 54 / 227 » Basics of Graph Cuts |
CVPR
2010
IEEE
14 years 5 months ago
2010
IEEE
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...
CVPR
2009
IEEE
15 years 4 months ago
2009
IEEE
In this paper, we present a new framework of video object
segmentation, in which we formulate the task of extracting
prominent objects from a scene as the problem of hypergraph
...
CVPR
2005
IEEE
14 years 11 months ago
2005
IEEE
We optimize over the set of corrected laplacians (CL) associated with a weighted graph to improve the average case normalized cut (NCut) of a graph. Unlike edge-relaxation SDPs, o...
SIMVIS
2004
13 years 10 months ago
2004
We describe methods for the specification and modification of virtual resections in medical volume data. These techniques are focused on applications in therapy planning, but are a...
MFCS
2004
Springer
14 years 2 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...