98 search results - page 1 / 20 » Segment-Based Stereo Matching Using Graph Cuts |
CVPR
2004
IEEE
15 years 26 days 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...
MVA
1998
14 years 6 days ago
1998
An efficient matching method for segment-based stereo vision is proposed. A potential matching graph which describes the connectivity between candidate matching pairs of segments ...
DAGM
2006
Springer
14 years 2 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...
ACCV
2006
Springer
14 years 4 months ago
2006
Springer
In this paper, we propose a new stereo matching algorithm using an iterated graph cuts and mean shift filtering technique. Our algorithm consists of following two steps. In the ...
CVPR
2005
IEEE
15 years 26 days ago
2005
IEEE
We present a surprisingly simple system that allows for robust normal reconstruction by dense photometric stereo, in the presence of severe shadows, highlight, transparencies, com...