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 条
  • [31] A better-than-greedy approximation algorithm for the minimum set cover problem
    Hassin, R
    Levin, A
    SIAM JOURNAL ON COMPUTING, 2005, 35 (01) : 189 - 200
  • [32] Modified least-to-most greedy algorithm to search a minimum sentence set
    Suyanto
    TENCON 2006 - 2006 IEEE REGION 10 CONFERENCE, VOLS 1-4, 2006, : 1482 - 1484
  • [33] Robust beamforming based on linear constraint minimum variance algorithm
    Lyu Y.
    Cao F.
    Beijing Hangkong Hangtian Daxue Xuebao/Journal of Beijing University of Aeronautics and Astronautics, 2023, 49 (03): : 617 - 624
  • [34] A minimum-cut algorithm with size constraint for partitioning a graph
    Michelon, P
    Ripeau, S
    Maculan, N
    RAIRO-RECHERCHE OPERATIONNELLE-OPERATIONS RESEARCH, 2001, 35 (04): : 401 - 414
  • [35] Constraint satisfaction algorithm for minimum slab surplus weight problem
    Zhang, Wen-Xue
    Li, Tie-Ke
    Wang, Bai-Lin
    Jisuanji Jicheng Zhizao Xitong/Computer Integrated Manufacturing Systems, CIMS, 2012, 18 (09): : 1948 - 1953
  • [36] Deep Learning Algorithm for Minimum Constraint Removal (MCR) Problem
    Xu, Bo
    Chen, Liangwei
    Xu, Kewen
    ICMLC 2020: 2020 12TH INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND COMPUTING, 2018, : 52 - 56
  • [37] CONVERGENCE OF HOWARDS MINIMUM-NEGATIVITY-CONSTRAINT EXTRAPOLATION ALGORITHM
    CHEUNG, KF
    MARKS, RJ
    ATLAS, LE
    JOURNAL OF THE OPTICAL SOCIETY OF AMERICA A-OPTICS IMAGE SCIENCE AND VISION, 1988, 5 (11) : 2008 - 2009
  • [38] A DYNAMIC-PROGRAMMING ALGORITHM FOR COVERING PROBLEMS WITH (GREEDY) TOTALLY BALANCED CONSTRAINT MATRICES
    BROIN, MW
    LOWE, TJ
    SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS, 1986, 7 (03): : 348 - 357
  • [39] Greedy Optimization Algorithm for the Power/Ground Network Design to Satisfy the Voltage Drop Constraint
    Tanaka, Mikiko Sode
    Togawa, Nozomu
    Yanagisawa, Masao
    Goto, Satoshi
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2011, E94A (04) : 1082 - 1090
  • [40] Greedy Algorithm for the On-Chip Decoupling Capacitance Optimization to Satisfy the Voltage Drop Constraint
    Tanaka, Mikiko Sode
    Togawa, Nozomu
    Yanagisawa, Masao
    Goto, Satoshi
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2011, E94A (12) : 2482 - 2489