270 search results - page 8 / 54 » Graph Cuts and Efficient N-D Image Segmentation |
ICIP
2009
IEEE
15 years 10 months ago
2009
IEEE
We propose a fully automated variation of the GrabCut technique for segmenting comparatively simple images with little variation in background colour and relatively high contrast ...
ICCV
2007
IEEE
15 years 11 months ago
2007
IEEE
Markov Random Fields (MRFs) are ubiquitous in lowlevel computer vision. In this paper, we propose a new approach to the optimization of multi-labeled MRFs. Similarly to -expansion...
DAGM
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. Applying real-time segmentation is a major issue when processing every frame of image sequences. In this paper, we propose a modification of the well known graph-cut algo...
ICCV
2007
IEEE
15 years 11 months ago
2007
IEEE
In this work, we present a common framework for seeded image segmentation algorithms that yields two of the leading methods as special cases - The Graph Cuts and the Random Walker...
83
Voted
ICIP
2010
IEEE
14 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...