Conference proceeding
Efficient Algorithms for Intensity Map Splitting Problems in Radiation Therapy
Computing and Combinatorics, pp.504-513
Lecture Notes in Computer Science
2005
DOI: 10.1007/11533719_51
Abstract
In this paper, we study several interesting intensity map splitting (IMSp) problems that arise in Intensity-Modulated Radiation Therapy (IMRT), a state-of-the-art radiation therapy technique for cancer treatments. In current clinical practice, a multi-leaf collimator (MLC) with a maximum leaf spread is used to deliver the prescribed intensity maps (IMs). However, the maximum leaf spread of an MLC may require to split a large intensity map into several abutting sub-IMs each being delivered separately, which results in prolonged treatment time. Few IM splitting techniques reported in the literature has addressed the issue of treatment delivery efficiency for large IMs. We develop a unified approach for solving the IMSp problems while minimizing the total beam-on time in various settings. Our basic idea is to formulate the IMSp problem as computing a k-link shortest path in a directed acyclic graph. We carefully characterize the intrinsic structures of the graph, yielding efficient algorithms for the IMSp problems.
Details
- Title: Subtitle
- Efficient Algorithms for Intensity Map Splitting Problems in Radiation Therapy
- Creators
- Xiaodong Wu - Department of Electrical and Computer Engineering, Department of Radiation Oncology, The University of Iowa, Iowa City, USA
- Resource Type
- Conference proceeding
- Publication Details
- Computing and Combinatorics, pp.504-513
- Publisher
- Springer Berlin Heidelberg; Berlin, Heidelberg
- Series
- Lecture Notes in Computer Science
- DOI
- 10.1007/11533719_51
- eISSN
- 1611-3349
- ISSN
- 0302-9743
- Language
- English
- Date published
- 2005
- Academic Unit
- Radiation Oncology; Electrical and Computer Engineering
- Record Identifier
- 9984046817802771
Metrics
7 Record Views