首页> 外文学位 >Obstacle-avoiding similarity metrics and shortest path problems.
【24h】

Obstacle-avoiding similarity metrics and shortest path problems.

机译:避免障碍的相似性度量标准和最短路径问题。

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

摘要

Similarity metrics are functions that measure the similarity of geometric objects. The motivation for studying similarity metrics is that these functions are essential building blocks for areas such as computer vision, robotics, medical imaging, and drug design. Although similarity metrics are traditionally computed in environments without obstacles, we use shortest paths to compute similarity metrics in simple polygons, in polygons with polygonal holes, and on polyhedral surfaces. We measure the length of a path either by Euclidean distance or by the number of turns on the path.We also compute shortest paths that steer a medical needle through a sequence of treatment points in the plane. This technique could be used in biopsy procedures to take multiple tissue samples with a single puncture of the skin. Such an algorithm could also be applied to brachytherapy procedures that implant radioactive pellets at many cancerous locations. Computing shortest paths for medical needles is a challenging problem because medical needles cut through tissue along circular arcs and have a limited ability to turn. Although optimal substructure can fail, we compute globally optimal paths with a wavefront propagation technique.
机译:相似性度量是测量几何对象相似性的函数。研究相似性指标的动机是,这些功能是计算机视觉,机器人技术,医学成像和药物设计等领域的重要组成部分。尽管传统上相似性度量是在没有障碍的环境中计算的,但是我们使用最短路径来计算简单多边形,具有多边形孔的多边形以及多面体表面上的相似性度量。我们可以通过欧式距离或路径匝数来测量路径的长度,还可以计算出最短的路径,这些路径可以引导医用针头穿过平面上的一系列治疗点。这项技术可用于活检过程中,一次穿刺即可采集多个组织样本。这样的算法也可以应用于在许多癌性部位植入放射性小丸的近距离放射治疗程序。计算医用针头的最短路径是一个具有挑战性的问题,因为医用针头沿着圆弧切穿组织并且转动能力有限。尽管最佳子结构可能会失败,但我们使用波前传播技术来计算全局最佳路径。

著录项

  • 作者

    Cook, Atlas F., IV.;

  • 作者单位

    The University of Texas at San Antonio.;

  • 授予单位 The University of Texas at San Antonio.;
  • 学科 Computer Science.
  • 学位 Ph.D.
  • 年度 2009
  • 页码 134 p.
  • 总页数 134
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号