首页> 外文会议>Detection and Sensing of Mines, Explosive Objects, and Obscured Targets XX >Unsupervised 3D Scene Understanding and Prediction to Enable Adaptable Solutions to the Art Gallery Problem and Watchman Route Problem
【24h】

Unsupervised 3D Scene Understanding and Prediction to Enable Adaptable Solutions to the Art Gallery Problem and Watchman Route Problem

机译:无监督的3D场景理解和预测,可为美术馆问题和看守路线问题提供适应性解决方案

获取原文
获取原文并翻译 | 示例

摘要

The art gallery problem (AGP) asks the question: "How can we place a small set of sensors to provide maximum coverage of an observed environment?" The watchman route problem (WRP) operates in conjunction with the AGP by asking the question "How do we create the shortest route between AGP-solving positions?" The objective of this work is to provide a means of assessing where to place both static and mobile sensors in order to solve the AGP and WRP, respectively, while adapting subsequent AGP/WRP-solutions in anticipation of future events. We can fulfill this objective by 1) extracting a 3D point cloud representation of the item of interest (IOI) to be surveiled in a video frame, 2) determine highest probability anticipated behavior by the IOI based upon training data and 3) incorporate the information gained from items 1 and 2 in order to obtain approximate solutions to the AGP and WRP using the respective Sensor Placement Optimization via Queries (SPOQ) and the Photon-mapping-informed active-Contour Route Designator (PICRD) algorithms. In this paper, we show how to obtain the requirements embodied in items 1, 2 and 3 and thus fulfill our objective.
机译:美术馆问题(AGP)提出了一个问题:“我们如何放置一小组传感器以最大程度地覆盖观察到的环境?”守卫路线问题(WRP)与AGP结合使用,它提出以下问题:“我们如何在AGP解决位置之间建立最短路线?”这项工作的目的是提供一种评估静态传感器和移动传感器的位置的方法,以便分别解决AGP和WRP的问题,同时针对以后的事件调整后续的AGP / WRP解决方案。我们可以通过以下方式实现此目标:1)提取要在视频帧中监视的感兴趣项(IOI)的3D点云表示; 2)IOI根据训练数据确定最高概率的预期行为; 3)合并信息为了获得AGP和WRP的近似解,可以使用第1条和第2条中的第1条和第2条获得的解决方案,分别使用通过查询的传感器放置优化(SPOQ)和光子映射通知的主动轮廓路线指示符(PICRD)算法。在本文中,我们展示了如何获得第1、2和3项中体现的要求,从而实现我们的目标。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号