Art gallery theorems and algorithms
Art gallery theorems and algorithms
Computational geometry: algorithms and applications
Computational geometry: algorithms and applications
Exposure in wireless sensor networks: theory and practical solutions
Wireless Networks
The coverage problem in a wireless sensor network
WSNA '03 Proceedings of the 2nd ACM international conference on Wireless sensor networks and applications
Counting People in Crowds with a Real-Time Network of Simple Image Sensors
ICCV '03 Proceedings of the Ninth IEEE International Conference on Computer Vision - Volume 2
Minimal and maximal exposure path algorithms for wireless embedded sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
Differentiated surveillance for sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
Set k-cover algorithms for energy efficient monitoring in wireless sensor networks
Proceedings of the 3rd international symposium on Information processing in sensor networks
Convex Optimization
On k-coverage in a mostly sleeping sensor network
Proceedings of the 10th annual international conference on Mobile computing and networking
Worst and Best-Case Coverage in Sensor Networks
IEEE Transactions on Mobile Computing
A line in the sand: a wireless sensor network for target detection, classification, and tracking
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue: Military communications systems and technologies
Barrier coverage with wireless sensors
Proceedings of the 11th annual international conference on Mobile computing and networking
SensEye: a multi-tier camera sensor network
Proceedings of the 13th annual ACM international conference on Multimedia
Virtual patrol: a new power conservation design for surveillance using sensor networks
IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
Automated camera layout to satisfy task-specific and floor plan-specific coverage requirements
Computer Vision and Image Understanding - Special issue on omnidirectional vision and camera networks
Distributed metric calibration of ad hoc camera networks
ACM Transactions on Sensor Networks (TOSN)
A distributed algorithm for managing multi-target identities in wireless ad-hoc sensor networks
IPSN'03 Proceedings of the 2nd international conference on Information processing in sensor networks
Design and analysis of wave sensing scheduling protocols for object-tracking applications
DCOSS'05 Proceedings of the First IEEE international conference on Distributed Computing in Sensor Systems
Image and Vision Computing
Energy efficient learning solution for intrusion detection in wireless sensor networks
COMSNETS'10 Proceedings of the 2nd international conference on COMmunication systems and NETworks
Low power or high performance? a tradeoff whose time has come (and nearly gone)
EWSN'12 Proceedings of the 9th European conference on Wireless Sensor Networks
| Hi-index | 0.00 |
The problem we address in this paper is how to detect an intruder moving through a polygonal space that is equipped with a camera sensor network. We propose a probabilistic sensor tasking algorithm in which cameras sense the environment independently of one another, thus reducing the communication overhead. Since constant monitoring is prohibitively expensive with complex sensors such as cameras, the amount of sensing done is also minimized. To be effective, a minimum detection probability must be guaranteed by the system over all possible paths through the space. The straightforward approach of enumerating all such paths is intractable, since there is generally an infinite number of potential paths. Using a geometric decomposition of the space, we lowerbound the detection probability over all paths using a small number of linear constraints. The camera tasking is computed for set of example layouts and shows large performance gains with our probabilistic scheme over both constant monitoring as well as over a deterministic heuristic.