首页> 美国卫生研究院文献>Sensors (Basel Switzerland) >Optimal Camera Pose and Placement Configuration for Maximum Field-of-View Video Stitching
【2h】

Optimal Camera Pose and Placement Configuration for Maximum Field-of-View Video Stitching

机译:最佳摄像机姿势和放置配置以实现最大视野的视频拼接

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

An optimal camera placement problem is investigated. The objective is to maximize the area of the field of view (FoV) of a stitched video obtained by stitching video streams from an array of cameras. The positions and poses of these cameras are restricted to a given set of selections. The camera array is designed to be placed inside the abdomen to support minimally invasive laparoscopic surgery. Hence, a few non-traditional requirements/constraints are imposed: Adjacent views are required to overlap to support image registration for seamless video stitching. The resulting effective FoV should be a contiguous region without any holes and should be a convex polygon. With these requirements, traditional camera placement algorithms cannot be directly applied to solve this problem. In this work, we show the complexity of this problem grows exponentially as a function of the problem size, and then present a greedy polynomial time heuristic solution that approximates well to the globally optimal solution. We present a new approach to directly evaluate the combined coverage area (area of FoV) as the union of a set of quadrilaterals. We also propose a graph-based approach to ensure the stitching requirement (overlap between adjacent views) is satisfied. We present a method to find a convex polygon with maximum area from a given polygon. Several design examples show that the proposed algorithm can achieve larger FoV area while using much less computing time.
机译:研究了最佳相机放置问题。目的是最大化通过拼接来自摄像机阵列的视频流而获得的拼接视频的视场(FoV)区域。这些摄像机的位置和姿势仅限于给定的一组选择。摄像机阵列设计为放置在腹部内,以支持微创腹腔镜手术。因此,强加了一些非传统的要求/约束​​:相邻视图需要重叠以支持用于无缝视频拼接的图像配准。产生的有效FoV应该是没有任何孔的连续区域,并且应该是凸多边形。由于这些要求,传统的相机放置算法无法直接应用来解决此问题。在这项工作中,我们显示了此问题的复杂性随问题大小的增长呈指数增长,然后提出了一个贪婪的多项式时间启发式解决方案,该解决方案非常接近于全局最优解。我们提出了一种直接评估组合覆盖范围(FoV的面积)的新方法,将其作为一组四边形的并集。我们还提出了一种基于图的方法,以确保满足拼接要求(相邻视图之间的重叠)。我们提出一种从给定多边形中查找具有最大面积的凸多边形的方法。几个设计实例表明,所提出的算法可以实现较大的FoV面积,同时使用更少的计算时间。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号