Measuring the self-consistency of stereo algorithms

9Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

A new approach to characterizing the performance of point- correspondence algorithms is presented. Instead of relying on any“gro- und truth’, it uses the self-consistency of the outputs of an algorithm independently applied to different sets of views of a static scene. It al- lows one to evaluate algorithms for a given class of scenes, as well as to estimate the accuracy of every element of the output of the algorithm for a given set of views. Experiments to demonstrate the usefulness of the methodology are presented.

Cite

CITATION STYLE

APA

Leclerc, Y. G., Luong, Q. T., & Fua, P. (2000). Measuring the self-consistency of stereo algorithms. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1842, pp. 282–298). Springer Verlag. https://doi.org/10.1007/3-540-45054-8_19

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free