当前位置: X-MOL 学术Inf. Process. Lett. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Efficient Intensity Map Splitting Algorithms for Intensity-Modulated Radiation Therapy.
Information Processing Letters ( IF 0.5 ) Pub Date : 2008-01-31 , DOI: 10.1016/j.ipl.2007.11.008
Xiaodong Wu 1
Affiliation  

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-link 最短路径。我们仔细描述了图的内在结构,为 IMSp 问题产生了有效的算法。
更新日期:2019-11-01
down
wechat
bug