Global Stereo Matching Leveraged by Sparse Ground Control Points

Abstract

We present a novel global stereo model that makes use of constraints from points with known depths, i.e., the Ground Control Points (GCPs) as referred to in stereo literature. Our formulation explicitly models the influences of GCPs in a Markov Random Field. A novel GCPs-based regularization term is naturally integrated into our global optimization framework in a principled way using the Bayes rule. The optimal solution of the inference problem can be approximated via existing energy minimization techniques such as graph cuts used in this paper. Our generic probabilistic framework allows GCPs to be obtained from various modalities and provides a natural way to integrate the information from multiple sensors. Quantitative evaluations demonstrate the effectiveness of the proposed formulation for regularizing the ill-posed stereo matching problem and improving reconstruction accuracy.

Cite

Text

Wang and Yang. "Global Stereo Matching Leveraged by Sparse Ground Control Points." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2011. doi:10.1109/CVPR.2011.5995480

Markdown

[Wang and Yang. "Global Stereo Matching Leveraged by Sparse Ground Control Points." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2011.](https://mlanthology.org/cvpr/2011/wang2011cvpr-global/) doi:10.1109/CVPR.2011.5995480

BibTeX

@inproceedings{wang2011cvpr-global,
  title     = {{Global Stereo Matching Leveraged by Sparse Ground Control Points}},
  author    = {Wang, Liang and Yang, Ruigang},
  booktitle = {IEEE/CVF Conference on Computer Vision and Pattern Recognition},
  year      = {2011},
  pages     = {3033-3040},
  doi       = {10.1109/CVPR.2011.5995480},
  url       = {https://mlanthology.org/cvpr/2011/wang2011cvpr-global/}
}