|
|
|
|||
| Journals Home | Journals List | EJs Extra | This Journal | Search | Authors | Referees | Librarians | User Options | Help | | ||||
2004 Phys. Med. Biol. 49 33-54 doi: 10.1088/0031-9155/49/1/003
![]()
|
||||
Abstract. Dynamic multileaf collimator (DMLC) intensity modulated radiation therapy (IMRT) is used to deliver intensity modulated beams using a multileaf collimator (MLC), with the leaves in motion. DMLC-IMRT requires the conversion of a radiation intensity map into a leaf sequence file that controls the movement of the MLC while the beam is on. It is imperative that the intensity map delivered using the leaf sequence file be as close as possible to the intensity map generated by the dose optimization algorithm, while satisfying hardware constraints of the delivery system. Optimization of the leaf-sequencing algorithm has been the subject of several recent investigations. In this work, we present a systematic study of the optimization of leaf-sequencing algorithms for dynamic multileaf collimator beam delivery and provide rigorous mathematical proofs of optimized leaf sequence settings in terms of monitor unit (MU) efficiency under the most common leaf movement constraints that include leaf interdigitation constraint. Our analytical analysis shows that leaf sequencing based on unidirectional movement of the MLC leaves is as MU efficient as bi-directional movement of the MLC leaves.
Print publication: Issue 1 (7 January 2004)| Post to CiteUlike | | Post to Connotea | | Post to Bibsonomy |
|
Journals Home | Journals List | EJs Extra | This Journal | Search | Authors | Referees | Librarians | User Options | Help | Recommend this journal EndNote, ProCite ® and Reference Manager ® are registered trademarks of ISI Researchsoft. Copyright © Institute of Physics and IOP Publishing Limited 2009. Use of this service is subject to compliance with the Terms and Conditions of use. In particular, reselling and systematic downloading of files is prohibited. Help: Cookies | Data Protection. Privacy policy Disclaimer |