University of Michigan-Shanghai Jiao Tong University Joint Institute, Shanghai Jiao Tong University, Shanghai, China.
Department of Radiation Oncology, University of Kansas Medical Center, Kansas City, Kansas, USA.
Med Phys. 2023 Jun;50(6):3258-3273. doi: 10.1002/mp.16392. Epub 2023 Apr 3.
In treatment planning, beam angle optimization (BAO) refers to the selection of a subset with a given number of beam angles from all available angles that provides the best plan quality. BAO is a NP-hard combinatorial problem. Although exhaustive search (ES) can exactly solve BAO by exploring all possible combinations, ES is very time-consuming and practically infeasible.
To the best of our knowledge, (1) no optimization method has been demonstrated that can provide the exact solution to BAO, and (2) no study has validated an optimization method for solving BAO by benchmarking with the optimal BAO solution (e.g., via ES), both of which will be addressed by this work.
This work considers BAO for proton therapy, for example, the selection of 2-4 beam angles for IMPT. The optimal BAO solution is obtained via ES and serves as the ground truth. A new BAO algorithm, namely angle generation (AG) method, is proposed, and demonstrated to provide nearly-exact solutions for BAO in reference to the ES solution. AG iteratively optimizes the angular set via group-sparsity (GS) regularization, until the planning objective does not decrease further.
Since GS alone can also solve BAO, AG was validated and compared with GS for 2-angle brain, 3-angle lung, and 4-angle brain cases, in reference to the optimal BAO solutions obtained by ES: the AG solution had the rank (1/276, 1/2024, 4/10 626), while the GS solution had the rank (42/276, 279/2024, 4328/10 626).
A new BAO algorithm called AG is proposed and shown to provide substantially improved accuracy for BAO from current methods with nearly-exact solutions to BAO, in reference to the ground truth of optimal BAO solution via ES.
在治疗计划中,射束角度优化(BAO)是指从所有可用角度中选择具有给定数量的射束角度的子集,以提供最佳的计划质量。BAO 是一个 NP 难的组合问题。虽然穷举搜索(ES)可以通过探索所有可能的组合来精确地解决 BAO,但 ES 非常耗时且在实践中不可行。
据我们所知,(1)没有优化方法能够提供 BAO 的精确解,(2)没有研究通过与最佳 BAO 解(例如通过 ES)进行基准测试来验证解决 BAO 的优化方法,这两点将是本工作的重点。
本工作考虑了质子治疗中的 BAO,例如,选择 2-4 个射束角度用于 IMPT。最佳 BAO 解通过 ES 获得,并作为基准。提出了一种新的 BAO 算法,即角度生成(AG)方法,并证明其通过群组稀疏性(GS)正则化迭代优化角集,直到规划目标不再进一步减小。
由于 GS 本身也可以解决 BAO,因此对 AG 进行了验证,并与 GS 进行了比较,用于 2 个角度的脑部、3 个角度的肺部和 4 个角度的脑部病例,以与 ES 获得的最佳 BAO 解进行比较:AG 解的秩为(1/276、1/2024、4/10626),而 GS 解的秩为(42/276、279/2024、4328/10626)。
提出了一种新的 BAO 算法,称为 AG,与 ES 获得的最佳 BAO 解的基准相比,该算法提供了 BAO 的几乎精确解,大大提高了 BAO 的准确性。