Designing Camera Networks by Convex Quadratic Programming
Designing Camera Networks by Convex Quadratic Programming
复制标题
通过凸二次规划设计相机网络
DOI：
--
复制
发表时间：
2015
期刊：
影响因子：
--
通讯作者：
Peter Wonka
中科院分区：
文献类型：
--
作者：
Bernard Ghanem;Yuanhao Cao;Peter Wonka
在本文中，我们研究了计算机图形和计算机视觉应用中的自动相机放置问题。我们通过提出一种结合可见性约束和相机到相机关系的新颖方法来扩展之前工作的问题表述。例如，可以鼓励放置解决方案使用从不同观看方向对相同重要位置进行成像的摄像机，这可以使重建和监视任务更好地执行。我们证明，一般的相机放置问题可以在数学上表述为线性约束下的凸二元二次规划（BQP）。此外，我们提出了一种在速度和解决方案质量之间进行有利权衡的优化策略。我们的解决方案几乎与问题的贪婪处理一样快，但质量明显更高，以至于它可以与需要更多数量级计算时间的精确解决方案相媲美。因为它在计算上很有吸引力，所以我们的方法还允许用户探索输入参数变化的解决方案空间。为了评估其有效性，我们在现实世界的平面图（车库、酒店、购物中心和机场）上展示了一系列 3D 结果。
In this paper, we study the problem of automatic camera placement for computer graphics and computer vision applications. We extend the problem formulations of previous work by proposing a novel way to incorporate visibility constraints and camera‐to‐camera relationships. For example, the placement solution can be encouraged to have cameras that image the same important locations from different viewing directions, which can enable reconstruction and surveillance tasks to perform better. We show that the general camera placement problem can be formulated mathematically as a convex binary quadratic program (BQP) under linear constraints. Moreover, we propose an optimization strategy with a favorable trade‐off between speed and solution quality. Our solution is almost as fast as a greedy treatment of the problem, but the quality is significantly higher, so much so that it is comparable to exact solutions that take orders of magnitude more computation time. Because it is computationally attractive, our method also allows users to explore the space of solutions for variations in input parameters. To evaluate its effectiveness, we show a range of 3D results on real‐world floorplans (garage, hotel, mall, and airport).