Minimizing Total Variation for Field Splitting with Feathering in Intensity-Modulated Radiation Therapy

  • Yunlong Liu
  • Xiaodong Wu
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6213)


In this paper, we study an interesting geometric partition problem, called optimal field splitting, which arises in Intensity-Modulated Radiation Therapy (IMRT). In current clinical practice, a multileaf collimator (MLC) with a maximum leaf spread constraint is used to deliver the prescribed radiation intensity maps (IMs). However, the maximum leaf spread of an MLC may require to split a large IM into several overlapping sub-IMs with each being delivered separately. We develop an efficient algorithm for solving the field splitting problem while minimizing the total variation of the resulting sub-IMs, thus improving the treatment delivery efficiency. Our basic idea is to formulate the field splitting problem as computing a shortest path in a directed acyclic graph, which expresses a special “layered” structure. The edge weights in the graph can be computed by solving an optimal vector decomposition problem using local searching and the proximity scaling technique as we can prove the L\(^\natural\)-convexity and totally unimodularity of the problem. Moreover, the edge weights of the graph satisfy the Monge property, which enables us to solve this shortest path problem by examining only a small portion of the graph, yielding a time-efficient algorithm.


Short Path Directed Acyclic Graph Edge Weight Short Path Problem Integer Programming Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Aggarwal, A., Klawe, M., Moran, S., Shor, P., Wilber, R.: Geometric applications of a matrix-searching algorithm. Algorithmica 2(1), 195–208 (1987)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Bortfeld, T., Craft, D., Halabi, T., Trofimov, A., Monz, M., Küfer, K.: Quantifying the Tradeoff Between Complexity and Conformality. Medical Physics 32, 2085 (2005)CrossRefGoogle Scholar
  3. 3.
    Chen, D., Healy, M., Wang, C., Wu, X.: A New Field Splitting Algorithm for Intensity-Modulated Radiation Therapy. In: Lin, G. (ed.) COCOON 2007. LNCS, vol. 4598, p. 4. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  4. 4.
    Chen, D., Hu, X., Luan, S., Wang, C.: Geometric algorithms for static leaf sequencing problems in radiation therapy. In: Proceedings of the nineteenth annual symposium on Computational geometry, pp. 88–97. ACM, New York (2003)Google Scholar
  5. 5.
    Chen, D., Wang, C.: Field splitting problems in intensity-modulated radiation therapy. In: Asano, T. (ed.) ISAAC 2006. LNCS, vol. 4288, p. 690. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  6. 6.
    Fowler, J., Welsh, J., Howard, S.: Loss of biological effect in prolonged fraction delivery. International journal of radiation oncology, biology, physics 59(1), 242–249 (2004)CrossRefGoogle Scholar
  7. 7.
    Hochbaum, D., Shanthikumar, J.: Convex separable optimization is not much harder than linear optimization. Journal of the ACM (JACM) 37(4), 843–862 (1990)MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    Kamath, S., Sahni, S., Li, J., Palta, J., Ranka, S.: A Generalized Field Splitting Algorithm for Optimal IMRT Delivery Efficiency. Medical Physics 32, 1890 (2005)CrossRefGoogle Scholar
  9. 9.
    Kamath, S., Sahni, S., Palta, J., Ranka, S.: Algorithms for optimal sequencing of dynamic multileaf collimators. Physics in Medicine and Biology 49(1), 33–54 (2004)CrossRefzbMATHGoogle Scholar
  10. 10.
    Klawe, M., Kleitman, D.: An almost linear time algorithm for generalized matrix searching. SIAM Journal on Discrete Mathematics 3, 81 (1990)MathSciNetCrossRefzbMATHGoogle Scholar
  11. 11.
    Kolmogorov, V., Shioura, A.: New Algorithms for the Dual of the Convex Cost Network Flow Problem with Application to Computer Vision. Mathematical Programming (2007) (Submitted)Google Scholar
  12. 12.
    Murota, K.: Discrete convex analysis. Mathematical Programming 83(1), 313–371 (1998)MathSciNetzbMATHGoogle Scholar
  13. 13.
    Murota, K.: Discrete Convex Analysis: Monographs on Discrete Mathematics and Applications, vol. 10. Society for Industrial and Applied Mathematics, Philadelphia (2003)CrossRefGoogle Scholar
  14. 14.
    Murota, K.: On steepest descent algorithms for discrete convex functions. SIAM Journal on Optimization 14(3), 699–707 (2004)MathSciNetCrossRefzbMATHGoogle Scholar
  15. 15.
    Oldham, M., Rowbottom, C.: Radiosurgery with a motorized micro-multileaf-collimator: initial experiences in planning and commissioning. In: Proceedings of the 43rd Annual Meeting of the American Association of Physicists in Medicine, AAPM (2001)Google Scholar
  16. 16.
    Süss, P., Küfer, K.: Smooth intensity maps and the Bortfeld-Boyer sequencer. Berichte des Fraunhofer-Instituts für Techno- und Wirtschaftsmathematik Report 109 (2007)Google Scholar
  17. 17.
    Webb, S.: Intensity-modulated radiation therapy. Inst. of Physics Pub. Inc. (2001)Google Scholar
  18. 18.
    Wu, Q., Arnfield, M., Tong, S., Wu, Y., Mohan, R.: Dynamic splitting of large intensity-modulated fields. Physics in Medicine and Biology 45, 1731–1740 (2000)CrossRefGoogle Scholar
  19. 19.
    Wu, X.: Efficient algorithms for intensity map splitting problems in radiation therapy. In: Wang, L. (ed.) COCOON 2005. LNCS, vol. 3595, p. 504. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  20. 20.
    Wu, X., Dou, X., Bayouth, J., Buatti, J.: New algorithm for field splitting in radiation therapy. In: Tokuyama, T. (ed.) ISAAC 2007. LNCS, vol. 4835, pp. 692–703. Springer, Heidelberg (2007)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Yunlong Liu
    • 1
  • Xiaodong Wu
    • 1
    • 2
  1. 1.Electrical and Computer EngineeringThe University of IowaUSA
  2. 2.Department of Radiation OncologyThe University of IowaUSA

Personalised recommendations