1115 search results - page 49 / 223 » Active Graph Cuts |
STOC
2009
ACM
14 years 8 months ago
2009
ACM
We describe the first algorithm to compute maximum flows in surface-embedded graphs in near-linear time. Specifically, given a graph embedded on a surface of genus g, with two spe...
ISAAC
2004
Springer
14 years 1 months ago
2004
Springer
We consider two multicriteria versions of the global minimum cut problem in undirected graphs. In the k-criteria setting, each edge of the input graph has k non-negative costs ass...
ECCV
2010
Springer
14 years 1 months ago
2010
Springer
Abstract. Image segmentation techniques typically require proper weighting of competing data fidelity and regularization terms. Conventionally, the associated parameters are set t...
CRV
2008
IEEE
14 years 2 months ago
2008
IEEE
In this paper, we propose a novel method for the automatic segmentation of a foreground layer from a natural scene in real time by fusing infrared, color and edge information. Thi...
FOCS
2006
IEEE
14 years 2 months ago
2006
IEEE
A local graph partitioning algorithm finds a cut near a specified starting vertex, with a running time that depends largely on the size of the small side of the cut, rather than...