666 search results - page 47 / 134 » Unbalanced Graph Cuts |
CVPR
2012
IEEE
12 years 14 days ago
2012
IEEE
We present a generic framework for object segmentation using depth maps based on Random Forest and Graph-cuts theory, and apply it to the segmentation of human limbs in depth maps...
CVPR
2012
IEEE
12 years 14 days ago
2012
IEEE
CVPR
1997
IEEE
14 years 2 months ago
1997
IEEE
ÐWe propose a novel approach for solving the perceptual grouping problem in vision. Rather than focusing on local features and their consistencies in the image data, our approach ...
DGCI
2008
Springer
13 years 12 months ago
2008
Springer
Abstract. We recently introduced the watershed cuts, a notion of watershed in edge-weighted graphs. In this paper, we propose a new thinning paradigm to compute them. More precisel...
CORR
2010
Springer
13 years 10 months ago
2010
Springer
Consider a routing problem instance consisting of a demand graph H = (V, E(H)) and a supply graph G = (V, E(G)). If the pair obeys the cut condition, then the flow-cut gap for thi...