302 search results - page 11 / 61 » Reducing graphs in graph cut segmentation |
172
Voted
IJCV
2006
14 years 11 months ago
2006
Combinatorial graph cut algorithms have been successfully applied to a wide range of problems in vision and graphics. This paper focusses on possibly the simplest application of gr...
90
Voted
CVPR
2004
IEEE
16 years 1 months ago
2004
IEEE
In this paper, we present a new segment-based stereo matching algorithm using graph cuts. In our approach, the reference image is divided into non-overlapping homogeneous segments...
116
Voted
MEMICS
2010
14 years 6 months ago
2010
In this paper, we propose a modification to the Boykov-Kolmogorov maximum flow algorithm [2] in order to make the algorithm preserve the topology of an initial interface. This alg...
118
Voted
CVPR
2007
IEEE
16 years 1 months ago
2007
IEEE
This paper proposes a novel method to apply the standard graph cut technique to segmenting multimodal tensor valued images. The Riemannian nature of the tensor space is explicitly...
MICCAI
2000
Springer
15 years 3 months ago
2000
Springer
Abstract. An N-dimensional image is divided into "object" and "background" segments using a graph cut approach. A graph is formed by connecting all pairs of nei...