Abstract
Stereo matching is an important part in stereo vision. For traditional matching algorithm having difficulties to satisfy both accuracy and speed, a novel local stereo matching algorithm is presented in this paper. Firstly, an initial disparity estimation is obtained by using dynamic window of region growing algorithm based on color constraint for matching. On the other side, a simple but efficient way is proposed to further improve matching accuracy without adding additional computational work. Experimental results show that the algorithm we presented can not only get a more accurate disparity map at repetitive areas and depth discontinuities but also meet the need of real-time.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Chambolle, A., Lions, P.L.: Image recovery via total variation minimization and related problems. Numer. Math. 76, 167–188 (1997)
Salmen, J., Schlipsing, M., Edelbrunner, J., Hegemann, S., Lüke, S.: Real-Time Stereo Vision: Making More Out of Dynamic Programming. In: Jiang, X., Petkov, N. (eds.) CAIP 2009. LNCS, vol. 5702, pp. 1096–1103. Springer, Heidelberg (2009)
Yang, Q., Wang, L., Yang, R., Wang, S., Liao, M., Nister, D.: Real-time global stereo matching using hierarchical belief propagation. In: BMVC (2006)
Mattoccia, S., Giardino, S., Gambini, A.: Accurate and Efficient Cost Aggregation Strategy for Stereo Correspondence Based on Approximated Joint Bilateral Filtering. In: Zha, H., Taniguchi, R.-i., Maybank, S. (eds.) ACCV 2009, Part II. LNCS, vol. 5995, pp. 371–380. Springer, Heidelberg (2010)
Scharstein, D., Szeliski, R.: A taxonomy and evaluation of dense two-frame stereo correspondence algorithms. Int’l Journal on Computer Vision 47(1/2/3), 7–42 (2002)
Felzenszwalb, P.F., Huttenlocher, D.P.: Efficient Belief Propagation for Early Vision. In: IEEE Conference on Computer Vision and Pattern Recognition, Washington D.C. (2004)
Kanade, T., Okutomi, M.: A stereo matching algorithm with an adaptive window: Theory and experiments. In: IEEE International Conference on Computer Vision (1998)
Fusiello, A., Roberto, V., Trucco, E.: Efficient Stereo with Multiple Windowing. In: Proc. IEEE Conf. Computer Vision and Pattern Recognition, pp. 858–863 (1997)
Yoon, K.J., Kweon, I.S.: Adaptive support-weight approach for correspondence search. IEEE Trans. PAMI 28(4), 650–656 (2006)
Middlebury stereo benchmark dataset, http://vision.middlebury.edu/stereo/data
Scharstein, D., Szeliski, R.: A taxonomy and evaluation of dense two-frame stereo correspondence algorithms. Int. Jour. Computer Vision (IJCV) 47(1/2/3), 7–42 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wang, P., Wu, F. (2012). A Local Stereo Matching Algorithm Based on Region Growing. In: Zhang, W., Yang, X., Xu, Z., An, P., Liu, Q., Lu, Y. (eds) Advances on Digital Television and Wireless Multimedia Communications. Communications in Computer and Information Science, vol 331. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34595-1_62
Download citation
DOI: https://doi.org/10.1007/978-3-642-34595-1_62
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-34594-4
Online ISBN: 978-3-642-34595-1
eBook Packages: Computer ScienceComputer Science (R0)