Book chapter
The Matrix Orthogonal Decomposition Problem in Intensity-Modulated Radiation Therapy
Computing and Combinatorics, pp.156-165
Lecture Notes in Computer Science, Springer Berlin Heidelberg
2006
DOI: 10.1007/11809678_18
Abstract
In this paper, we study an interesting matrix decomposition problem that seeks to decompose a “complicated” matrix into two “simpler” matrices while minimizing the sum of the horizontal complexity of the first sub-matrix and the vertical complexity of the second sub-matrix. The matrix decomposition problem is crucial for improving the “step-and-shoot” delivery efficiency in Intensity-Modulated Radiation Therapy, which aims to deliver a highly conformal radiation dose to a target tumor while sparing the surrounding normal tissues. Our algorithm is based on a non-trivial graph construction scheme, which enables us to formulate the decomposition problem as computing a minimum s-t cut in a 3-D geometric multi-pillar graph. Experiments on randomly generated intensity map matrices and on clinical data demonstrated the efficiency of our algorithm.
Details
- Title: Subtitle
- The Matrix Orthogonal Decomposition Problem in Intensity-Modulated Radiation Therapy
- Creators
- Xin Dou - University of IowaXiaodong Wu - University of IowaJohn E Bayouth - University of IowaJohn M Buatti - University of Iowa
- Resource Type
- Book chapter
- Publication Details
- Computing and Combinatorics, pp.156-165
- Publisher
- Springer Berlin Heidelberg; Berlin, Heidelberg
- Series
- Lecture Notes in Computer Science
- DOI
- 10.1007/11809678_18
- eISSN
- 1611-3349
- ISSN
- 0302-9743
- Language
- English
- Date published
- 2006
- Academic Unit
- Electrical and Computer Engineering; Otolaryngology; Radiation Oncology; Neurosurgery; The Iowa Institute for Biomedical Imaging
- Record Identifier
- 9984197216902771
Metrics
17 Record Views