Parameter Estimation for MRF Stereo

Abstract

This paper presents a novel approach for estimating parameters for MRF-based stereo algorithms. This approach is based on a new formulation of stereo as a maximum a posterior (MAP) problem, in which both a disparity map and MRF parameters are estimated from the stereo pair itself. We present an iterative algorithm for the MAP estimation that alternates between estimating the parameters while fixing the disparity map and estimating the disparity map while fixing the parameters. The estimated parameters include robust truncation thresholds, for both data and neighborhood terms, as well as a regularization weight. The regularization weight can be either a constant for the whole image, or spatially-varying, depending on local intensity gradients. In the latter case, the weights for intensity gradients are also estimated. Experiments indicate that our approach, as a wrapper for existing stereo algorithms, moves a baseline belief propagation stereo algorithm up six slots in the middlebury rankings.

Cite

Text

Zhang and Seitz. "Parameter Estimation for MRF Stereo." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2005. doi:10.1109/CVPR.2005.269

Markdown

[Zhang and Seitz. "Parameter Estimation for MRF Stereo." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2005.](https://mlanthology.org/cvpr/2005/zhang2005cvpr-parameter/) doi:10.1109/CVPR.2005.269

BibTeX

@inproceedings{zhang2005cvpr-parameter,
  title     = {{Parameter Estimation for MRF Stereo}},
  author    = {Zhang, Li and Seitz, Steven M.},
  booktitle = {IEEE/CVF Conference on Computer Vision and Pattern Recognition},
  year      = {2005},
  pages     = {288-295},
  doi       = {10.1109/CVPR.2005.269},
  url       = {https://mlanthology.org/cvpr/2005/zhang2005cvpr-parameter/}
}