An algorithm to detect depth discontinuities from a stereo pair of images is presented. The algorithm matches individual pixels in corresponding scanline pairs while allowing occluded pixels to remain unmatched, then propagates the information between scanlines by means of a fast postprocessor. The algorithm handles large untextured regions, uses a measure of pixel dissimilarity that is insensitive to image sampling, and prunes bad search nodes to increase the speed of dynamic programming. The computation is relatively fast, taking about 1.5 microseconds per pixel per disparity on a workstation. Approximate disparity maps and precise depth discontinuities (along both horizontal and vertical boundaries) are shown for five stereo images containing textured, untextured, fronto-parallel, and slanted objects.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Depth discontinuities by pixel-to-pixel stereo


    Contributors:
    Birchfield, S. (author) / Tomasi, C. (author)


    Publication date :

    1998-01-01


    Size :

    1196414 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Depth Discontinuities by Pixel-to-Pixel Stereo

    Birchfield, S. / Tomasi, C. / IEEE; Computer Society | British Library Conference Proceedings | 1998


    Depth Discontinuities by Pixel-to-Pixel Stereo

    Birchfield, S. / Tomasi, C. | British Library Online Contents | 1999


    Non-pixel Robot Stereo

    Folsom, Tyler C. | IEEE | 2007


    DEPTH DEPENDENT PIXEL FILTERING

    SUBASINGHA SUBASINGHA SHAMINDA / CHEN YONGZHE / FERDOWSI MEHRAN et al. | European Patent Office | 2022

    Free access

    Depth dependent pixel filtering

    SUBASINGHA SUBASINGHA SHAMINDA / CHEN YONGZHE / FERDOWSI MEHRAN et al. | European Patent Office | 2024

    Free access