A Sparsity Constrained Inverse Problem to Locate People in a Network of Cameras
A novel approach is presented to locate dense crowd of people in a network of fixed cameras given the severely degraded background subtracted silhouettes. The problem is formulated as a sparsity constrained inverse problem using an adaptive dictionary constructed on- line. The framework has no constraint on the number of cameras neither on the surface to be monitored. Even with a single camera, partially occluded and grouped people are correctly detected and segmented. Qualitative results are presented in indoor and outdoor scenes.
atoms.jpg
openaccess
6.86 KB
JPEG
a832439c062ab2b36956cbc2958b4e0b
dsp09.pdf
openaccess
1.33 MB
Adobe PDF
f635e8857c6c82badec100fd99c3e76e