Abstract
Stereo matching is one of the most active research areas in computer vision for an accurate estimation of disparity. Many algorithms for computing stereo algorithm have been proposed, but there has been very little work on experimentally evaluating algorithm performance, especially using real-time scenario. Many researchers have been undergone past from many decades to find an accurate disparity, but still it is not an easy task to choose an appropriate algorithm for the required real-time application. To overcome from this problem, we proposed an experimental comparison of several different cross-correlation-based stereo algorithms and also introduce an objective that evaluates a set of six known correlation-based stereo algorithms. An evaluation of correlation-based stereo matching algorithm results will be very useful for selecting the appropriate stereo algorithms for a given application. Here, we make use of two stereo pairs: Aloe and Cloth from Middlebury stereo datasets. This work mainly focuses on the evaluation of robustness to change in illumination and exposure.
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
References
Scharstein, D., Szeliski, R., Zabih, R.: A taxonomy and evaluation of dense two-frame stereo correspondence algorithms. Int. J. Comput. Vis. 47, 7–42 (2002)
Aschwanden, P., Guggenbuhl, W.: Experimental results from a comparative study on correlation type registration algorithms. In: Forstner, W., Ruweidel, S. (eds.) Robust Computer Vision, pp. 268–282. Wichmann, Karlsruhe (1992)
Hseu, H., Bhalerao, A., Wilson, R.: Image matching based on the co-occurrence matrix. Technical report, University of Warwick, Coventry, UK
Faugeras, O., et al.: Qualitative and quantitative comparison of some area and feature based stereo algorithms. In: Fostner, W., Ruweides, S. (eds.) Robust Computer Vision, pp. 1–26. Wichmann, Karlsruhe (1992)
Arsenio, A., Marques, J.S.: Performance analysis and characterization of matching algorithms. In: Proceedings of the 5th International Symposium on Intelligent Robotic Systems, Stockholm, Sweden (1997)
Sun, C.: Multi-resolution rectangular sub regioning stereo matching using fast correlation and dynamic programming techniques. CMIS report no. 98/246 (1998)
Bindu, N.S., Sheshadri, H.S.: An evaluation of correlation based stereo matching algorithms by considering various parameters. In: Proceedings of International Conference on Recent Trends in Signal Processing, Image Processing and VLSI, Bangalore (2014)
Bindu, N.S., Sheshadri, H.S.: A comparative study and evaluation of stereo matching costs for radiometric differences. In: Proceedings of International Conference on Recent Trends in Signal Processing, Image Processing and VLSI, Bangalore (2014)
Middlebury Stereo Vision.: http://www.vision.middlebury.edu/stereo/
Acknowledgement
The authors would like to thank the anonymous reviewers for their constructive comments. Also, I would like to thank my guide Dr. H.S. Sheshadri and my friend U. Ragavendra for their support. This research was supported in part by PESCE, Mandya, India.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer India
About this paper
Cite this paper
Bindu, N.S., Sheshadri, H.S. (2015). A Comparative Study of Correlation Based Stereo Matching Algorithms: Illumination and Exposure. In: Jain, L., Patnaik, S., Ichalkaranje, N. (eds) Intelligent Computing, Communication and Devices. Advances in Intelligent Systems and Computing, vol 309. Springer, New Delhi. https://doi.org/10.1007/978-81-322-2009-1_22
Download citation
DOI: https://doi.org/10.1007/978-81-322-2009-1_22
Published:
Publisher Name: Springer, New Delhi
Print ISBN: 978-81-322-2008-4
Online ISBN: 978-81-322-2009-1
eBook Packages: EngineeringEngineering (R0)