Planning Aims for a Network of Horizontal and Overhead Sensors

This paper considers the problem of planning sensor observations for a network of overhead sensors which will resolve ambiguities in the output of a horizontal sensor network. Specifically, we address the problem of counting the number of objects detected by the horizontal sensor network, using the overhead network to aim at specific areas to improve the count. The main theme of our results is that, even though observation planning is intractable for such a network, a simple, greedy algorithm for controlling the overhead sensors guarantees performance with bounded and reasonable suboptimality. Our results are general and make few assumptions about the specific sensors used. The techniques described in this paper can be used to plan sensor aims for a wide variety of sensor types and counting problems.

[1]  Andreas Krause,et al.  Near-optimal sensor placements in Gaussian processes , 2005, ICML.

[2]  Leonidas J. Guibas,et al.  Counting people in crowds with a real-time network of simple image sensors , 2003, Proceedings Ninth IEEE International Conference on Computer Vision.

[3]  Marek Chrobak,et al.  A Linear-Time Algorithm for Drawing a Planar Graph on a Grid , 1995, Inf. Process. Lett..

[4]  A. Laurentini,et al.  The Visual Hull Concept for Silhouette-Based Image Understanding , 1994, IEEE Trans. Pattern Anal. Mach. Intell..

[5]  Osama Masoud,et al.  A novel method for tracking and counting pedestrians in real-time using a single camera , 2001, IEEE Trans. Veh. Technol..

[6]  Ramakant Nevatia,et al.  Tracking multiple humans in crowded environment , 2004, Proceedings of the 2004 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2004. CVPR 2004..

[7]  Peter H. Tu,et al.  Detecting and counting people in surveillance applications , 2005, IEEE Conference on Advanced Video and Signal Based Surveillance, 2005..

[8]  Edwin K. P. Chong,et al.  Sensor scheduling for target tracking: A Monte Carlo sampling approach , 2006, Digit. Signal Process..

[9]  M. L. Fisher,et al.  An analysis of approximations for maximizing submodular set functions—I , 1978, Math. Program..

[10]  Robert J. Fowler,et al.  Optimal Packing and Covering in the Plane are NP-Complete , 1981, Inf. Process. Lett..

[11]  Joseph O'Rourke,et al.  Some NP-hard polygon decomposition problems , 1983, IEEE Trans. Inf. Theory.

[12]  Jouko Lampinen,et al.  Rao-Blackwellized particle filter for multiple target tracking , 2007, Inf. Fusion.