2003
DOI: 10.1088/0031-9155/48/3/303
|View full text |Cite
|
Sign up to set email alerts
|

Leaf sequencing algorithms for segmented multileaf collimation

Abstract: The delivery of intensity-modulated radiation therapy (IMRT) with a multileaf collimator (MLC) requires the conversion of a radiation fluence map into a leaf sequence file that controls the movement of the MLC during radiation delivery. It is imperative that the fluence map delivered using the leaf sequence file is as close as possible to the fluence map generated by the dose optimization algorithm, while satisfying hardware constraints of the delivery system. Optimization of the leaf sequencing algorithm has … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

1
103
0

Year Published

2005
2005
2018
2018

Publication Types

Select...
4
3
1

Relationship

0
8

Authors

Journals

citations
Cited by 74 publications
(104 citation statements)
references
References 17 publications
1
103
0
Order By: Relevance
“…However, because this method is labor intensive and because the intention of this work was to evaluate the implemented segmentation algorithm, such modifications were not included in our analysis. It was already reported 23 , 24 that the segmentation algorithm (11) implemented in KonRad, is one of the most efficient methods concerning the number of MUs. However, concerning the number of beam segments no such observation was made previously.…”
Section: Discussionmentioning
confidence: 99%
“…However, because this method is labor intensive and because the intention of this work was to evaluate the implemented segmentation algorithm, such modifications were not included in our analysis. It was already reported 23 , 24 that the segmentation algorithm (11) implemented in KonRad, is one of the most efficient methods concerning the number of MUs. However, concerning the number of beam segments no such observation was made previously.…”
Section: Discussionmentioning
confidence: 99%
“…An alternative optimality proof of the sweep algorithm can be found in Kamath et al (2003). Their methodology is based on analyzing the left and right leaf trajectories for each row A m , m ∈ M. These trajectory functions are at the focus of research in dynamic MLC models.…”
Section: Unconstrained Dt Problemmentioning
confidence: 99%
“…Figure 2 illustrates an example with row A m = (2, 3, 3, 5, 2, 2, 4, 4), the representation of each entry a mn as rod, and the corresponding trajectories. By proving that the step size of the left leaf trajectory in any position n is an upper bound on the number of MUs of any other feasible decompositions, Kamath et al (2003) establish the optimality of the decomposition delivered by their algorithm SINGLEPAIR for the case of single row DT problems. In combination with Lemma 2.1, this yields the optimality of their solution algorithm MULTIPAIR for the unconstrained DT problem, which is, again, a validity proof of the sweep algorithm.…”
Section: Unconstrained Dt Problemmentioning
confidence: 99%
See 1 more Smart Citation
“…Such algorithms are in use in existing radiotherapy equipment. Moreover, researchers have studied the mathematical structure of these problems to improve algorithm design or to establish the optimality of an algortihm (Ahuja and Hamacher, 2004;Baatar et al, 2004;Kamath et al, 2003).…”
Section: Introductionmentioning
confidence: 99%