Qualitative and quantitative evaluation of correlation based stereo matching algorithms

Authors:
U. Raghavendra;Krishnamoorthi Makkithaya;A. K. Karunakar
Affiliations:
Department of Master of Computer Application, Manipal University, Manipal, India and Manipal Institute of Technology, Manipal University, Manipal, India;Manipal Institute of Technology, Manipal University, Manipal, India;Manipal Institute of Technology, Manipal University, Manipal, India
Venue:
ADCONS'11 Proceedings of the 2011 international conference on Advanced Computing, Networking and Security
Year:
2011

Citing 6
Cited 0

A Taxonomy and Evaluation of Dense Two-Frame Stereo Correspondence Algorithms

International Journal of Computer Vision
Real-Time Correlation-Based Stereo Vision with Reduced Border Errors

International Journal of Computer Vision
A Simple Stereo Algorithm to Recover Precise Object Boundaries and Smooth Surfaces

International Journal of Computer Vision
Image Matching Based On The Co-occurrence Matrix

Image Matching Based On The Co-occurrence Matrix
Adaptive Support-Weight Approach for Correspondence Search

IEEE Transactions on Pattern Analysis and Machine Intelligence
Cross-based local stereo matching using orthogonal integral images

IEEE Transactions on Circuits and Systems for Video Technology

Quantified Score

Hi-index	0.00

Visualization

Abstract

Accurate estimation of disparity is one of the most active research area in computer vision. In the last few decades numerous algorithms have been invented to find disparity precisely. However, these inventions throws problem in selecting most appropriate one for the required application. A detailed analysis is mandatory to solve this kind of problem. The main objective of this paper is to empirically evaluate a set of well known correlation based stereo matching algorithms. A qualitative and quantitative analysis results will be useful for selecting the most appropriate algorithm for the given application. The presented analysis is mainly focused on the evaluation of errors, robustness to change in illumination and the computation cost required for each algorithm.