A Comparative Study of Correlation Based Stereo Matching Algorithms: Illumination and Exposure

Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 309)

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.

Keywords

Disparity estimation Stereo matching Similarity measure Illumination Exposure 

Notes

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.

References

  1. 1.
    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)CrossRefMATHGoogle Scholar
  2. 2.
    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)Google Scholar
  3. 3.
    Hseu, H., Bhalerao, A., Wilson, R.: Image matching based on the co-occurrence matrix. Technical report, University of Warwick, Coventry, UKGoogle Scholar
  4. 4.
    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)Google Scholar
  5. 5.
    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)Google Scholar
  6. 6.
    Sun, C.: Multi-resolution rectangular sub regioning stereo matching using fast correlation and dynamic programming techniques. CMIS report no. 98/246 (1998)Google Scholar
  7. 7.
    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)Google Scholar
  8. 8.
    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)Google Scholar
  9. 9.
    Middlebury Stereo Vision.: http://www.vision.middlebury.edu/stereo/

Copyright information

© Springer India 2015

Authors and Affiliations

  1. 1.Department of Electronics and Communication EngineeringVidyavardhaka College of EngineeringMysoreIndia
  2. 2.Department of Electronics and Communication EngineeringPES College of EngineeringMandyaIndia

Personalised recommendations