In some applications using visual sensor networks (VSNs), the facing directions of targets are bounded. Therefore existing full-viewcoverage (all the facing directions of a target constitutes a disk) is not necessary...
详细信息
In some applications using visual sensor networks (VSNs), the facing directions of targets are bounded. Therefore existing full-viewcoverage (all the facing directions of a target constitutes a disk) is not necessary. We propose a novel model called beta-viewcoverage model through which only necessary facing directions of a target are effectively viewed. This model uses much fewer cameras than those used by full-viewcoverage model. Based on beta-viewcoverage model, a new problem called beta-view covered target maximisation (BVCTM) problem is proposed to maximise the number of beta-view covered targets given some fixed and freely rotatable camera sensors. We prove its NP-hardness and transform it into an Integer Linear Programming problem equivalently. Besides, a (1 - e(-1))-factor approximate algorithm and a camera-utility based greedy algorithm are given for this problem. Finally, we conduct many experiments and investigate the influence of many parameters on these two algorithms.
暂无评论