270 search results - page 15 / 54 » Graph Cuts and Efficient N-D Image Segmentation |
DAGM
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. We propose to tackle the optical flow problem by a combination of two recent advances in the computation of dense correspondences, namely the incorporation of image segme...
ICIP
2010
IEEE
13 years 5 months ago
2010
IEEE
A novel interactive segmentation framework comprising of a two stage s-t mincut is proposed. The framework has been designed keeping in mind the need to segment touching neuronal ...
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...
ICIAR
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. This paper presents an approach based on graph cuts initially used for motion segmentation that is being applied to the nonrigid registration problem. The main contributi...
3DPVT
2006
IEEE
14 years 1 months ago
2006
IEEE
In this paper we propose a novel framework for efficiently extracting foreground objects in so called shortbaseline image sequences. We apply the obtained segmentation to improve...