1115 search results - page 22 / 223 » Active Graph Cuts |
MEMICS
2010
13 years 2 months ago
2010
In this paper, we propose a modification to the Boykov-Kolmogorov maximum flow algorithm [2] in order to make the algorithm preserve the topology of an initial interface. This alg...
ICCV
2005
IEEE
14 years 10 months ago
2005
IEEE
A new framework is presented that uses tools from duality theory of linear programming to derive graph-cut based combinatorial algorithms for approximating NP-hard classification ...
IJISTA
2008
13 years 8 months ago
2008
: Planar patch detection aims at simplifying data from 3-D imaging sensors to a more compact scene description. We propose a fusion of intensity and depth information using Graph-C...
ICCV
2005
IEEE
14 years 10 months ago
2005
IEEE
The goal of deconvolution is to recover an image x from its convolution with a known blurring function. This is equivalent to inverting the linear system y = Hx. In this paper we ...
CVPR
2008
IEEE
14 years 10 months ago
2008
IEEE
We present a new shape prior segmentation method using graph cuts capable of segmenting multiple objects. The shape prior energy is based on a shape distance popular with level se...