302 search results - page 24 / 61 » Reducing graphs in graph cut segmentation |
115
click to vote
SCALESPACE
2009
Springer
15 years 4 months ago
2009
Springer
We propose a semi-supervised image segmentation method that relies on a non-local continuous version of the min-cut algorithm and labels or seeds provided by a user. The segmentati...
ICPR
2008
IEEE
15 years 6 months ago
2008
IEEE
This paper proposes an automatic foreground segmentation system based on Gaussian mixture models and dynamic graph cut algorithm. An adaptive perpixel background model is develope...
CVPR
2010
IEEE
15 years 7 months ago
2010
IEEE
We consider pixel labeling problems where the label set
forms a tree, and where the observations are also labels.
Such problems arise in feature-space analysis with a very
large...
105
click to vote
SIBGRAPI
2006
IEEE
15 years 5 months ago
2006
IEEE
This paper addresses the problem of foreground extraction using active illumination and graph-cut optimization. Our approach starts by detecting image regions that are likely to b...
102
click to vote
PAMI
2010
14 years 10 months ago
2010
— In the last decade, graph-cut optimization has been popular for a variety of labeling problems. Typically graph-cut methods are used to incorporate smoothness constraints on a ...