78 search results - page 3 / 16 » Better Foreground Segmentation Through Graph Cuts |
ICIAR
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. Graph cut minimization formulates the segmentation problem as the liner combination of data and smoothness terms. The smoothness term is included in the energy formulatio...
ECCV
2006
Springer
14 years 9 months ago
2006
Springer
Abstract. We present a novel algorithm for performing integrated segmentation and 3D pose estimation of a human body from multiple views. Unlike other related state of the art tech...
ICPR
2008
IEEE
14 years 1 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...
ICPR
2008
IEEE
14 years 8 months ago
2008
IEEE
We present a simple but efficient model for object segmentation in video scenes that integrates motion and color information in a joint probabilistic framework. Optical flow is mo...
VLSM
2005
Springer
14 years 28 days ago
2005
Springer
Abstract. Given an image, digital matting consists in extracting a foreground element from the background. Standard methods are initialized with a trimap, a partition of the image ...