@inproceedings{084f17bd1def4a8da003cc2ea429a2de,
title = "The matrix orthogonal decomposition problem in intensity-modulated radiation therapy",
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.",
author = "Xin Dou and Xiaodong Wu and Bayouth, {John E.} and Buatti, {John M.}",
year = "2006",
doi = "10.1007/11809678_18",
language = "English (US)",
isbn = "3540369252",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer-Verlag",
pages = "156--165",
booktitle = "Computing and Combinatorics - 12th Annual International Conference, COCOON 2006, Proceedings",
note = "12th Annual International Conference on Computing and Combinatorics, COCOON 2006 ; Conference date: 15-08-2006 Through 18-08-2006",
}