ML Anthology

Region-Tree Based Stereo Using Dynamic Programming Optimization

Cheng Lei, Jason M. Selzer, Yee-Hong Yang
CVPR 2006 pp. 2378-2385
doi:10.1109/CVPR.2006.251 /cvpr/2006/lei2006cvpr-region/

Abstract

In this paper, we present a novel stereo algorithm that combines the strengths of region-based stereo and dynamic programming on a tree approaches. Instead of formulating an image as individual scan-lines or as a pixel tree, a new region tree structure, which is built as a minimum spanning tree on the adjacency-graph of an over-segmented image, is used for the global dynamic programming optimization. The resulting disparity maps do not contain any streaking problem as is common in scanline-based algorithms because of the tree structure. The performance evaluation using the Middlebury benchmark datasets shows that the performance of our algorithm is comparable in accuracy and efficiency with top ranking algorithms.

CVPR Semantic Scholar

Cite

Text

Lei et al. "Region-Tree Based Stereo Using Dynamic Programming Optimization." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2006. doi:10.1109/CVPR.2006.251

Markdown

[Lei et al. "Region-Tree Based Stereo Using Dynamic Programming Optimization." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2006.](https://mlanthology.org/cvpr/2006/lei2006cvpr-region/) doi:10.1109/CVPR.2006.251

BibTeX

@inproceedings{lei2006cvpr-region,
  title     = {{Region-Tree Based Stereo Using Dynamic Programming Optimization}},
  author    = {Lei, Cheng and Selzer, Jason M. and Yang, Yee-Hong},
  booktitle = {IEEE/CVF Conference on Computer Vision and Pattern Recognition},
  year      = {2006},
  pages     = {2378-2385},
  doi       = {10.1109/CVPR.2006.251},
  url       = {https://mlanthology.org/cvpr/2006/lei2006cvpr-region/}
}