Automated camera layout to satisfy task-specific and floor plan-specific coverage requirements
Automated camera layout to satisfy task-specific and floor plan-specific coverage requirements
复制标题
DOI：
10.1016/j.cviu.2006.06.005
复制
发表时间：
2006-09-01
影响因子：
4.5
通讯作者：
Sclaroff, Stan
中科院分区：
文献类型：
--
作者：
Erdem, Ugur Murat;Sclaroff, Stan
在许多多摄像机视觉系统中，摄像机位置对特定任务的服务质量的影响被忽略了。计算几何领域的研究人员已经提出了一些传感器定位问题的优雅解决方案。不幸的是，这些解决方案对相机的功能使用了不切实际的假设，使得这些算法不适合许多现实世界的计算机视觉应用。在本文中，首先用与现实世界摄像机的能力更一致的假设来定义一般摄像机放置问题。由照相机观察的区域可以是体积的、静态的或动态的，并且可以包括孔。这个一般性问题的一个子类可以用建筑平面图中典型的平面区域来表述。给定要观察的平面图，问题是如何可靠地计算相机布局，以满足特定任务的约束。通过离散问题空间上的二值优化得到了该问题的解。在实验中，用不同的室内和室外平面图对系统的性能进行了验证。(c) 2006爱思唯尔公司版权所有。
In many multi-camera vision systems the effect of camera locations on the task-specific quality of service is ignored. Researchers in Computational Geometry have proposed elegant solutions for some sensor location problem classes. Unfortunately, these solutions use unrealistic assumptions about the cameras' capabilities that make these algorithms unsuitable for many real world computer vision applications. In this paper, the general camera placement problem is first defined with assumptions that are more consistent with the capabilities of real world cameras. The region to be observed by cameras may be volumetric, static or dynamic, and may include holes. A subclass of this general problem can be formulated in terms of planar regions that are typical of building floor plans. Given a floor plan to be observed, the problem is then to reliably compute a camera layout such that certain task-specific constraints are met. A solution to this problem is obtained via binary optimization over a discrete problem space. In experiments the performance of the resulting system is demonstrated with different real indoor and outdoor floor plans. (c) 2006 Elsevier Inc. All rights reserved.