Fast Approximate Energy Minimization via Graph Cuts
IEEE Transactions on Pattern Analysis and Machine Intelligence
A Taxonomy and Evaluation of Dense Two-Frame Stereo Correspondence Algorithms
International Journal of Computer Vision
Multi-camera Scene Reconstruction via Graph Cuts
ECCV '02 Proceedings of the 7th European Conference on Computer Vision-Part III
Prediction Error as a Quality Metric for Motion and Stereo
ICCV '99 Proceedings of the International Conference on Computer Vision-Volume 2 - Volume 2
Comparison of Graph Cuts with Belief Propagation for Stereo, using Identical MRF Parameters
ICCV '03 Proceedings of the Ninth IEEE International Conference on Computer Vision - Volume 2
What Energy Functions Can Be Minimizedvia Graph Cuts?
IEEE Transactions on Pattern Analysis and Machine Intelligence
Efficient Belief Propagation for Early Vision
International Journal of Computer Vision
Belief Propagation for Stereo Analysis of Night-Vision Sequences
PSIVT '09 Proceedings of the 3rd Pacific Rim Symposium on Advances in Image and Video Technology
Residual Images Remove Illumination Artifacts!
Proceedings of the 31st DAGM Symposium on Pattern Recognition
A Third Eye for Performance Evaluation in Stereo Sequence Analysis
CAIP '09 Proceedings of the 13th International Conference on Computer Analysis of Images and Patterns
Belief-propagation on edge images for stereo analysis of image sequences
RobVis'08 Proceedings of the 2nd international conference on Robot vision
Hi-index | 0.00 |
This paper deals with a comparison between the performance of graph cuts and belief propagation stereo matching algorithms over long real-world and synthetics sequences. The results following different preprocessing steps as well as the running times are investigated. The usage of long stereo sequences allows us to better understand the behavior of the algorithms and the preprocessing methods, as well as to have a more realistic evaluation of the algorithms in the context of a vision-based Driver Assistance System (DAS).