Claus Promberger | PubMed Health

PubMed2004

Degeneracy, frequency response and filtering in IMRT optimization.

This paper attempts to provide an answer to some questions that remain either poorly understood, or not well documented in the literature, on basic issues related to intensity modulated radiation therapy (IMRT). The questions examined are: the relationship between degeneracy and frequency response of optimizations, effects of initial beamlet fluence assignment and stopping point, what does filtering of an optimized beamlet map actually do and how could image analysis help to obtain better optimizations? Two target functions are studied, a quadratic cost function and the log likelihood function of the dynamically penalized likelihood (DPL) algorithm. The algorithms used are the conjugate gradient, the stochastic adaptive simulated annealing and the DPL. One simple phantom is used to show the development of the analysis tools used and two clinical cases of medium and large dose matrix size (a meningioma and a prostate) are studied in detail. The conclusions reached are that the high number of iterations that is needed to avoid degeneracy is not warranted in clinical practice, as the quality of the optimizations, as judged by the DVHs and dose distributions obtained, does not improve significantly after a certain point. It is also shown that the optimum initial beamlet fluence assignment for analytical iterative algorithms is a uniform distribution, but such an assignment does not help a stochastic method of optimization. Stopping points for the studied algorithms are discussed and the deterioration of DVH characteristics with filtering is shown to be partially recoverable by the use of space-variant filtering techniques.

Algorithms↗

PubMed2003

Absence of multiple local minima effects in intensity modulated optimization with dose-volume constraints.

This paper reports on the analysis of intensity modulated radiation treatment optimization problems in the presence of non-convex feasible parameter spaces caused by the specification of dose-volume constraints for the organs-at-risk (OARs). The main aim was to determine whether the presence of those non-convex spaces affects the optimization of clinical cases in any significant way. This was done in two phases: (1) Using a carefully designed two-dimensional mathematical phantom that exhibits two controllable minima and with randomly initialized beamlet weights, we developed a methodology for exploring the nature of the convergence characteristics of quadratic cost function optimizations (deterministic or stochastic). The methodology is based on observing the statistical behaviour of the residual cost at the end of optimizations in which the stopping criterion is progressively more demanding and carrying out those optimizations to very small error changes per iteration. (2) Seven clinical cases were then analysed with dose-volume constraints that are stronger than originally used in the clinic. The clinical cases are two prostate cases differently posed, a meningioma case, two head-and-neck cases, a spleen case and a spine case. Of the 14 different sets of optimizations (with and without the specification of maximum doses allowed for the OARs), 12 fail to show any effect due to the existence of non-convex feasible spaces. The remaining two sets of optimizations show evidence of multiple minima in the solutions, but those minima are very close to each other in cost and the resulting treatment plans are practically identical, as measured by the quality of the dose-volume histograms (DVHs). We discuss the differences between fluence maps resulting from those similar treatment plans. We provide a possible reason for the observed results and conclude that, although the study is necessarily limited, the annealing characteristics of a simulated annealing method may not be justified in clinical optimization in the presence of dose-volume constraints. The results of optimizations by the Newton gradient (NG) method with a quadratic cost function are reported in detail. An adaptive simulated annealing method, optimizing the same function, and the dynamically penalized likelihood method, optimizing a log likelihood function, have also been used in the study. The results of the latter two methods have only been discussed briefly, as they yielded the same conclusions as the NG method.

Algorithms↗