We study the problem of visibility-based exploration, reconstruction and surveillance in the context of supervised learning. Using a level set representation of data and information, we train a convolutional neural network to determine vantage points that maximize visibility. We show that this method drastically reduces the on-line computational cost and determines a small set of vantage points that solve the problem. This enables us to efficiently produce highly-resolved and topologically accurate maps of complex 3D environments. We present realistic simulations on 2D and 3D urban environments.
propose an alternating minimization scheme for optimizing the visibility of @math observers @cite_25 . use a system of differential equations to optimize the location and orientation of @math sensors to maximize surveillance @cite_6 . Both works assume the number of sensors is given.
@cite_25 @cite_6
2962862065 2141442361
We propose a computational method to optimally position a sensor system. Each sensor has limited range and viewing angle, and it may fail with a certain failure rate. The goal is to find the optimal locations as well as the viewing directions of all the sensors and achieve the maximal surveillance of the known environment. We set up the problem using the level set framework. Both the environment and the viewing range of the sensors are represented by level set functions. Then we solve a system of ordinary differential equations (ODEs) to find the optimal viewing directions and locations of all sensors together. Furthermore, we use the intermittent diffusion, which converts the ODEs into stochastic differential equations, to find the global maximum of the total surveillance area. The numerical examples include various failure rates of sensors, different rates of importance of the surveillance region, and 3-dimensional setups. They show the effectiveness of the proposed method. This paper presents a novel decision-theoretic approach to control and coordinate multiple active cameras for observing a number of moving targets in a surveillance system. This approach offers the advantages of being able to (a) account for the stochasticity of targets' motion via probabilistic modeling, and (b) address the trade-off between maximizing the expected number of observed targets and the resolution of the observed targets through stochastic optimization. One of the key issues faced by existing approaches in multi-camera surveillance is that of scalability with increasing number of targets. We show how its scalability can be improved by exploiting the problem structure: as proven analytically, our decision-theoretic approach incurs time that is linear in the number of targets to be observed during surveillance. As demonstrated empirically through simulations, our proposed approach can achieve high-quality surveillance of up to 50 targets in real time and its surveillance performance degrades gracefully with increasing number of targets. We also demonstrate our proposed approach with real AXIS 214 PTZ cameras in maximizing the number of Lego robots observed at high resolution over a surveyed rectangular area. The results are promising and clearly show the feasibility of our decision-theoretic approach in controlling and coordinating the active cameras in real surveillance system.