The Matrix Orthogonal Decomposition Problem in Intensity-Modulated Radiation Therapy
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.
KeywordsDirected Edge Decomposition Problem Base Vertex Vertical Complexity Total Edge Weight
Unable to display preview. Download preview PDF.
- 3.Chen, D.Z., Hu, X.S., Luan, S., Wang, C.: Mountain Reduction, Block Matching, and Medical Applications. In: Proc. of the 21st Annual Symposium on Computational Geometry (SoCG), Pisa, Italy, pp. 35–44 (2005)Google Scholar
- 7.Engel, K.: A New Algorithm for Optimal Multileaf Collimator Field Segmentation (March 2003), http://www.trinity.edu/aholder/HealthApp/oncology/papers/paperlist.html
- 8.Hardemark, B., Rehbinder, H., Lof, J.: Rotating the MLC Between Segments Improves Performance in step-andshoot IMRT delivery. In: The AAPM 45th Meeting, Med. Phys., August 10-14, vol. 30 (2003)Google Scholar
- 15.Webb, S.: Intensity-Modulated Radiation Therapy, Institute of Cancer Research and Royal Marsden NHS Trust (January 2001)Google Scholar
- 20.Kim, J., Zabih, R.: A Segmentation Algorithm for Contrast-Enhanced Images. In: Proc. IEEE Int’l Conf. Computer Vision, pp. 502–509 (2003)Google Scholar