A Greedy reassignment algorithm for the PBS minimum monitor unit constraint

被引:23
|
作者
Lin, Yuting
Kooy, Hanne
Craft, David
Depauw, Nicolas
Flanz, Jacob
Clasie, Benjamin [1 ]
机构
[1] Massachusetts Gen Hosp, Dept Radiat Oncol, Boston, MA 02114 USA
来源
PHYSICS IN MEDICINE AND BIOLOGY | 2016年 / 61卷 / 12期
关键词
pencil beam scanning; proton therapy; radiation therapy; treatment delivery; treatment planning; DOSE DISTRIBUTIONS; ASSIGNMENT PROBLEM; PROTON; OPTIMIZATION; DELIVERY; BEAMS;
D O I
10.1088/0031-9155/61/12/4665
中图分类号
R318 [生物医学工程];
学科分类号
0831 ;
摘要
Proton pencil beam scanning (PBS) treatment plans are made of numerous unique spots of different weights. These weights are optimized by the treatment planning systems, and sometimes fall below the deliverable threshold set by the treatment delivery system. The purpose of this work is to investigate a Greedy reassignment algorithm to mitigate the effects of these low weight pencil beams. The algorithm is applied during post-processing to the optimized plan to generate deliverable plans for the treatment delivery system. The Greedy reassignment method developed in this work deletes the smallest weight spot in the entire field and reassigns its weight to its nearest neighbor(s) and repeats until all spots are above the minimum monitor unit (MU) constraint. Its performance was evaluated using plans collected from 190 patients (496 fields) treated at our facility. The Greedy reassignment method was compared against two other post-processing methods. The evaluation criteria was the gamma-index pass rate that compares the pre-processed and post-processed dose distributions. A planning metric was developed to predict the impact of post-processing on treatment plans for various treatment planning, machine, and dose tolerance parameters. For fields with a pass rate of 90 +/- 1% the planning metric has a standard deviation equal to 18% of the centroid value showing that the planning metric and gamma-index pass rate are correlated for the Greedy reassignment algorithm. Using a 3rd order polynomial fit to the data, the Greedy reassignment method has 1.8 times better planning metric at 90% pass rate compared to other post-processing methods. As the planning metric and pass rate are correlated, the planning metric could provide an aid for implementing parameters during treatment planning, or even during facility design, in order to yield acceptable pass rates. More facilities are starting to implement PBS and some have spot sizes (one standard deviation) smaller than 5 mm, hence would require small spot spacing. While this is not the only parameter that affects the optimized plan, the perturbation due to the minimum MU constraint increases with decreasing spot spacing. This work could help to design the minimum MU threshold with the goal to keep the gamma-index pass rate above an acceptable value.
引用
收藏
页码:4665 / 4678
页数:14
相关论文
共 50 条
  • [1] A Greedy Reassignment Algorithm for the PBS Minimum Monitor Unit Constraint
    Lin, Y.
    Kooy, H.
    Craft, D.
    Depauw, N.
    Flanz, J.
    Clasie, B.
    MEDICAL PHYSICS, 2016, 43 (06) : 3885 - 3886
  • [2] A novel fast robust optimization algorithm for intensity-modulated proton therapy with minimum monitor unit constraint
    Fan, Qingkun
    Zhao, Lewei
    Li, Xiaoqiang
    Hu, Jie
    Lu, Xiliang
    Yang, Zhijian
    Zhang, Sheng
    Yang, Kunyu
    Ding, Xuanfeng
    Liu, Gang
    Dai, Shuyang
    MEDICAL PHYSICS, 2024, : 6220 - 6230
  • [3] A Greedy Algorithm for Cognitive Network Resource Alocation Based on Minimum Remaining Constraint Space
    Ma, Yuehuai
    Xu, Youyun
    Sheng, Yanming
    2009 INTERNATIONAL CONFERENCE ON WIRELESS COMMUNICATIONS AND SIGNAL PROCESSING (WCSP 2009), 2009, : 464 - 468
  • [4] A Greedy Algorithm for Constraint Principal Curves
    Yang, Shiying
    Chen, Dewang
    Zeng, Xiangyu
    Pudney, Peter
    JOURNAL OF COMPUTERS, 2014, 9 (05) : 1125 - 1130
  • [5] On Guha and Khuller's Greedy Algorithm for Finding a Minimum CDS for Unit Disk Graphs
    Fujita, Satoshi
    2014 SECOND INTERNATIONAL SYMPOSIUM ON COMPUTING AND NETWORKING (CANDAR), 2014, : 60 - 67
  • [6] Minimum MU optimization (MMO): an inverse optimization approach for the PBS minimum MU constraint
    Gao, Hao
    Clasie, Benjamin
    Liu, Tian
    Lin, Yuting
    PHYSICS IN MEDICINE AND BIOLOGY, 2019, 64 (12):
  • [7] Minimum MU Optimization MMO: An Inverse Optimization Approach for the PBS Minimum MU Constraint
    Gao, H.
    Clasie, B.
    Liu, T.
    Lin, Y.
    MEDICAL PHYSICS, 2019, 46 (06) : E97 - E97
  • [8] A greedy approximation algorithm for minimum-gap scheduling
    Chrobak, Marek
    Feige, Uriel
    Hajiaghayi, Mohammad Taghi
    Khanna, Sanjeev
    Li, Fei
    Naor, Seffi
    JOURNAL OF SCHEDULING, 2017, 20 (03) : 279 - 292
  • [9] A greedy approximation algorithm for minimum-gap scheduling
    Marek Chrobak
    Uriel Feige
    Mohammad Taghi Hajiaghayi
    Sanjeev Khanna
    Fei Li
    Seffi Naor
    Journal of Scheduling, 2017, 20 : 279 - 292
  • [10] The Greedy Algorithm for the Minimum Common String Partition Problem
    Chrobak, Marek
    Kolman, Petr
    Sgall, Jiri
    ACM TRANSACTIONS ON ALGORITHMS, 2005, 1 (02) : 350 - 366