666 search results - page 81 / 134 » Unbalanced Graph Cuts |
CORR
2010
Springer
13 years 10 months ago
2010
Springer
We introduce a new approach to computing an approximately maximum s-t flow in a capacitated, undirected graph. This flow is computed by solving a sequence of electrical flow probl...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
We present an approximation scheme for optimizing certain Quadratic Integer Programming problems with positive semidefinite objective functions and global linear constraints. Thi...
SMI
2006
IEEE
14 years 4 months ago
2006
IEEE
We present a novel approach for discretely optimizing contours on the surface of a triangle mesh. This is achieved through the use of a minimum ratio cycle (MRC) algorithm, where ...
EVOW
2005
Springer
14 years 3 months ago
2005
Springer
This paper proposes a new evolutionary region merging method to improve segmentation quality result on oversegmented images. The initial segmented image is described by a modified ...
SIAMCOMP
1998
13 years 10 months ago
1998
This paper introduces a near-linear time sequential algorithm for constructing a sparse neighborhood cover. This implies analogous improvements (from quadratic to near-linear time)...