The dose-volume constraint satisfaction problem for inverse treatment planning with field segments

Darek Michalski, Ying Xiao, Yair Censor, James M. Galvin

Research output: Contribution to journalArticlepeer-review

Abstract

The prescribed goals of radiation treatment planning are often expressed in terms of dose-volume constraints. We present a novel formulation of a dose-volume constraint satisfaction search for the discretized radiation therapy model. This approach does not rely on any explicit cost function. Inverse treatment planning uses the aperture-based approach with predefined, according to geometric rules, segmental fields. The solver utilizes the simultaneous version of the cyclic subgradient projection algorithm. This is a deterministic iterative method designed for solving the convex feasibility problems. A prescription is expressed with the set of inequalities imposed on the dose at the voxel resolution. Additional constraint functions control the compliance with selected points of the expected cumulative dose-volume histograms. The performance of this method is tested on prostate and head-and-neck cases. The relationships with other models and algorithms of similar conceptual origin are discussed. The demonstrated advantages of the method are: the equivalence of the algorithmic and prescription parameters, the intuitive setup of free parameters, and the improved speed of the method as compared to similar iterative as well as other techniques. The technique reported here will deliver approximate solutions for inconsistent prescriptions.

Original languageEnglish
Pages (from-to)601-616
Number of pages16
JournalPhysics in Medicine and Biology
Volume49
Issue number4
DOIs
StatePublished - 21 Feb 2004

ASJC Scopus subject areas

  • Radiological and Ultrasound Technology
  • Radiology Nuclear Medicine and imaging

Fingerprint

Dive into the research topics of 'The dose-volume constraint satisfaction problem for inverse treatment planning with field segments'. Together they form a unique fingerprint.

Cite this