Stereo Matching with Color-Weighted Correlation, Hierachical Belief Propagation and Occlusion Handling

  • Authors:
  • Qyngxiong Yang;Liang Wang;Ruigang Yang;Henrik Stewenius;David Nister

  • Affiliations:
  • University of Kentucky;University of Kentucky;University of Kentucky;University of Kentucky;University of Kentucky

  • Venue:
  • CVPR '06 Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 2
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we formulate an algorithm for the stereo matching problem with careful handling of disparity, discontinuity and occlusion. The algorithm works with a global matching stereo model based on an energy- minimization framework. The global energy contains two terms, the data term and the smoothness term. The data term is first approximated by a color-weighted correlation, then refined in occluded and low-texture areas in a repeated application of a hierarchical loopy belief propagation algorithm. The experimental results are evaluated on the Middlebury data set, showing that our algorithm is the top performer.