Visibility constraints can aid the segmentation of foreground objects observed with multiple range images. In our approach, points are defined as foreground if they can be determined to occlude some empty space in the scene. We present an efficient algorithm to estimate foreground points in each range view using explicit epipolar search. In cases where the background pattern is stationary, we show how visibility constraints from other views can generate virtual background values at points with no valid depth in the primary view. We demonstrate the performance of both algorithms for detecting people in indoor office environments.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Range segmentation using visibility constraints


    Contributors:
    Taycher, L. (author) / Darrell, T. (author)


    Publication date :

    2001-01-01


    Size :

    1664797 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Range Segmentation Using Visibility Constraints

    Taycher, L. / Darrell, T. | British Library Online Contents | 2002


    Range Segmentation Using Visibility Constraints

    Taycher, L. / Darrell, T. / IEEE Computer Society | British Library Conference Proceedings | 2001


    Backward Segmentation and Region Fitting for Geometrical Visibility Range Estimation

    Bigorgne, Erwan / Tarel, Jean-Philippe | Springer Verlag | 2007


    Visibility range sensing

    RUTKIEWICZ ROBERT / MATTY DAVID / RAMTHUN KENT ALLAN et al. | European Patent Office | 2021

    Free access

    VISIBILITY RANGE SENSING

    RUTKIEWICZ ROBERT / MATTY DAVID / RAMTHUN KENT ALLAN et al. | European Patent Office | 2021

    Free access