4 May 2020 in IEEE Sensors Journal
Efficient placement of cameras to perform surveillance tasks has a significant impact on the overall performance as well as cost of video surveillance systems. Identifying an optimal configuration for cameras in a surveillance system to maximize coverage is a combinatorial optimization problem. This paper proposes two algorithms for identifying optimal camera configuration for a multi-camera network with predefined camera locations. We propose an Alternate Global Greedy (AGG) algorithm, a novel variant of the Global Greedy algorithm by making significant modifications to the traditional execution strategy to produce better coverage results. Additionally, we propose an innovative Greedy Grid Voting (GGV) algorithm, which gives preference to cover unique as well as critical regions and effectively addresses a broad range of coverage scenarios mandated by the application. The proposed algorithms are validated on map images across diverse scenarios with predefined camera locations. Experimental results show that our algorithms maximize the coverage results with minimal overlap, compared to the existing greedy techniques.
30 September 2024 in Biomedical Signal Processing and Control
1 September 2011 in Computer
The ability to identify people and answer questions about their where abouts in a cyberphysical space is critical to many applications. Integrating recognition with spatiotemporal reasoning enhances the overall performance of information retrieval.
5 August 2022 in IEEE Transactions on Systems, Man, and Cybernetics: Systems
Efficient deployment of cameras optimizes the costs and benefits in a multicamera surveillance network. Most camera placement algorithms are developed for surveillance regions with predefined camera locations, where optimal orientation for every given camera location is determined to maximize coverage. The existing approaches to optimizing the number of cameras, locations, and orientations focus on specific scenarios and are neither generic nor scalable across diverse surveillance scenarios. This article proposes a generic and scalable reward penalty score (RPS) algorithm for optimal camera placement in diverse indoor and outdoor scenarios to efficiently attain a specified coverage requirement. The camera placement decision is driven by maximizing total coverage over the surveillance region with a minimum number of cameras at optimal locations and orientations. Based on the RPS algorithm, we extend the existing Greedy grid voting (GGV) algorithm that was limited to optimizing camera orientations for predefined locations. The extended GGV (EGGV) algorithm is broader in scope and optimizes the number of cameras, their locations, and orientations. Overall, the RPS algorithm produces superior coverage results over indoor and outdoor scenarios compared to the existing camera placement algorithms on map images of diverse surveillance scenarios ranging from small to large.
10 March 2010 in Personal and Ubiquitous Computing
8 March 2022 in IEEE Sensors Journal
The optimal placement of surveillance cameras to maximize the total coverage of camera networks is of significant research interest due to the proliferation of camera networks in diverse application scenarios. Existing camera placement algorithms are mostly designed to optimize coverage. In the event of failure of one or more cameras, these optimization algorithms reorient all the remaining cameras in the surveillance network to regain the lost coverage; and hence are not cost-effective. A simple and straightforward solution to regain the lost coverage is by reorienting the field of view of active cameras to overlap with those of the damaged cameras. In this paper, we propose the Visibility Graph Reduction (VGR) algorithm, a novel graph-based approach to select potential cameras amongst the active cameras, that can optimally alleviate the loss in coverage resulting from the failure of one or more cameras. We validate our algorithm on map images across diverse indoor and outdoor surveillance scenarios with existing camera networks. Experimental results show that our algorithm minimizes the number of cameras that need to be reoriented, and produces similar coverage results as that of reorientating all the available active cameras in the surveillance network. Our approach is both cost-effective and computationally efficient, and thus minimizes the human effort involved in reorienting cameras across practical scenarios.