A Background Maintenance Model in the Spatial-Range Domain

In this article a background maintenance model defined by a finite set of codebook vectors in the spatial-range domain is proposed. The model represents its current state by a foreground and a background set of codebook vectors. Algorithms that dynamically update these sets by adding and removing codebook vectors are described. This approach is fundamentally different from algorithms that maintain a background representation at the pixel level and continously update their parameters. The performance of the model is demonstrated and compared to other background maintenance models using a suitable benchmark of video sequences.

[1]  Allen R. Hanson,et al.  Computer Vision Systems , 1978 .

[2]  Dorin Comaniciu,et al.  Mean Shift: A Robust Approach Toward Feature Space Analysis , 2002, IEEE Trans. Pattern Anal. Mach. Intell..

[3]  Leszek Wojnar,et al.  Image Analysis , 1998 .

[4]  Kentaro Toyama,et al.  Wallflower: principles and practice of background maintenance , 1999, Proceedings of the Seventh IEEE International Conference on Computer Vision.

[5]  Liyuan Li,et al.  Integrating intensity and texture differences for robust change detection , 2002, IEEE Trans. Image Process..

[6]  Javier Ruiz-del-Solar,et al.  Temporal Dynamical Interactions between Multiple Layers of Local Image Features for Event Detection in Video Sequences , 2003, SCIA.

[7]  Roberto Manduchi,et al.  Bilateral filtering for gray and color images , 1998, Sixth International Conference on Computer Vision (IEEE Cat. No.98CH36271).

[8]  Alex Pentland,et al.  A Bayesian Computer Vision System for Modeling Human Interaction , 1999, ICVS.

[9]  W. Eric L. Grimson,et al.  Learning Patterns of Activity Using Real-Time Tracking , 2000, IEEE Trans. Pattern Anal. Mach. Intell..