SU-F-T-350: Continuous Leaf Optimization (CLO) for IMRT Leaf Sequencing

2016 ◽  
Vol 43 (6Part18) ◽  
pp. 3543-3544
Author(s):  
T Long ◽  
M Chen ◽  
S Jiang ◽  
W Lu
Keyword(s):  
Leaf Sequencing

Comparison of Algorithms for Static Multi-Leaf Collimator Field Segmentation

2011 ◽  
Vol 80-81 ◽  
pp. 1091-1095
Author(s):  
Dong Dong Ni ◽  
Xu Wu ◽  
Jian Qi Chen ◽  
Jia Jing ◽  
Cai Xia Liu
Keyword(s):  
Treatment Planning ◽  
Treatment Time ◽  
Beam Intensity ◽  
Effective Strategy ◽  
Monitor Unit ◽  
Planning Systems ◽  
Treatment Planning Systems ◽  
Multi Leaf Collimator ◽  
Leaf Sequencing ◽  
Number Of Segments

Purpose: A multi-leaf collimator leaf sequencing comparison program in the sense that it translates beam intensity maps into the least number of MLC field segments was presented. Methods: The IMRT leaf sequencing calculation program based on Galvin, Bortfeld algorithms was constructed. The output of the leaf sequencing program were the number of segment and the total number of monitor unit. Results: Assuming 15 x 15 bixel fields with an average of 10 intensity levels, Bortfeld algorithm could yield better result on example 1 while Galvin algorithm yielded better results on example 2. Conclusions: This represented a useful tool for optimizing the leaf sequencing of static multi-leaf collimator that can yield shorter treatment time and higher utilization of photons by comparing with the total number of monitor units and number of segments of existed typical algorithms. It was an effective strategy and could be applied in commercial Treatment Planning Systems.

A comparison of step-and-shoot leaf sequencing algorithms that eliminate tongue-and-groove effects

2004 ◽  
Vol 49 (14) ◽  
pp. 3137-3143 ◽  
Author(s):  
Srijit Kamath ◽  
Sartaj Sahni ◽  
Sanjay Ranka ◽  
Jonathan Li ◽  
Jatinder Palta
Keyword(s):  
Leaf Sequencing ◽  
Step And Shoot

A graph-searching method for MLC leaf sequencing under constraints

2004 ◽  
Vol 31 (6) ◽  
pp. 1504-1511 ◽  
Author(s):  
Yan Chen ◽  
Qing Hou ◽  
James M. Galvin
Keyword(s):  
Graph Searching ◽  
Leaf Sequencing ◽  
Searching Method

SU-E-T-605: Performance Evaluation of MLC Leaf-Sequencing Algorithms in Head-And-Neck IMRT

2015 ◽  
Vol 42 (6Part21) ◽  
pp. 3475-3475
Author(s):  
J Jing ◽  
H Lin ◽  
J Chow
Keyword(s):  
Performance Evaluation ◽  
Head And Neck ◽  
Leaf Sequencing

GEOMETRIC ALGORITHMS FOR STATIC LEAF SEQUENCING PROBLEMS IN RADIATION THERAPY

2004 ◽  
Vol 14 (04n05) ◽  
pp. 311-339 ◽  
Author(s):  
DANNY Z. CHEN ◽  
XIAOBO S. HU ◽  
SHUANG (SEAN) LUAN ◽  
CHAO WANG ◽  
XIAODONG WU
Keyword(s):  
Radiation Therapy ◽  
Polynomial Time ◽  
Geometric Algorithms ◽  
Planning System ◽  
Treatment Planning System ◽  
Polygonal Domain ◽  
Steiner Points ◽  
Delivery Times ◽  
Leaf Sequencing ◽  
Monotone Polygons

The static leaf sequencing (SLS) problem arises in radiation therapy for cancer treatments, aiming to accomplish the delivery of a radiation prescription to a target tumor in the minimum amount of delivery time. Geometrically, the SLS problem can be formulated as a 3-D partition problem for which the 2-D problem of partitioning a polygonal domain (possibly with holes) into a minimum set of monotone polygons is a special case. In this paper, we present new geometric algorithms for a basic case of the 3-D SLS problem (which is also of clinical value) and for the general 3-D SLS problem. Our basic 3-D SLS algorithm, based on new geometric observations, produces guaranteed optimal quality solutions using O(1) Steiner points in polynomial time; the previously best known basic 3-D SLS algorithm gives optimal outputs only for the case without considering any Steiner points, and its time bound involves a multiplicative factor of a factorial function of the input. Our general 3-D SLS algorithm is based on our basic 3-D SLS algorithm and a polynomial time algorithm for partitioning a polygonal domain (possibly with holes) into a minimum set of x-monotone polygons, and has a fast running time. Experiments of our SLS algorithms and software in clinical settings have shown substantial improvements over the current most popular commercial treatment planning system and the most well-known SLS algorithm in medical literature. The radiotherapy plans produced by our software not only take significantly shorter delivery times, but also have a much better treatment quality. This proves the feasibility of our software and has led to its clinical applications at the Department of Radiation Oncology at the University of Maryland Medical Center. Some of our techniques and geometric procedures (e.g., for partitioning a polygonal domain into a minimum set of x-monotone polygons) are interesting in their own right.

Sign in / Sign up

Export Citation Format

Share Document