The use of visual sensors is flourishing, driven among others by the several applications in detection and prevention of crimes or dangerous events. While the problem of optimal camera placement for total coverage has been solved for a decade or so, that of the arrangement of cameras maximizing the recognition of objects "in-transit" is still open. The objective of this paper is to attack this problem by providing an adversarial method of proven optimality based on the resolution of Hamilton-Jacobi equations. The problem is attacked by first assuming the perspective of an adversary, i.e. computing explicitly the path minimizing the probability of detection and the quality of reconstruction. Building on this result, we introduce an optimality measure for camera configurations and perform a simulated annealing algorithm to find the optimal camera placement.

翻译：视觉传感器的使用正在蓬勃发展,除其他之外,这是在侦查和预防犯罪或危险事件的若干应用中推动的。虽然在十年左右的时间里已经解决了为全面覆盖而安装最佳摄像头的问题,但为最大限度地承认“中转”物体而安排照相机的问题仍然开放。本文件的目的是根据汉密尔顿-雅科比方程式的解决,提供经证明最优化的对抗方法来解决这一问题。问题首先通过假设对手的观点来应对,即明确计算最大限度地减少探测概率和重建质量的途径。在此结果的基础上,我们为摄像头配置引入了最佳措施,并进行了模拟肛门算法,以找到最佳的摄像器位置。