Efficient BP stereo with automatic paramemeter estimation

In this paper, we propose a series of techniques to enhance the computational performance of existing Belief Propagation (BP) based stereo matching that relies on automatic estimation of the Markov random field (MRF) parameters. First, we show how convergence in matching can be achieved faster than with the existing message comparison technique by skipping comparisons in early inferences. Second, assuming that a stereo pair is captured with identical cameras, we apply a hypothesis called noise equivalence to pre-estimate the likelihood parameters and thus, avoid costly nested inferences to reduce the computational time. The likelihood parameters and intensity information are used for accelerated message propagation in image regions lacking gradients. Third, the prior model parameters are estimated with a combination of maximum likelihood (ML) estimation and disparity gradient constraint to further reduce the computational time. Supporting experiments for the proposed algorithms show encouraging results on ground truth test images.

[1]  Andreas Klaus,et al.  Segment-Based Stereo Matching Using Belief Propagation and a Self-Adapting Dissimilarity Measure , 2006, 18th International Conference on Pattern Recognition (ICPR'06).

[2]  Terry Caelli,et al.  Bayesian Stereo Matching , 2004, 2004 Conference on Computer Vision and Pattern Recognition Workshop.

[3]  Miao Liao,et al.  Real-time Global Stereo Matching Using Hierarchical Belief Propagation , 2006, BMVC.

[4]  Li Zhang,et al.  Estimating Optimal Parameters for MRF Stereo from a Single Image Pair , 2007, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[5]  Nanning Zheng,et al.  Stereo Matching Using Belief Propagation , 2002, IEEE Trans. Pattern Anal. Mach. Intell..

[6]  Pedro F. Felzenszwalb,et al.  Efficient belief propagation for early vision , 2004, CVPR 2004.