A computational solution of the inverse problem in radiation-therapy treatment planning

https://doi.org/10.1016/0096-3003(88)90064-1Get rights and content

Abstract

Radiation therapy concerns the delivery of the proper dose of radiation to a tumor volume without causing irreparable damage to healthy tissue and critical organs. The forward problem refers to calculating the dose distribution that would be delivered to a measured patient cross-section when the radiation field generated by the beam sources is specified. The inverse problem refers to calculating the radiation field that will provide a specified dose distribution in the patient. The forward and inverse problems of radiation-therapy treatment planning are first formulated in their continuous versions, and the point is made that, in this field of application, the inverse problem calls for the inversion of an operator for which no analytic closed-form mathematical representation exists. To attack the inverse problem under such circumstances, a discretized model is set up in which both patient section and radiation field are finely discretized. This leads to a linear feasibility problem, which is solved by a relaxation method. The paper includes full details of this new approach, with discussion of technical aspects such as dose apportionment, software development, and experimental results. Consequences and limitations as well as a precise comparison with other methodologies are also discussed.

References (24)

  • T.S. Motzkin et al.

    The relaxation method for linear inequalities

    Canad. J. Math.

    (1954)
  • Y. Censor

    Row-action methods for huge and sparse systems and their applications

    SIAM Rev.

    (1981)
  • Cited by (92)

    • Optimization model applied to radiotherapy planning problem with dose intensity and beam choice

      2020, Applied Mathematics and Computation
      Citation Excerpt :

      Nonlinear methods can be solved by classic Newton’s methods [19] or even using fuzzy logic systems [20,21]. However, based on [7-18] we employ matheuristics methods to solve the new model, in which the metaheuristics Variable Neighbourhood Search (VNS) and Tabu Search (TS) solve the beam choice problem and convert the model into a mixed integer linear. From then on, one uses exact methods Primal Simplex (PS), Dual Simplex (DS) and Interior Point Method (IPM) for the dose intensity problem and final solution.

    • Intensity-Modulated Radiation Therapy Planning

      2014, Comprehensive Biomedical Physics
    • From analytic inversion to contemporary IMRT optimization: Radiation therapy planning revisited from a mathematical perspective

      2012, Physica Medica
      Citation Excerpt :

      On the other hand, the main ingredients of the algebraic inverse planning approach were, separately, known when this approach was proposed. Full discretization was known and used in other fields and iterative projection methods such as the sequential projection method of Agmon et al. that we used in [16] (also used later by Lee et al. [37] under a different name) or the Cimmino simultaneous projections method [22] that we used in [17] were known. See, e.g., Bauschke and Borwein [6] or Censor and Zenios [20, Chapter 5] for general presentations of iterative projection methods for the convex feasibility problem and Censor et al. [18] for a very recent work.

    View all citing articles on Scopus

    A preliminary report on this research was presented at the Eighth International Conference on the Use of Computers in Radiation Therapy, 9-12 July 1984, Toronto, Canada [24].

    View full text