...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Physics in medicine and biology. >Optimization algorithm for overlapping-field plans of scanned ion beam therapy with reduced sensitivity to range and setup uncertainties.
【24h】

Optimization algorithm for overlapping-field plans of scanned ion beam therapy with reduced sensitivity to range and setup uncertainties.

机译：扫描离子束治疗重叠场计划的优化算法，降低了对范围和设置不确定性的敏感性。

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

A 'patch-field' strategy is often used for tumors with large volumes exceeding the available field size in passive irradiations with ion beams. Range and setup errors can cause hot and cold spots at the field junction within the target. Such errors will also displace the field to miss the target periphery. With scanned ion beams with fluence modulation, the two junctional fields can be overlapped rather than patched, which may potentially reduce the sensitivity to these uncertainties. In this study, we have developed such a robust optimization algorithm. This algorithm is composed of the following two steps: (1) expanding the target volume with margins against the uncertainties, and (2) solving the inverse problem where the terms suppressing the dose gradient of individual fields are added into the objective function. The validity of this algorithm is demonstrated through simulation studies for two extreme cases of two fields with unidirectional and opposing geometries and for a prostate-cancer case. With the proposed algorithm, we can obtain a more robust plan with minimized influence of range and setup uncertainties than the conventional plan. Compared to conventional optimization, the calculation time for the robust optimization increased by a factor of approximately 3.
机译：“斑场”策略通常用于大体积超过离子束被动照射中可用场大小的肿瘤。范围和设置错误可能会在目标内的场结处引起热点和冷点。这样的错误也会使磁场移位，从而错过目标外围。使用具有通量调制的扫描离子束，两个交界场可以重叠而不是打补丁，这可能会降低对这些不确定性的敏感性。在这项研究中，我们开发了一种鲁棒的优化算法。该算法由以下两个步骤组成：（1）扩大目标体积，并具有克服不确定性的余量;（2）解决反问题，其中将抑制各个场的剂量梯度的项添加到目标函数中。通过仿真研究证明了该算法的有效性，该研究针对具有单向和相反几何形状的两个场的两个极端情况以及前列腺癌情况。通过所提出的算法，我们可以获得比常规计划更鲁棒的计划，其范围和设置不确定性的影响最小。与常规优化相比，鲁棒优化的计算时间增加了大约3倍。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号