z-logo
Premium
Optimization of intensity modulated beams with volume constraints using two methods: Cost function minimization and projections onto convex sets
Author(s) -
Cho Paul S.,
Lee Shinhak,
Marks Robert J.,
Oh Seho,
Sutlief Steve G.,
Phillips Mark H.
Publication year - 1998
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.598218
Subject(s) - volume (thermodynamics) , mathematical optimization , intensity modulation , dosimetry , convex optimization , penalty method , minification , projection (relational algebra) , simulated annealing , computer science , intensity (physics) , algorithm , mathematics , regular polygon , optics , physics , nuclear medicine , medicine , geometry , quantum mechanics , phase modulation , phase noise
For accurate prediction of normal tissue tolerance, it is important that the volumetric information of dose distribution be considered. However, in dosimetric optimization of intensity modulated beams, the dose–volume factor is usually neglected. In this paper we describe two methods of volume‐dependent optimization for intensity modulated beams such as those generated by computer‐controlled multileaf collimators. The first method uses a volume sensitive penalty function in which fast simulated annealing is used for cost function minimization (CFM). The second technique is based on the theory of projections onto convex sets (POCS) in which the dose‐volume constraint is replaced by a limit on integral dose. The ability of the methods to respect the dose–volume relationship was demonstrated by using a prostate example involving partial volume constraints to the bladder and the rectum. The volume sensitive penalty function used in the CFM method can be easily adopted by existing optimization programs. The convex projection method can find solutions in much shorter time with minimal user interaction.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here