Physics Contributions
Minimizing static intensity modulation delivery time using an intensity solid paradigm

https://doi.org/10.1016/S0360-3016(98)00430-1Get rights and content

Abstract

Purpose: A leaf sequencing optimization algorithm that minimizes the delivery time for a static intensity modulated field is presented.

Methods and Materials: Sets of segments are created by intensity map operations subject to leaf collision constraints and tongue and groove effects. Each set’s delivery time is evaluated as a function of leaf travel, beam on time, and the verify and record (V&R) overhead. The configuration with the minimum delivery time is chosen. As a test, optimization was done on three clinical cases of varying complexity.

Results: Assuming 10 × 10-cm fields with an average of 17 intensity levels, the optimization technique reduced delivery times by 27% and 45%, when compared to rod pushing and power of two extraction, respectively. The treatment time for the optimal case with a V&R overhead of 4 s would be 11.5 min for 9 coplanar ports. Tongue-and-groove underdosages are removed, and the worst case leakage is 2% of the peak dose.

Conclusion: Compared to previously reported leaf sequencing methods, the new optimization algorithm described here reduces treatment times for complex static intensity modulated fields. Additionally, leakage is minimal and no tongue-and-groove underdosage occurs.

Introduction

Intensity modulation is a powerful tool for creating dose distributions that spare critical organs and that have high dose regions conforming to the tumor shape. This technique improves dose conformity by allowing the intensity of the beam to vary across the patient surface. This variation can be visualized as an intensity map (Fig.1a ), a 2-dimensional matrix whose cells have a one-to-one correspondence with the patient coordinates in the isocentric plane and whose entries are directly proportional to the amount of time that the corresponding cell of the matrix is exposed to radiation. The entries in the map are all integers, and a scaling factor multiplied to the map is used to determine the number of monitor units each cell receives.

Dose optimization routines 1, 2, 3 generate the intensity maps, and these maps could be delivered with techniques which involve compensators 2, 4, 5, dynamic multileaf collimation 6, 7, 8, 9, 10, 11, or static multileaf collimation 4, 10, 12, 13. For dynamic methods, many algorithms have been developed to generate the appropriate leaf sequences with the goal of minimizing the beam on time 6, 7, 8, 9, 10, 11. This goal is equivalent to minimizing the total treatment time, since the beam is on while the leaves are moving. The dynamic leaf sequencing concepts have been extended to static methods (10) by choosing appropriate intervals of the dynamic method and delivering the leaf settings in a stop-and-shoot mode. These methods also minimize the beam on time, but they do not minimize the total treatment time.

For static methods, every single segment can be verified and recorded, depending on the ability to prevent radiation from turning on, should there be any mismatch between the desired and the actual positions. However, there is an overhead associated with the confidence provided by the verification and record (V&R) cycle for every single leaf position of each segment. Since several segments are superimposed to generate the intensity map, this V&R overhead needs to be considered in the algorithms that generate the segments. Different sets of segments will also have different total beam on times and different amounts of leaf travel. These system related quantities must also be considered in the process of minimizing the total treatment time, and they must be treated in a way that accommodates changes in leaf speed, dose rate, and V&R overhead. For a system with a long V&R overhead, minimizing the number of segments may produce the minimum treatment time. If the machine has a low dose rate and a short V&R overhead, however, it is possible to find a set of segments which does not have the minimum number of segments, and yet has the minimum treatment time.

In this paper, a recently patented (14) optimization algorithm that minimizes the total delivery time by taking all the system parameters for a Siemens multi-leaf collimator (MLC) into account in a flexible way will be presented.

Section snippets

Basic processes

The algorithm presented here uses two concepts: (a) intensity maps can be made up of regions with very little modulation below a certain intensity threshold; and (b) the highly modulating regions are most efficiently handled by forcing the leaves to travel in one direction with minimum beam-on time. Both concepts are treated using a 3-dimensional (3D) approach to the problem. The algorithm was tested on three different clinical cases.

Complexity of the map

The prototype optimization code was tested on a 9-port, coplanar treatment for a clivus chordoma in the brain (one port is shown in Fig. 1c). The original maps have an average maximum intensity level of 17, with maximum values ranging from 15 to 20 levels in the individual ports. The optimization was tested on this original set, and on two additional renormalized sets, so that in one set the maximum intensity was 10 levels, and in the other set it was 5 levels. For these tests, the dose rate

Discussion

The clinical implementation of static IMRT depends on the treatment plans. The dose volume histograms for the target and the critical organs will change depending on the treatment geometry. Different authors have investigated the minimum required number of ports, the number of intensity levels, and the optimal port locations. Verhey et al. (12) reported that 3 intensity levels from 4 carefully forward planned coplanar ports produced excellent dose volume histograms that were equal to or better

Conclusion

This work presents an optimization algorithm that determines the best segmentation possible for delivering an intensity map using multiple static fields that are automatically delivered in sequence. Since every segment in the intensity modulated treatment is delivered in the same way as a single non-intensity modulated field, the whole sequence is recorded and verified, providing the safest delivery method possible for intensity modulation. However, the V&R cycle requires extra time, and this

Acknowledgements

The nine intensity maps for the clivus chordoma were generated at the Deutsches Krebsforschungszentrum (DKFZ), and the four intensity maps for the remaining head and neck cases were created on the PLUNC system from the University of North Carolina (UNC). The author thanks Thomas Bortfeld of DKFZ and Ed Chaney, Sha Chang, and Tim Cullip of UNC. The author also thanks Jim Galvin and Lynn Verhey for their comments on the manuscript.

References (15)

  • J.M. Galvin et al.

    Combining multileaf fields to modulate fluence distributions

    Int J Radiat Oncol Biol Phys

    (1993)
  • T. Bortfeld et al.

    X-ray field compensation with multileaf collimators

    Int J Radiat Oncol Biol Phys

    (1994)
  • Bortfeld T. Inverse treatment planning. In: Bortfeld T, Mijnheer B, Nahum A, editors. ESTRO Pre-meeting Workshop on...
  • A. Gustafsson et al.

    Simultaneous optimization of dynamic multileaf collimation and scanning patterns or compensation filters using a generalized pencil beam algorithm

    Med Phys

    (1995)
  • S. Webb

    Optimizing the planning of intensity-modulated radiotherapy

    Phys Med Biol

    (1994)
  • P.A. Jurinsic et al.

    Implementation of a three-dimensional compensation system based on computed tomography generated surface contours and tissue inhomogeneities

    Med Phys

    (1994)
  • S.V. Spirou et al.

    Generation of arbitrary intensity profiles by dynamic jaws or multileaf collimators

    Med Phys

    (1994)
There are more references available in the full text version of this article.

Cited by (143)

  • Intensity-Modulated Radiation Therapy Planning

    2014, Comprehensive Biomedical Physics
  • Combinatorial Benders cuts for decomposing IMRT fluence maps using rectangular apertures

    2013, Computers and Operations Research
    Citation Excerpt :

    However, the problem of finding the minimum number of apertures required for the decomposition is NP-hard in the strong sense [2]. While earlier studies have proposed various heuristic approaches for minimizing the number of apertures (e.g. [2,11,38,43]), more recent studies have focused on generating optimal solutions. Langer et al. [24] and Wake et al. [42] developed mixed-integer programming formulations of the problem, while Kalinowski [19] proposed an exact dynamic programming approach with the objective of minimizing total number of apertures used under the condition that the total treatment time is minimum.

View all citing articles on Scopus
View full text