Stereo matching using belief propagation (2003)
Cached
Download Links
- [www.fias.uni-frankfurt.de]
- [research.microsoft.com]
- [research.microsoft.com]
- [research.microsoft.com]
- [www.cs.rutgers.edu]
- DBLP
Other Repositories/Bibliography
| Citations: | 173 - 3 self |
BibTeX
@MISC{Sun03stereomatching,
author = {Jian Sun and Nan-ning Zheng and Heung-yeung Shum},
title = {Stereo matching using belief propagation},
year = {2003}
}
Years of Citing Articles
OpenURL
Abstract
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.







