Efficient intensity map splitting algorithms for intensity-modulated radiation therapy

被引:0
|
作者
Wu, Xiaodong [1 ]
机构
[1] Univ Iowa, Dept Radiat Oncol, Dept Elect & Comp Engn, Iowa City, IA 52242 USA
关键词
intensity map splitting; kappa-link shortest paths; algorithms; IMRT; computational medicine;
D O I
10.1016/j.ipi.2007.11.008
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
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 kappa-link shortest path in a directed acyclic graph. We carefully characterize the intrinsic structures of the graph, yielding efficient algorithms for the IMSp problems. (c) 2007 Elsevier B.V. All rights reserved.
引用
收藏
页码:188 / 194
页数:7
相关论文
共 50 条