Performance Evaluation of Bit-plane Slicing based Stereo Matching Techniques

In this paper, we propose a hierarchical framework for stereo matching. Similar to the conventional image pyramids, a series of images with less and less information is constructed. The objective is to use bit-plane slicing technique to investigate the feasibility of correspondence matching with less bits of intensity information. In the experiments, stereo matching with various bit-rate image pairs are carried out using graph cut, semi-global matching, and non-local aggregation methods. The results are submitted to Middlebury stereo page for performance evaluation.

[1]  Kurt Konolige,et al.  Small Vision Systems: Hardware and Implementation , 1998 .

[2]  Kwanghoon Sohn,et al.  Cost Aggregation and Occlusion Handling With WLS in Stereo Matching , 2008, IEEE Transactions on Image Processing.

[3]  Richard Szeliski,et al.  A Taxonomy and Evaluation of Dense Two-Frame Stereo Correspondence Algorithms , 2001, International Journal of Computer Vision.

[4]  Richard Szeliski,et al.  A Comparative Study of Energy Minimization Methods for Markov Random Fields with Smoothness-Based Priors , 2008, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[5]  Huei-Yung Lin,et al.  Hierarchical stereo matching with image bit-plane slicing , 2013, Machine Vision and Applications.

[6]  Margrit Gelautz,et al.  A framework for HDR stereo matching using multi-exposed images , 2013 .

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

[8]  Yee-Hong Yang,et al.  Multi-resolution stereo matching using genetic algorithm , 2001, Proceedings IEEE Workshop on Stereo and Multi-Baseline Vision (SMBV 2001).

[9]  Gauthier Lafruit,et al.  Stream-Centric Stereo Matching and View Synthesis: A High-Speed Approach on GPUs , 2009, IEEE Transactions on Circuits and Systems for Video Technology.

[10]  Vladimir Kolmogorov,et al.  What energy functions can be minimized via graph cuts? , 2002, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[11]  Yi-Ping Hung,et al.  Fast block matching algorithm based on the winner-update strategy , 2001, IEEE Trans. Image Process..

[12]  Heiko Hirschmüller,et al.  Evaluation of Cost Functions for Stereo Matching , 2007, 2007 IEEE Conference on Computer Vision and Pattern Recognition.

[13]  Qingxiong Yang,et al.  A non-local cost aggregation method for stereo matching , 2012, 2012 IEEE Conference on Computer Vision and Pattern Recognition.

[14]  Darius Burschka,et al.  Advances in Computational Stereo , 2003, IEEE Trans. Pattern Anal. Mach. Intell..

[15]  Huei-Yung Lin,et al.  Stereo matching on low intensity quantization images , 2012, Proceedings of the 21st International Conference on Pattern Recognition (ICPR2012).

[16]  Markus Vincze,et al.  A fast stereo matching algorithm suitable for embedded real-time systems , 2010, Comput. Vis. Image Underst..

[17]  Heiko Hirschmüller,et al.  Stereo Processing by Semiglobal Matching and Mutual Information , 2008, IEEE Trans. Pattern Anal. Mach. Intell..

[18]  Richard Szeliski,et al.  High-accuracy stereo depth maps using structured light , 2003, 2003 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2003. Proceedings..