A Performance Study on Different Cost Aggregation Approaches Used in Real-Time Stereo Matching
International Journal of Computer Vision
Blur and Contrast Invariant Fast Stereo Matching
ACIVS '08 Proceedings of the 10th International Conference on Advanced Concepts for Intelligent Vision Systems
Mutual Information Based Semi-Global Stereo Matching on the GPU
ISVC '08 Proceedings of the 4th International Symposium on Advances in Visual Computing
On-line modeling for real-time 3D target tracking
Machine Vision and Applications
Stereo vision enabling precise border localization within a scanline optimization framework
ACCV'07 Proceedings of the 8th Asian conference on Computer vision - Volume Part II
Segmentation-based adaptive support for accurate stereo correspondence
PSIVT'07 Proceedings of the 2nd Pacific Rim conference on Advances in image and video technology
Statistical tuning of adaptive-weight depth map algorithm
CAIP'11 Proceedings of the 14th international conference on Computer analysis of images and patterns - Volume Part II
U-V disparity analysis in urban environments
EUROCAST'11 Proceedings of the 13th international conference on Computer Aided Systems Theory - Volume Part II
Tuning of Adaptive Weight Depth Map Generation Algorithms
Journal of Mathematical Imaging and Vision
Information permeability for stereo matching
Image Communication
| Hi-index | 0.01 |
Applications such as robot navigation and augmented reality require high-accuracy dense disparity maps in real-time and online. Due to time constraint, most real-time stereo applications rely on local winner-take-all optimization in the disparity computation process. These local approaches are generally outperformed by offline global optimization based algorithms. However, recent research shows that, through carefully selecting and aggregating the matching costs of neighboring pixels, the disparity maps produced by a local approach can be more accurate than those generated by many global optimization techniques. We are therefore motivated to investigate whether these cost aggregation approaches can be adopted in real-time stereo applications and, if so, how well they perform under the real-time constraint. The evaluation is conducted on a real-time stereo platform, which utilizes the processing power of programmable graphics hardware. Several recent cost aggregation approaches are also implemented and optimized for graphics hardware so that real-time speed can be achieved. The performances of these aggregation approaches in terms of both processing speed and result quality are reported.