Abstract
We propose a new stereo matching framework based on image bit-plane slicing. A pair of image sequences with various intensity quantization levels constructed by taking different bit-rate of the images is used for hierarchical stereo matching. The basic idea is to use the low bit-rate image pairs to compute rough disparity maps. The hierarchical matching strategy is then performed iteratively to update the low confident disparities with the information provided by extra image bit-planes. Since the disparity computation is carried out on a need-to-know basis, the proposed technique is suitable for remote processing of the images acquired by a mobile camera. Our method provides a hierarchical matching framework and can be combined with the existing stereo matching algorithms. Experiments on Middlebury datasets show that our technique gives good results compared to the conventional full bit-rate matching.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bhat, D.N., Nayar, S.K.: Ordinal measures for image correspondence. IEEE Trans. Pattern Anal. Mach. Intell. 20, 415–423 (1998)
Min, D., Sohn, K.: Cost aggregation and occlusion handling with wls in stereo matching. IEEE Transactions on Image Processing 17, 1431–1442 (2008)
Chen, Y.S., Hung, Y.P., Fuh, C.S.: Fast block matching algorithm based on the winner-update strategy. IEEE Transactions on Image Processing 10, 1212–1222 (2001)
Szeliski, R., Zabih, R., Scharstein, D., Veksler, O., Kolmogorov, V., Agarwala, A., Tappen, M., Rother, C.: A comparative study of energy minimization methods for markov random fields with smoothness-based priors. IEEE Trans. Pattern Anal. Mach. Intell. 30, 1068–1080 (2008)
Boykov, Y., Veksler, O., Zabih, R.: Fast approximate energy minimization via graph cuts. IEEE Transactions on Pattern Analysis and Machine Intelligence 23, 1222–1239 (2001)
Kolmogorov, V., Zabih, R.: Computing visual correspondence with occlusions using graph cuts. In: IEEE International Conference on Computer Vision, vol. 2, p. 508 (2001)
Sun, J., Zheng, N.N., Shum, H.Y.: Stereo matching using belief propagation. IEEE Trans. Pattern Anal. Mach. Intell. 25, 787–800 (2003)
Ohta, Y., Kanade, T.: Stereo by intra- and inter-scanline search using dynamic programming. IEEE Trans. Pattern Analysis and Machine Intelligence 7, 139–154 (1985)
Birchfield, S., Tomasi, C.: Depth discontinuities by pixel-to-pixel stereo. International Journal of Computer Vision 35, 269–293 (1999)
Scharstein, D., Szeliski, R.: A taxonomy and evaluation of dense two-frame stereo correspondence algorithms. Int. J. Comput. Vision 47, 7–42 (2002)
Hung, Y.P., Chen, C.S., Hung, K.C., Chen, Y.S., Fuh, C.S.: Multipass hierarchical stereo matching for generation of digital terrain models form aerial images. Mach. Vision Appl. 10, 280–291 (1998)
Zhang, L.: Fast stereo matching algorithm for intermediate view reconstruction of stereoscopic television images. IEEE Transactions on Circuits and Systems for Video Technology 16, 1259–1270 (2006)
Yang, R., Pollefeys, M.: Multi-resolution real-time stereo on commodity graphics hardware. In: IEEE Computer Vision and Pattern Recognition, pp. 1:211–1:217 (2003)
Scharstein, D., Szeliski, R.: Middlebury stereo vision page (2002), http://vision.middlebury.edu/stereo
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lin, HY., Lin, PZ. (2013). Hierarchical Stereo Matching Based on Image Bit-Plane Slicing. In: Park, JI., Kim, J. (eds) Computer Vision - ACCV 2012 Workshops. ACCV 2012. Lecture Notes in Computer Science, vol 7729. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-37484-5_48
Download citation
DOI: https://doi.org/10.1007/978-3-642-37484-5_48
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-37483-8
Online ISBN: 978-3-642-37484-5
eBook Packages: Computer ScienceComputer Science (R0)