Approximated matrix decomposition for IMRT planning with multileaf collimators

Authors:
Konrad Engel;Antje Kiesel
Affiliations:
Institut für Mathematik, Universität Rostock, Rostock, Germany 18051;Institut für Mathematik, Universität Rostock, Rostock, Germany 18051
Venue:
OR Spectrum
Year:
2011

Citing 6
Cited 1

Minimizing beam-on time in cancer radiation treatment using multileaf collimators

Networks
A network flow algorithm to minimize beam-on time for unconstrained multileaf collimator problems in cancer radiation therapy

Networks
An Optimization Framework for Conformal Radiation Treatment Planning

INFORMS Journal on Computing
Decomposition of integer matrices and multileaf collimator sequencing

Discrete Applied Mathematics
A new algorithm for optimal multileaf collimator field segmentation

Discrete Applied Mathematics
Realization of intensity modulated radiation fields using multileaf collimators

General Theory of Information Transfer and Combinatorics

A function approximation approach to the segmentation step in IMRT planning

OR Spectrum

Quantified Score

Hi-index	0.00

Visualization

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.