Optimal Coverage of Camera Networks Using PSO Algorithm

摘要：

In a camera network, one fundamental research issue is how well the target field is monitored, which is referred as the coverage problem. A good coverage method can reduce the cost and allow the monitor system to scale. The existing work on coverage problem use the k-coverage as its model and coverage percentage as its optimal metric. With this model and metric, there have been many optimal algorithms to solve this coverage problem. In this paper, we first propose a Binary Integer Programming (BIP) approach and a Hierarchical approach. This two algorithms both are time-consumer. Then we use particle swarm optimization (PSO) algorithm to solve the coverage problem and find that by PSO algorithm we can get a near-optimal solution with a higher real-time quality. Finally we compare the PSO algorithm and the Hierarchical approach by simulation.

关键词： coverage camera network BIP Hierarchical PSO

作者: Pu Zhou Chengnian Long

作者单位: Shanghai Jiao Tong University, Shanghai,China Shanghai Jiao Tong University,Shanghai, China

会议类型: 国际会议

会议名称: 2011 4th International Congress on Image and Signal Processing(第四届图像与信号处理国际学术会议 CISP 2011)

会议地点: 上海

会议语种:英文

页码: 2117-2121

在线出版日期: 2011-10-15（万方平台首次上网日期，不代表论文的发表时间）