Sciweavers

38 search results - page 1 / 8
» An Efficient Matching Algorithm for Segment-Based Stereo Vis...
Sort
View
MVA
1998
230views Computer Vision» more  MVA 1998»
13 years 6 months ago
An Efficient Matching Algorithm for Segment-Based Stereo Vision Using Dynamic Programming Technique
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 ...
Toshio Ueshiba, Yoshihiro Kawai, Yasushi Sumi, Fum...
ECCV
2006
Springer
14 years 7 months ago
A Fast Line Segment Based Dense Stereo Algorithm Using Tree Dynamic Programming
Many traditional stereo correspondence methods emphasized on utilizing epipolar constraint and ignored the information embedded in inter-epipolar lines. Actually some researchers h...
Yi Deng, Xueyin Lin
CVPR
2004
IEEE
14 years 7 months ago
Segment-Based Stereo Matching Using Graph Cuts
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...
Li Hong, George Chen
ICPR
2006
IEEE
13 years 11 months ago
Segment-Based Stereo Matching Using Belief Propagation and a Self-Adapting Dissimilarity Measure
A novel stereo matching algorithm is proposed that utilizes color segmentation on the reference image and a selfadapting matching score that maximizes the number of reliable corre...
Andreas Klaus, Mario Sormann, Konrad F. Karner
IJCV
2002
256views more  IJCV 2002»
13 years 4 months ago
Fast Stereo Matching Using Rectangular Subregioning and 3D Maximum-Surface Techniques
This paper presents a fast and reliable stereo matching algorithm which produces a dense disparity map by using fast cross correlation, rectangular subregioning (RSR) and 3D maxim...
Changming Sun