The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.03 - March (2009 vol.31)
pp: 492-504
Liang Wang , University of Kentucky, Lexington
Qingxiong Yang , University of Illinois at Urbana Champaign, Urbana
Henrik Stewénius , Google Switzerland, Zurich
David Nistér , Microsoft Corp., Redmond
ABSTRACT
In this paper, we formulate a stereo matching algorithm 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 {\it{repeated}} application of a hierarchical loopy belief propagation algorithm. The experimental results are evaluated on the Middlebury data sets, showing that our algorithm is the {\it{top}} performer among all the algorithms listed there.
INDEX TERMS
3D/stereo scene analysis, Segmentation, Markov random fields
CITATION
Liang Wang, Qingxiong Yang, Henrik Stewénius, David Nistér, "Stereo Matching with Color-Weighted Correlation, Hierarchical Belief Propagation, and Occlusion Handling", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol.31, no. 3, pp. 492-504, March 2009, doi:10.1109/TPAMI.2008.99
REFERENCES
[1] S. Birchfield and C. Tomasi, “A Pixel Dissimilarity Measure That Is Insensitive to Image Sampling,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 20, pp. 401-406, 1998.
[2] M. Bleyer and M. Gelaut, “A Layered Stereo Algorithm Using Image Segmentation and Global Visibility Constraints,” Proc. IEEE Int'l Conf. Image Processing, pp. 2997-3000, 2004.
[3] Y. Boykov, O. Veksler, and R. Zabih, “A Variable Window Approach to Early Vision,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 20, pp. 1283-1294, 1998.
[4] Y. Boykov, O. Veksler, and R. Zabih, “Fast Approximate Energy Minimization via Graph Cuts,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 23, pp. 1222-1239, 2001.
[5] L. Chen, M. Cetin, and A.S. Willsky, “Distributed Data Association for Multi-Target Tracking in Sensor Networks,” Proc. Int'l Conf. Information Fusion, 2005.
[6] D. Comaniciu and P. Meer, “Mean Shift: A Robust Approach Toward Feature Space Analysis,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 24, pp. 603-619, 2002.
[7] G. Egnal and R. Wildes, “Detecting Binocular Half-Occlusions: Empirical Comparisons of Five Approaches,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 24, pp. 1127-1133, 2002.
[8] G. Elidan, I. McGraw, and D. Koller, “Residual Belief Propagation: Informed Scheduling for Asynchronous Message Passing,” Proc. 22nd Conf. Uncertainty in Artificial Intelligence, 2006.
[9] P.F. Felzenszwalb and D.P. Huttenlocher, “Efficient Belief Propagation for Early Vision,” Proc. IEEE CS Conf. Computer Vision and Pattern Recognition, vol. 1, pp. 261-268, 2004.
[10] M.A. Fischler and R.C. Bolles, “Random Sample Consensus: A Paradigm for Model Fitting with Applications to Image Analysis and Automated Cartography,” Comm. ACM, vol. 24, pp. 381-395, 1981.
[11] H. Hirschmüeller, “Accurate and Efficient Stereo Processing by Semi-Global Matching and Mutual Information,” Proc. IEEE CS Conf. Computer Vision and Pattern Recognition, vol. 2, pp. 807-814, 2005.
[12] H. Hirschmüeller, “Stereo Vision in Structured Environments by Consistent Semi-Global Matching,” Proc. IEEE CS Conf. Computer Vision and Pattern Recognition, vol. 2, pp. 2386-2393, 2006.
[13] A.T. Ihler, J.W. Fisher, and A.S. Willsky, “Loopy Belief Propagation: Convergence and Effects of Message Errors,” J. Machine Learning Research, vol. 6, pp. 905-936, 2005.
[14] T. Kanade and M. Okutomi, “A Stereo Matching Algorithm with an Adaptive Window: Theory and Experiments,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 16, pp. 920-932, 1994.
[15] A. Klaus, M. Sormann, and K.F. Karner, “Segment-Based Stereo Matching Using Belief Propagation and a Self-Adapting Dissimilarity Measure,” Proc. Int'l Conf. Pattern Recognition, vol. 3, pp. 15-18, 2006.
[16] V. Kolmogorov and R. Zabih, “Computing Visual Correspondence with Occlusions Using Graph Cuts,” Proc. IEEE Int'l Conf. Computer Vision, vol. 1, pp. 508-515, 2001.
[17] D. Scharstein and R. Szeliski, Middlebury Stereo Vision Research Page, http://vision.middlebury.edu/stereoeval/, 2008.
[18] D. Scharstein and R. Szeliski, “A Taxonomy and Evaluation of Dense Two-Frame Stereo Correspondence Algorithms,” Int'l J. Computer Vision, vol. 47, pp. 7-42, 2003.
[19] J. Sun, Y. Li, S.B. Kang, and H.-Y. Shum, “Symmetric Stereo Matching for Occlusion Handling,” Proc. IEEE CS Conf. Computer Vision and Pattern Recognition, vol. 2, pp. 399-406, 2005.
[20] J. Sun, N.-N. Zheng, and H.-Y. Shum, “Stereo Matching Using Belief Propagation,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 25, pp. 787-800, 2003.
[21] H. Tao and H. Sawhney, “Global Matching Criterion and Color Segmentation Based Stereo,” Proc. IEEE Workshop Applications of Computer Vision, pp. 246-253, 2000.
[22] M. Tappen and W. Freeman, “Comparison of Graph Cuts with Belief Propagation for Stereo,” Proc. IEEE Int'l Conf. Computer Vision, vol. 1, pp. 508-515, 2003.
[23] O. Veksler, “Stereo Correspondence with Compact Windows via Minimum Ratio Cycle,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 24, pp. 1654-1660, 2002.
[24] O. Veksler, “Fast Variable Window for Stereo Correspondence Using Integral Image,” Proc. IEEE CS Conf. Computer Vision and Pattern Recognition, vol. 1, pp. 556-561, 2003.
[25] Y. Weiss and W. Freeman, “On the Optimality of Solutions of the Max-Product Belief Propagation Algorithm in Arbitrary Graphs,” IEEE Trans. Information Theory, vol. 2, pp. 732-735, 2001.
[26] Q. Yang, L. Wang, R. Yang, H. Stewénius, and D. Nistér, “Stereo Matching with Color-Weighted Correlation, Hierarchical Belief Propagation and Occlusion Handling,” Proc. IEEE CS Conf. Computer Vision and Pattern Recognition, vol. 2, pp. 2347-2354, 2006.
[27] K.-J. Yoon and I.-S. Kweon, “Adaptive Support-Weight Approach for Correspondence Search,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 28, pp. 650-656, 2006.
20 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool