241 search results - page 24 / 49 » Geodesic Graph Cut for Interactive Image Segmentation |
DAGM
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. Autonomous collision avoidance in vehicles requires an accurate seperation of obstacles from the background, particularly near the focus of expansion. In this paper, we p...
109
click to vote
ICCV
2003
IEEE
16 years 1 months ago
2003
IEEE
Vision tasks, such as segmentation, grouping, recognition, can be formulated as graph partition problems. The recent literature witnessed two popular graph cut algorithms: the Ncu...
103
click to vote
DAGM
2009
Springer
15 years 27 days ago
2009
Springer
Abstract. Graph cuts have become very popular in many areas of computer vision including segmentation, energy minimization, and 3D reconstruction. Their ability to find optimal res...
123
click to vote
HISB
2011
13 years 11 months ago
2011
— This paper presents a new cellular automata-based unsupervised image segmentation technique that is motivated by the interactive grow-cut algorithm. In contrast to the traditio...
100
click to vote
ECCV
2008
Springer
16 years 1 months ago
2008
Springer
This paper shows how computational Riemannian manifold can be used to solve several problems in computer vision and graphics. Indeed, Voronoi segmentations and Delaunay graphs comp...