The intensity level reduction in radiation therapy

Authors:
Xiaodong Wu;John Abraham
Affiliations:
The University of Texas - Pan American Edinburg, Texas;The University of Texas - Pan American Edinburg, Texas
Venue:
Proceedings of the 2005 ACM symposium on Applied computing
Year:
2005

Citing 3
Cited 0

Optimal Terrain Construction Problems and Applications in Intensity-Modulated Radiation Therapy

ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Geometric algorithms for static leaf sequencing problems in radiation therapy

Proceedings of the nineteenth annual symposium on Computational geometry
Minimizing beam-on time in cancer radiation treatment using multileaf collimators

Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we study an interesting intensity level reduction (ILR) problem, which is crucial for solving the "step-and-shoot" delivery planning problem in Intensity-Modulated Radiation Therapy (IMRT). IMRT aims to deliver a highly conformal radiation dose to a target tumor while sparing the surrounding normal tissues. Effective intensity level reduction approaches significantly reduce the patient's exposure under the radiation and improve the treatment efficiency. We propose a new intensity level reduction method for step-and-shoot delivery planning, and further model the intensity level reduction problem as computing a set of shortest monotone paths (SMPs) in certain specific geometric graphs, called multi-column graphs, of pseudo-polynomial sizes. Based on a judicious characterization of the intrinsic geometric structures of the graphs, we develop a novel graph pruning scheme and compute the SMPs without explicitly constructing the graphs, yielding an efficient O(mn logn) time algorithm for solving the intensity level reduction problem on an intensity map (specifying a radiation dose prescription) of size m x n.