Journal of Mathematical Imaging and Vision

, Volume 48, Issue 1, pp 160–175

SCOOP: A Real-Time Sparsity Driven People Localization Algorithm

  • Mohammad Golbabaee
  • Alexandre Alahi
  • Pierre Vandergheynst
Article

DOI: 10.1007/s10851-012-0405-4

Cite this article as:
Golbabaee, M., Alahi, A. & Vandergheynst, P. J Math Imaging Vis (2014) 48: 160. doi:10.1007/s10851-012-0405-4

Abstract

Detecting and tracking people in scenes monitored by cameras is an important step in many application scenarios such as surveillance, urban planning or behavioral studies to name a few. The amount of data produced by camera feeds is so large that it is also vital that these steps be performed with the utmost computational efficiency and often even real-time. We propose SCOOP, a novel algorithm that reliably localizes people in camera feeds, using only the output of a simple background removal technique. SCOOP can handle a single or many video feeds. At the heart of our technique there is a sparse model for binary motion detection maps that we solve with a novel greedy algorithm based on set covering. We study the convergence and performance of the algorithm under various degradation models such as noisy observations and crowded environments, and we provide mathematical and experimental evidence of both its efficiency and robustness using standard datasets. This clearly shows that SCOOP is a viable alternative to existing state-of-the-art people localization algorithms, with the marked advantage of real-time computations.

Keywords

People localization Sparse representation Dictionary Multi-view Greedy algorithm Matching pursuit SCOOP Group testing 

Copyright information

© Springer Science+Business Media New York 2012

Authors and Affiliations

  • Mohammad Golbabaee
    • 1
  • Alexandre Alahi
    • 1
  • Pierre Vandergheynst
    • 1
  1. 1.Signa Processing Lab (LTS2)EPFLLausanneSwitzerland