Approximating Optimal Visual Sensor Placement
暂无分享,去创建一个
Many novel multimedia applications use visual sensor arrays. In this paper we address the problem of optimally placing multiple visual sensors in a given space. Our linear programming approach determines the minimum number of cameras needed to cover the space completely at a given sampling frequency. Simultaneously it determines the optimal positions and poses of the visual sensors. We also show how to account for visual sensors with different properties and costs if more than one kind is available, and report performance results.
[1] Ning Zhong,et al. Efficient point coverage in wireless sensor networks , 2006, J. Comb. Optim..
[2] Sartaj Sahni,et al. Algorithms for Wireless Sensor Networks , 2005, Int. J. Distributed Sens. Networks.
[3] J. O'Rourke. Art gallery theorems and algorithms , 1987 .
[4] S. Sitharama Iyengar,et al. Grid Coverage for Surveillance and Target Location in Distributed Sensor Networks , 2002, IEEE Trans. Computers.