3 May 2012 Robust tracking and anomaly detection in video surveillance sequences
Author Affiliations +
In this paper, the authors examine the problem of tracking people in both bright and dark video sequences. In particular, this problem is treated as a background/foreground decomposition problem, where the static part corresponds to the background, and moving objects to the foreground. Having this into account, the problem is formulated as a rank minimization problem of the form X = L + S + E, where X is the captured scene, L is the low-rank part (background), S is the sparse part (foreground) and E is the corrupting uniform noise introduced in the capture process. Actually, low-rank and sparse structures are widely studied and some areas such as Robust Principal Component Analysis (RPCA) and Matrix Completion (MC) have emerged to solve this kind of problems. Here we compare the performance of three different methods in solving the RPCA optimization problem for background separation: augmented lagrange multiplier method, Bayesian markov dependency method, and bilateral random projections method. Furthermore, a preprocessing light normalization stage and a mathematical morphology based post-processing stage are proposed to obtain better results.
© (2012) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Hoover F. Rueda, Hoover F. Rueda, Luisa F. Polania, Luisa F. Polania, Kenneth E. Barner, Kenneth E. Barner, } "Robust tracking and anomaly detection in video surveillance sequences", Proc. SPIE 8360, Airborne Intelligence, Surveillance, Reconnaissance (ISR) Systems and Applications IX, 83600F (3 May 2012); doi: 10.1117/12.919506; https://doi.org/10.1117/12.919506


Salient region detection for object tracking
Proceedings of SPIE (May 08 2012)
Logical unit and scene detection: a comparative survey
Proceedings of SPIE (January 27 2008)
Real-time people counting system using a single video camera
Proceedings of SPIE (February 25 2008)

Back to Top