We present a method for extracting dense features from stereo and motion sequences. Our dense feature is defined symmetrically with respect to both images, and it is extracted during the correspondence process, not in a separate preprocessing step. For dense feature extraction we use the graph cuts algorithm, recently shown to be a powerful optimization tool for vision. Our algorithm produces semi-dense answer, with very accurate results in areas where features are detected, and no matches in featureless regions. Unlike sparse feature based algorithms, we are able to extract accurate correspondences in some untextured regions, provided that there are texture cues on the boundary. Our algorithm is robust and does not require parameter tuning.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Extracting dense features for visual correspondence with graph cuts


    Contributors:
    Veksler, O. (author)


    Publication date :

    2003-01-01


    Size :

    396433 byte





    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Extracting Dense Features for Visual Correspondence with Graph Cuts

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



    Computing Visual Correspondence with Occlusions via Graph Cuts

    Kolmogorov, V. / Zabih, R. / IEEE | British Library Conference Proceedings | 2001



    Semi-Dense Stereo Correspondence with Dense Features

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