Sciweavers

32 search results - page 1 / 7
» Stereo Correspondence by Dynamic Programming on a Tree
Sort
View
CVPR
2005
IEEE
14 years 8 months ago
Stereo Correspondence by Dynamic Programming on a Tree
Dynamic programming on a scanline is one of the oldest and still popular methods for stereo correspondence. While efficient, its performance is far from the state of the art becau...
Olga Veksler
ECCV
2006
Springer
14 years 8 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
ICCV
1998
IEEE
13 years 10 months ago
A Maximum-Flow Formulation of the N-Camera Stereo Correspondence Problem
This paper describes a new algorithm for solving the N-camera stereo correspondence problem by transforming it into a maximum- ow problem. Once solved, the minimum-cut associated ...
Sébastien Roy, Ingemar J. Cox
CSE
2009
IEEE
13 years 10 months ago
Real Time Rectification for Stereo Correspondence
Duplicating the full dynamic capabilities of the human eye-brain combination is a difficult task but an important goal because of the wide application that a system which can acqu...
Khurram Jawed, John Morris, Tariq Khan, Georgy L. ...