138 search results - page 2 / 28 » Efficient Planar Graph Cuts with Applications in Computer Vi... |
CVPR
2005
IEEE
14 years 9 months ago
2005
IEEE
Occlusion is usually modelled in two images symmetrically in previous stereo algorithms which cannot work for multi-view stereo efficiently. In this paper, we present a novel form...
IJCV
2006
13 years 7 months ago
2006
Combinatorial graph cut algorithms have been successfully applied to a wide range of problems in vision and graphics. This paper focusses on possibly the simplest application of gr...
ICMCS
2007
IEEE
14 years 2 months ago
2007
IEEE
Segmentation of video objects from background is a popular computer vision problem and has many important applications. Most existing methods are either computationally expensive ...
CVPR
2010
IEEE
14 years 4 months ago
2010
IEEE
Graph cuts methods are at the core of many state-of-theart algorithms in computer vision due to their efficiency in computing globally optimal solutions. In this paper, we solve t...
ICPR
2008
IEEE
14 years 2 months ago
2008
IEEE
Graph cut algorithms (i.e., min s-t cuts) [3][10][15] are useful in many computer vision applications. In this paper we develop a formulation that allows the addition of side cons...