270 search results - page 29 / 54 » Graph Cuts and Efficient N-D Image Segmentation |
219
click to vote
ACCV
2010
Springer
14 years 11 months ago
2010
Springer
We present a method for optimizing the stereo matching process when it is applied to a series of images with similar depth structures. We observe that there are similar regions wit...
142
click to vote
ICCV
2009
IEEE
16 years 9 months ago
2009
IEEE
Markov Random Field is now ubiquitous in many formulations
of various vision problems. Recently, optimization
of higher-order potentials became practical using higherorder
graph...
115
click to vote
ICPR
2008
IEEE
16 years 5 months ago
2008
IEEE
Five image segmentation algorithms are evaluated: mean shift, normalised cuts, efficient graph-based segmentation, hierarchical watershed, and waterfall. The evaluation is done us...
135
click to vote
CVPR
2010
IEEE
16 years 15 days ago
2010
IEEE
Graph cuts have proven useful for image segmentation and for volumetric reconstruction in multiple view stereo. However, solutions are biased: the cost function tends to favour ei...
143
click to vote
MIAR
2010
IEEE
15 years 2 months ago
2010
IEEE
Abstract. This paper proposes a new method to compute connectivity information from diffusion weighted images. It is inspired by graphbased approaches to connectivity definition,...