Abstract
A standard problem in intensity modulated radiation therapy is the representation of a given intensity matrix, i.e. a matrix of nonnegative integers, as a nonnegative linear combination of special 0-1-matrices, called segments. These segments can be practically realized by multileaf collimators. One important aim is the minimization of the sum of the coefficients of the linear combination, i.e. the delivery time. In this article, we study the question how much the delivery time can be reduced if some small deviation from the given intensity matrix is allowed. We characterize the optimal solutions for one-row matrices and show that the approximation can be carried out in an iterative way. The structural characterization yields a fast algorithm that minimizes the delivery time and then also the deviation. Moreover, algorithms for the general case together with numerical results are presented.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Ahuja RK, Hamacher HW (2005) A network flow algorithm to minimize beam-on time for unconstrained multileaf collimator problems in cancer radiation therapy. Networks 45(1): 36–41
Baatar D, Hamacher HW, Ehrgott M, Woeginger GJ (2005) Decomposition of integer matrices and multileaf collimator sequencing. Discrete Appl Math 152(1–3): 6–34
Boland N, Hamacher HW, Lenzen F (2004) Minimizing beam-on time in cancer radiation treatment using multileaf collimators. Networks 43(4): 226–240
Engel K (2005) A new algorithm for optimal multileaf collimator field segmentation. Discrete Appl Math 152(1-3): 35–51
Engel K, Tabbert E (2005) Fast simultaneous angle, wedge, and beam intensity optimization in inverse radiotherapy planning. Optim Eng 6(4): 393–419
Kalinowski T (2006) Realization of intensity modulated radiation fields using multileaf collimators. In Ahlswede R et al (eds) Information transfer and combinatorics. LNCS, vol 4123. Springer, Berlin, pp 1010–1055
Kalinowski T (2008) Multileaf collimator shape matrix decomposition. In: Lim GJ(eds) Optimization in Medicine and Biology. Auerbach Publishers Inc., Pennsauken, pp 253–286
Kalinowski T (2009) The algorithmic complexity of the minimization of the number of segments in multileaf collimator field segmentation. Discrete Appl Math (in press)
Kamath S, Sartaj S, Palta J, Ranka S, Li J (2004) Optimal leaf sequencing with elimination of tongue-and-groove underdosage. Phys Med Biol 49: N7–N19
Lim J, Ferris MC, Wright SJ, Shepard DM, Earl MA (2007) An optimization framework for conformal radiation treatment planning. INFORMS J Comput 19(3): 366–380
Xia P, Verhey L (1998) Multileaf collimator leaf-sequencing algorithm for intensity modulated beams with multiple static segments. Med Phys 25: 1424–1434
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Engel, K., Kiesel, A. Approximated matrix decomposition for IMRT planning with multileaf collimators. OR Spectrum 33, 149–172 (2011). https://doi.org/10.1007/s00291-009-0168-5
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00291-009-0168-5