ML Anthology

Region-Based Progressive Stereo Matching

Yichen Wei, Long Quan
CVPR 2004 pp. 106-113
doi:10.1109/CVPR.2004.207 /cvpr/2004/wei2004cvpr-region/

Abstract

A novel region-based progressive stereo matching algorithm is presented. It combines the strengths of previous region-based and progressive approaches. The progressive framework avoids the time consuming global optimization, while the inherent problem, the sensitivity to early wrong decisions, is significantly alleviated via the region-based representation. A growing-like process matches the regions progressively using a global best-first strategy based on a cost function integrating disparity smoothness and visibility constraint. The performance on standard evaluation platform using various real images shows that the algorithm is among the state-of-the-art both in accuracy and efficiency.

CVPR Semantic Scholar

Cite

Text

Wei and Quan. "Region-Based Progressive Stereo Matching." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2004. doi:10.1109/CVPR.2004.207

Markdown

[Wei and Quan. "Region-Based Progressive Stereo Matching." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2004.](https://mlanthology.org/cvpr/2004/wei2004cvpr-region/) doi:10.1109/CVPR.2004.207

BibTeX

@inproceedings{wei2004cvpr-region,
  title     = {{Region-Based Progressive Stereo Matching}},
  author    = {Wei, Yichen and Quan, Long},
  booktitle = {IEEE/CVF Conference on Computer Vision and Pattern Recognition},
  year      = {2004},
  pages     = {106-113},
  doi       = {10.1109/CVPR.2004.207},
  url       = {https://mlanthology.org/cvpr/2004/wei2004cvpr-region/}
}