首页> 外文期刊>Medical Physics >Concurrent Monte Carlo transport and fluence optimization with fluence adjusting scalable transport Monte Carlo
【24h】

Concurrent Monte Carlo transport and fluence optimization with fluence adjusting scalable transport Monte Carlo

机译:使用荧光灯调整可扩展运输蒙特卡罗的同时蒙特卡罗运输和流量优化

获取原文
获取原文并翻译 | 示例
获取外文期刊封面目录资料

摘要

Purpose: The future of radiation therapy will require advanced inverse planning solutions to support single-arc, multiple-arc, and "4? delivery modes, which present unique challenges in finding an optimal treatment plan over a vast search space, while still preserving dosimetric accuracy. The successful clinical implementation of such methods would benefit from Monte Carlo (MC) based dose calculation methods, which can offer improvements in dosimetric accuracy when compared to deterministic methods. The standard method for MC based treatment planning optimization leverages the accuracy of the MC dose calculation and efficiency of well-developed optimization methods, by precalculating the fluence to dose relationship within a patient with MC methods and subsequently optimizing the fluence weights. However, the sequential nature of this implementation is computationally time consuming and memory intensive. Methods to reduce the overhead of the MC precalculation have been explored in the past, demonstrating promising reductions of computational time overhead, but with limited impact on the memory overhead due to the sequential nature of the dose calculation and fluence optimization. The authors propose an entirely new form of "concurrent" Monte Carlo treat plan optimization: a platform which optimizes the fluence during the dose calculation, reduces wasted computation time being spent on beamlets that weakly contribute to the final dose distribution, and requires only a low memory footprint to function. In this initial investigation, the authors explore the key theoretical and practical considerations of optimizing fluence in such a manner. Methods: The authors present a novel derivation and implementation of a gradient descent algorithm that allows for optimization during MC particle transport, based on highly stochastic information generated through particle transport of very few histories. A gradient rescaling and renormalization algorithm, and the concept of momentum from stochastic gradient descent were used to address obstacles unique to performing gradient descent fluence optimization during MC particle transport. The authors have applied their method to two simple geometrical phantoms, and one clinical patient geometry to examine the capability of this platform to generate conformal plans as well as assess its computational scaling and efficiency, respectively. Results: The authors obtain a reduction of at least 50% in total histories transported in their investigation compared to a theoretical unweighted beamlet calculation and subsequent fluence optimization method, and observe a roughly fixed optimization time overhead consisting of ~10% of the total computation time in all cases. Finally, the authors demonstrate a negligible increase in memory overhead of ~7-8 MB to allow for optimization of a clinical patient geometry surrounded by 36 beams using their platform. Conclusions: This study demonstrates a fluence optimization approach, which could significantly improve the development of next generation radiation therapy solutions while incurring minimal additional computational overhead.
机译:目的:放射治疗的未来将需要先进的逆计划解决方案来支持单弧,多弧和“4?交付模式,这在寻找最佳的搜索空间中的最佳治疗计划时具有独特的挑战,同时仍然保持剂量准确性。此类方法的成功临床实施将受益于基于蒙特卡罗(MC)的剂量计算方法,该方法可以在与确定性方法相比时提高剂量准确度。基于MC的MC的标准方法利用MC的准确性来利用MC的准确性通过预先施用MC方法中的患者剂量关系的良好优化方法的剂量计算与效率,随后优化流量重量。然而,这种实现的顺序性是计算耗时和内存密集的。减少方法已探讨MC预先计算的开销过去,展示了有希望的计算时间开销减少,但由于剂量计算的顺序性和流量优化的顺序性质,对存储器开销的影响有限。作者提出了一种完全新的“同时”蒙特卡罗治疗计划优化形式:一个平台,该平台在剂量计算期间优化流量,减少了在弱助力的束上花费的浪费计算时间,并且只需要一个低内存占用功能。在这次初步调查中,作者探讨了以这种方式优化流量的关键理论和实践考虑因素。方法:作者呈现了一种新的推导和实现梯度下降算法,其允许在MC粒子传输期间优化,基于通过很少的颗粒传输产生的高度随机信息。梯度重构和重整化算法,以及随机梯度下降的动量概念用于解决在MC颗粒运输期间进行梯度下降量优化的障碍物。作者已经将其方法应用于两个简单的几何模钓,以及一个临床患者几何形状,以检查该平台的能力,以分别产生保形计划,并分别评估其计算缩放和效率。结果:与理论未加权的束计算和随后的流量优化方法相比,作者在调查中运输的总历史中的总历史减少了至少50%,并观察大致固定的优化时间开销,包括〜10%的总计算时间在所有情况下。最后,作者展示了〜7-8 MB的记忆开销的易于增加,以便优化使用其平台围绕36梁围绕的临床患者几何形状。结论:本研究表明了一种流量的优化方法,可以显着改善下一代放射治疗解决方案的发展,同时产生最小的额外计算开销。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号