Stereo matching is one of the most active research areas in computer vision. While a large number of algorithms for stereo correspondence have been developed, relatively little work has been done on characterizing their performance. In this paper, we present a taxonomy of dense, two-frame stereo methods designed to assess the different components and design decisions made in individual stereo algorithms. Using this taxonomy, we compare existing stereo methods and present experiments evaluating the performance of many different variants. In order to establish a common software platform and a collection of data sets for easy evaluation, we have designed a stand-alone, flexible C++ implementation that enables the evaluation of individual components and that can be easily extended to include new algorithms. We have also produced several new multiframe stereo data sets with ground truth, and are making both the code and data sets available on the Web.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    A taxonomy and evaluation of dense two-frame stereo correspondence algorithms


    Contributors:
    Scharstein, D. (author) / Szeliski, R. (author) / Zabih, R. (author)


    Publication date :

    2001-01-01


    Size :

    566145 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



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

    Scharstein, D. / Szeliski, R. / Zabih, R. et al. | British Library Conference Proceedings | 2001


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

    Scharstein, D. / Szeliski, R. | British Library Online Contents | 2002


    Dense Features for Semi-Dense Stereo Correspondence

    Veksler, O. | British Library Online Contents | 2002



    Semi-Dense Stereo Correspondence with Dense Features

    Veksler, O. / IEEE | British Library Conference Proceedings | 2001