Sciweavers

51 search results - page 3 / 11
» A Hierarchical Symmetric Stereo Algorithm Using Dynamic Prog...
Sort
View
CVPR
2005
IEEE
14 years 7 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
IJCV
2002
156views more  IJCV 2002»
13 years 5 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
ICCV
1998
IEEE
13 years 9 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
CVPR
2005
IEEE
14 years 7 months ago
Bi-Layer Segmentation of Binocular Stereo Video
This paper describes two algorithms capable of real-time segmentation of foreground from background layers in stereo video sequences. Automatic separation of layers from colour/co...
Vladimir Kolmogorov, Antonio Criminisi, Andrew Bla...
CVPR
2006
IEEE
14 years 7 months ago
Improving Border Localization of Multi-Baseline Stereo Using Border-Cut
This paper presents a novel algorithm that improves the localization of disparity discontinuities of disparity maps obtained by multi-baseline stereo. Rather than associating a di...
Marc-Antoine Drouin, Martin Trudeau, Sébast...