ML Anthology

Window-Based, Discontinuity Preserving Stereo

Motilal Agrawal, Larry S. Davis
CVPR 2004 pp. 66-73
doi:10.1109/CVPR.2004.274 /cvpr/2004/agrawal2004cvpr-window/

Abstract

Traditionally, the problem of stereo matching has been addressed either by a local window-based approach or a dense pixel-based approach using global optimization. In this paper we present an algorithm which combines window-based local matching into a global optimization framework. Our local matching algorithm assumes that local windows can have at most two disparities. Under this assumption, the local matching can be performed very efficiently using graph cuts. The global matching is formulated as minimization of an energy term that takes into account the matching constraints induced by the local stereo algorithm. Fast, approximate minimization of this energy is achieved through graph cuts. The key feature of our algorithm is that it preserves discontinuities both during the local as well as global matching phase.

PDF CVPR Semantic Scholar

Cite

Text

Agrawal and Davis. "Window-Based, Discontinuity Preserving Stereo." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2004. doi:10.1109/CVPR.2004.274

Markdown

[Agrawal and Davis. "Window-Based, Discontinuity Preserving Stereo." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2004.](https://mlanthology.org/cvpr/2004/agrawal2004cvpr-window/) doi:10.1109/CVPR.2004.274

BibTeX

@inproceedings{agrawal2004cvpr-window,
  title     = {{Window-Based, Discontinuity Preserving Stereo}},
  author    = {Agrawal, Motilal and Davis, Larry S.},
  booktitle = {IEEE/CVF Conference on Computer Vision and Pattern Recognition},
  year      = {2004},
  pages     = {66-73},
  doi       = {10.1109/CVPR.2004.274},
  url       = {https://mlanthology.org/cvpr/2004/agrawal2004cvpr-window/}
}