By Topic

Robustness to noise of stereo matching

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Leclercq, P. ; Sch. of Electr., Electron. & Comput. Eng., Western Australia Univ., WA, Australia ; Morris, J.

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 (∼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.

Published in:

Image Analysis and Processing, 2003.Proceedings. 12th International Conference on

Date of Conference:

17-19 Sept. 2003