Solving Optimal Camera Placement Problems in IoT Using LH-RPSO

Abstract

With the increasing need for public security and intelligent life and the development of Internet of Things (IoT), the structure and application of vision sensor network are becoming more and more complex. It is no longer a system with simple static monitoring, but a complex system that can be used for intelligent processing, such as target localization, identification, tracking and so on. In order to accomplish various tasks efficiently, it is important to determine the deployment plan of camera network in advance. Many researches discretize the optimal camera placement problem into a binary integer programming (BIP) problem, which is NP-hard, and put forward some approximate solutions including greedy heuristics, semi-definite programming, simulated annealing, etc. In practice, however, camera parameters include both continuous values (location and orientation) and discrete values (camera type). To get a much more accurate result, we do not discretize the continuous camera parameters any more, on the contrary, we handle the continuous values in continuous domain directly. Meanwhile, a Latin Hypercube based Resampling Particle Swarm Optimization (LH-RPSO) algorithm is proposed to effectively solve the problem. To validate the proposed algorithm, we compared it with standard Particle Swarm Optimization (PSO) and Resampling Particle Swarm Optimization (RPSO). Simulation results for an outdoor planar regions illustrated the efficiency of the proposed algorithm.