arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1612.01362math.OC
收藏

IMRT Optimization的C-VaR型约束逐次逼近

A Successive LP Approach with C-VaR Type Constraints for IMRT Optimization

Shogo Kishimoto, Makoto Yamashita

摘要:

放射治疗被认为是癌症的重要治疗方案之一。放射治疗使用几束电离辐射来杀死癌症肿瘤,但这种辐射也会对正常组织造成损伤。因此,治疗计划应满足剂量体积约束(DVC)。调强放射治疗(IMRT)能够控制射束强度,并为治疗计划提供更大的灵活性,以满足DVC。Romeijn等人(2003)用C-VaR(Conditional Value-at-Risk)型约束代替IMRT优化中的DVC,并提出了一种基于线性规划(LP)的数值方法。他们的方法降低了原始DVC的计算成本,但他们的LP问题的可行域比DVC窄得多,因此,他们的方法往往无法找到一个可行的计划,即使DVC不是那么紧。在本文中,我们提出了一个连续的LP方法与C-VaR型约束。我们从LP问题的解中检测出离群值,并将其从C-VaR型约束的域中移除。这降低了C-VaR类型约束对离群值的敏感性,我们可以从更广泛的区域搜索可行的计划。此外,我们可以给出一个数学证明,如果所提出的方法中的LP问题的最优值是非正的,相应的最优解满足所有的DVC。从测试数据集上的数值实验,我们观察到,我们的方法发现可行解比现有的LP方法更适当。此外,我们的方法需要较少的LP问题,这导致了较短的计算时间。

英文摘要:

Radiation therapy is considered to be one of important treatment protocols for cancers. Radiation therapy employs several beams of ionizing radiation to kill cancer tumors, but such irradiation also causes damage to normal tissues. Therefore, a treatment plan should satisfy dose-volume constraints (DVCs). Intensity-modulated radiotherapy treatment (IMRT) enables to control the beam intensities and gives more flexibility for the treatment plan to satisfy the DVCs. Romeijn et al. (2003) replaced the DVCs in an IMRT optimization with C-VaR (Conditional Value-at-Risk) type constraints, and proposed a numerical method based on linear programming (LP). Their approach reduced the computation cost of the original DVCs, but the feasible region of their LP problems was much narrow compared to the DVCs, therefore, their approach often failed to find a feasible plan even when the DVCs were not so tight. In this paper, we propose a successive LP approach with the C-VaR type constraints. We detect outliers form the solution of LP problems, and remove them from the domain of the C-VaR type constraints. This eases the sensitivity of C-VaR type constraints to outliers and we can search feasible plans from wider regions. Furthermore, we can give a mathematical proof that if the optimal value of the LP problem in the proposed approach is non-positive, the corresponding optimal solution satisfies all the DVCs. From numerical experiments on test data sets, we observed that our approach found feasible solutions more appropriately than existing LP approaches. In addition, our approach required fewer LP problems, and this led to a short computation time.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑