We present a new background estimation algorithm that constructs the background of an image sequence with moving objects by copying areas from input frames. The background estimation problem is formulated as an optimal labeling problem in which the label at an output pixel is the frame number from which to copy the background color. The costs of assigning labels encourage seamless copying from regions that are stationary over a period of time in such a way that implied motion boundaries occur at intensity edges. This is accomplished without explicitly tracking the moving objects or computing optical flow. Experiments demonstrate that our algorithm is effective in difficult areas where the background is visible for only a small fraction of time, and on inputs with both moving objects that are not always in motion and moving objects with textureless areas.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Background estimation as a labeling problem


    Beteiligte:
    Cohen, S. (Autor:in)


    Erscheinungsdatum :

    2005-01-01


    Format / Umfang :

    2424809 byte





    Medientyp :

    Aufsatz (Konferenz)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch



    Background Estimation as a Labeling Problem

    Cohen, S. / IEEE | British Library Conference Proceedings | 2005



    Adaptive Labeling Algorithms for the Dynamic Assignment Problem

    POWELL, W. B. / SNOW, W. / CHEUNG, R. K. | British Library Online Contents | 2000


    Orbiting Debris A Space Environmental Problem: Background Paper

    Lionel S. Johns / Alan Shaw / Ray A. Williamson et al. | NTRS | 1990