首页> 美国卫生研究院文献>other >Efficient Intensity Map Splitting Algorithms for Intensity-Modulated Radiation Therapy
【2h】

Efficient Intensity Map Splitting Algorithms for Intensity-Modulated Radiation Therapy

机译:强度调制放射治疗的有效强度图分割算法

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

摘要

In this paper, we study several interesting intensity map splitting (IMSp) problems that arise in Intensity-Modulated Radiation Therapy (IMRT), a state-of-the-art radiation therapy technique for cancer treatments. In current clinical practice, a multi-leaf collimator (MLC) with a maximum leaf spread is used to deliver the prescribed intensity maps (IMs). However, the maximum leaf spread of an MLC may require that a large intensity map be split into several abutting sub-IMs each being delivered separately, which results in prolonged treatment time. Few IM splitting techniques reported in the literature have addressed the issue of treatment delivery efficiency for large IMs. We develop a unified approach for solving the IMSp problems while minimizing the total beam-on time in various settings. Our basic idea is to formulate the IMSp problem as computing a k-link shortest path in a directed acyclic graph. We carefully characterize the intrinsic structures of the graph, yielding efficient algorithms for the IMSp problems.
机译:在本文中,我们研究了强度调制放射治疗(IMRT)中出现的一些有趣的强度图分裂(IMSp)问题,这是一种用于癌症治疗的最新放射治疗技术。在当前的临床实践中,具有最大叶展的多叶准直仪(MLC)用于提供规定的强度图(IM)。但是,MLC的最大叶展度可能需要将大的强度图分成几个相邻的子IM,每个子IM分别发送,这会延长治疗时间。文献中报道的IM分割技术很少解决大型IM的治疗输送效率问题。我们开发出一种统一的方法来解决IMSp问题,同时最大程度地减少各种设置下的总光束接通时间。我们的基本思想是将IMSp问题公式化为计算有向无环图中的k链接最短路径。我们仔细描述了图的内在结构,从而为IMSp问题提供了有效的算法。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号