We present a new feature based algorithm for stereo correspondence. Most of the previous feature based methods match sparse features like edge pixels, producing only sparse disparity maps. Our algorithm detects and matches dense features between the left and right images of a stereo pair, producing a semi-dense disparity map. Our dense feature is defined with respect to both images of a stereo pair, and it is computed during the stereo matching process, not a preprocessing step. In essence, a dense feature is a connected set of pixels in the left image and a corresponding set of pixels in the right image such that the intensity edges on the boundary of these sets are stronger than their matching error (which is basically the difference in intensities between corresponding boundary pixels). Our algorithm produces accurate semi-dense disparity maps, leaving featureless regions in the scene unmatched It is robust, requires little parameter tuning, can handle brightness differences between images, and is fast (linear complexity).


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Semi-dense stereo correspondence with dense features


    Contributors:
    Veksler, O. (author)


    Publication date :

    2001-01-01


    Size :

    1401361 byte





    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English




    Semi-Dense Stereo Correspondence with Dense Features

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


    Semi-Dense Stereo Correspondence with Dense Features

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


    Dense Features for Semi-Dense Stereo Correspondence

    Veksler, O. | British Library Online Contents | 2002


    Dense disparity features for fast stereo vision

    Kalomiros, J.A. | British Library Online Contents | 2012