Share on Facebook Tweet on Twitter Share on LinkedIn Share by email
Stereo Matching Using Belief Propagation

Jian Sun, Nan-Ning Zheng, and Heung-Yeung Shum


In this paper, we formulate the stereo matching problem as a Markov network and solve it using Bayesian belief propagation. The stereo Markov network consists of three coupled Markov random fields that model the following: a smooth field for depth/disparity, a line process for depth discontinuity, and a binary process for occlusion. After eliminating the line process and the binary process by introducing two robust functions, we apply the belief propagation algorithm to obtain the maximum a posteriori (MAP) estimation in the Markov network. Other low-level visual cues (e.g., image segmentation) can also be easily incorporated in our stereo model to obtain better stereo results. Experiments demonstrate that our methods are comparable to the state-of-the-art stereo algorithms for many test cases.


Publication typeArticle
Published inIEEE Trans. Pattern Analysis and Machine Intelligence
PublisherInstitute of Electrical and Electronics Engineers, Inc.
> Publications > Stereo Matching Using Belief Propagation