13 search results - page 1 / 3 » Capacity Scaling for Graph Cuts in Vision |
ICCV
2007
IEEE
14 years 11 months ago
2007
IEEE
Capacity scaling is a hierarchical approach to graph representation that can improve theoretical complexity and practical efficiency of max-flow/min-cut algorithms. Introduced by ...
ICCV
2007
IEEE
14 years 11 months ago
2007
IEEE
We present a novel method to reconstruct the 3D shape of a scene from several calibrated images. Our motivation is that most existing multi-view stereovision approaches require so...
ICIP
2010
IEEE
13 years 7 months ago
2010
IEEE
In few years, graph cuts have become a leading method for solving a wide range of problems in computer vision. However, graph cuts involve the construction of huge graphs which so...
ICPR
2008
IEEE
14 years 10 months ago
2008
IEEE
In this paper, we propose a method of object recognition and segmentation using Scale-Invariant Feature Transform (SIFT) and Graph Cuts. SIFT feature is invariant for rotations, s...
ICCV
2007
IEEE
14 years 11 months ago
2007
IEEE
The standard graph cut technique is a robust method for globally optimal image segmentations. However, because of its global nature, it is prone to capture outlying areas similar ...