loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
12th International Conference on Image Analysis and Processing (ICIAP'03)
Robustness to Noise of Stereo Matching
Mantova, Italy
September 17-September 19
ISBN: 0-7695-1948-2
Philippe Leclercq, University of Western Australia
John Morris, University of Western Australia

We 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 standard deviation of the distribution of disparity errors.

For a noise-free image, Birch.eld and Tomasi?s Pixel-to-Pixel — a 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 36dB 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 (~ 15dB). 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.

Citation:
Philippe Leclercq, John Morris, "Robustness to Noise of Stereo Matching," iciap, pp.606, 12th International Conference on Image Analysis and Processing (ICIAP'03), 2003
Usage of this product signifies your acceptance of the Terms of Use.