%0 Conference Paper
%B Robotics and Automation, 2009. ICRA '09. IEEE International Conference on
%D 2009
%T Assigning cameras to subjects in video surveillance systems
%A El-Alfy,H.
%A Jacobs, David W.
%A Davis, Larry S.
%K agent
%K algorithm;multiple
%K assignment;computation
%K augmenting
%K cameras;video
%K cost
%K detection;video
%K graph;camera
%K MATCHING
%K matching;minimum
%K matching;target
%K path;bipartite
%K reduction;maximum
%K segment;video
%K Surveillance
%K surveillance;
%K system;graph
%K theory;image
%K TIME
%K tracking;obstacle
%K tracking;video
%K video
%X We consider the problem of tracking multiple agents moving amongst obstacles, using multiple cameras. Given an environment with obstacles, and many people moving through it, we construct a separate narrow field of view video for as many people as possible, by stitching together video segments from multiple cameras over time. We employ a novel approach to assign cameras to people as a function of time, with camera switches when needed. The problem is modeled as a bipartite graph and the solution corresponds to a maximum matching. As people move, the solution is efficiently updated by computing an augmenting path rather than by solving for a new matching. This reduces computation time by an order of magnitude. In addition, solving for the shortest augmenting path minimizes the number of camera switches at each update. When not all people can be covered by the available cameras, we cluster as many people as possible into small groups, then assign cameras to groups using a minimum cost matching algorithm. We test our method using numerous runs from different simulators.
%B Robotics and Automation, 2009. ICRA '09. IEEE International Conference on
%P 837 - 843
%8 2009/05//
%G eng
%R 10.1109/ROBOT.2009.5152753