1 |
M. F. Tappen and W.T. Freeman, 'Comparison of Graph Cuts with Belief Propagation for Stereo, using Identical MRF Parameters', Proc. IEEE Int'l Conf. Computer Vision, vol.2, pp.900-906, 2003
|
2 |
D. Scharstein and R. Szeliski, 'A Taxonomy and Evaluation of Dense Two-Frame Stereo Correspondence Algorithms', Int'l J. Computer Vision, vol.47, no.1, pp.7-42, 2002
DOI
|
3 |
P. Smyth, 'Belief Networks, Hidden Markov, Models, and Markov Random Fields: a Unifying View', Pattern Recognition Letters, vol.18, pp,1261-1268, 1997
DOI
ScienceOn
|
4 |
J. Pearl, Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference, Morgan Kaufmann Publishers, 1998
|
5 |
M. Z. Brown, D. Burschka, and G.D. Hager, 'Advance in Computational Stereo', IEEE Trans. Pattern Analysis and Machine Intelligence, vol.25, no.8, pp.993-1008, 2003
DOI
ScienceOn
|
6 |
Y. Boykov, O. Veksler, and R. Zabih, 'Fast Approximate Energy Minimization via Graph Cuts', IEEE Trans. Pattern Analysis and Machine Intelligence, vol.23, no.11, pp,1222-1239, 2001
DOI
ScienceOn
|
7 |
J. Sun, H-Y Shum, and N-N Zheng, 'Stereo Matching Using Belief Propagation', IEEE Trans. Pattern Analysis and Machine Intelligence, vol.25, no.7, pp.787-800, 2003
DOI
ScienceOn
|