We have measured the performance of several area-based stereo matching algorithms with noise added to synthetic images. Dense disparity maps were computed and compared with the ground truth using three metrics: the fraction of correctly computed disparities, the mean and the standard deviation of the disparity error distribution. For a noise-free image, S. Birchfield and C. Tomasi's pixel-to-pixel dynamic algorithm performed slightly better than a simple sum-of-absolute-differences algorithm (67% correct matches vs 65%) $considered to be within experimental error. A census algorithm performed worst at only 54%. The dynamic algorithm performed well until the S/N ratio reached 36 dB after which its performance started to drop. However, with correctly chosen parameters, it was superior to correlation and census algorithms until the images became very noisy (/spl sim/15 dB). The dynamic algorithm also ran faster than the fastest correlation algorithms using an optimum window radius of 4, and more than 10 times faster than the census algorithm.
[1]
Biswanath N. Chatterji,et al.
Stereo Matching Algorithms Based on Fuzzy Approach
,
2002,
Int. J. Pattern Recognit. Artif. Intell..
[2]
William H. Press,et al.
Book-Review - Numerical Recipes in Pascal - the Art of Scientific Computing
,
1989
.
[3]
Laurent Moll,et al.
Real time correlation-based stereo: algorithm, implementations and applications
,
1993
.
[4]
Carlo Tomasi,et al.
Depth Discontinuities by Pixel-to-Pixel Stereo
,
1998,
Sixth International Conference on Computer Vision (IEEE Cat. No.98CH36271).
[5]
Ramin Zabih,et al.
Non-parametric Local Transforms for Computing Visual Correspondence
,
1994,
ECCV.
[6]
F. A. Seiler,et al.
Numerical Recipes in C: The Art of Scientific Computing
,
1989
.
[7]
Richard Szeliski,et al.
A Taxonomy and Evaluation of Dense Two-Frame Stereo Correspondence Algorithms
,
2001,
International Journal of Computer Vision.