Sciweavers

16 search results - page 1 / 4
» Fast Stereo Matching Using Reliability-Based Dynamic Program...
Sort
View
IJCV
2002
156views more  IJCV 2002»
13 years 4 months ago
Trinocular Stereo Using Shortest Paths and the Ordering Constraint
This paper describes a new algorithm for disparity estimation using trinocular stereo. The three cameras are placed in a right angled configuration. A graph is then constructed wh...
Motilal Agrawal
ECCV
2006
Springer
14 years 6 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
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
IJCV
2002
129views more  IJCV 2002»
13 years 4 months ago
A Hierarchical Symmetric Stereo Algorithm Using Dynamic Programming
In this paper, a new hierarchical stereo algorithm is presented. The algorithm matches individual pixels in corresponding scanlines by minimizing a cost function. Several cost fun...
G. Van Meerbergen, Maarten Vergauwen, Marc Pollefe...