z-logo
Premium
Smoothing intensity‐modulated beam profiles to improve the efficiency of delivery
Author(s) -
Spirou Spiridon V.,
FournierBidoz Nathalie,
Yang Jie,
Chui ChenShou,
Ling Clifton C.
Publication year - 2001
Publication title -
medical physics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.473
H-Index - 180
eISSN - 2473-4209
pISSN - 0094-2405
DOI - 10.1118/1.1406522
Subject(s) - smoothing , imaging phantom , computer science , smoothness , mathematical optimization , intensity (physics) , inverse problem , homogeneity (statistics) , algorithm , beam (structure) , mathematics , optics , physics , computer vision , mathematical analysis , machine learning
Intensity‐modulated beam profiles are generated by an inverse planning or optimization algorithm, a process that, being computationally complex and intensive, is inherently susceptible to noise and numerical artifacts. These artifacts make delivery of the beams more difficult, oftentimes for little, if any, observable improvement in the dose distributions. In this work we examine two approaches for smoothing the beam profiles. The first approach is to smooth the beam profiles subsequent to each iteration in the optimization process (method A). The second approach is to include a term within the objective function that specifies the smoothness of the profiles as an optimization criterion (method B). The two methods were applied to a phantom study as well as three clinical sites: paraspinal, nasopharynx, and prostate. For the paraspinal and nasopharynx cases, which have critical organs with low tolerance doses in close proximity, method B produced sharper dose gradients, better target dose homogeneity, and more critical organ sparing. In the less demanding prostate case, the two methods give similar results. In addition, method B is more efficient during optimization, requiring fewer iterations, but less efficient during DMLC delivery, requiring a longer beam‐on time.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here