A leaf sequencing algorithm for an orthogonal dual-layer multileaf collimator.

IF 1.3 Q3 RADIOLOGY, NUCLEAR MEDICINE & MEDICAL IMAGING Biomedical Physics & Engineering Express Pub Date : 2024-09-18 DOI:10.1088/2057-1976/ad6c52
Weijie Cui, Jianrong Dai
{"title":"A leaf sequencing algorithm for an orthogonal dual-layer multileaf collimator.","authors":"Weijie Cui, Jianrong Dai","doi":"10.1088/2057-1976/ad6c52","DOIUrl":null,"url":null,"abstract":"<p><p><i>Purpose</i>. Dual layer MLC (DMLC) has have been adopted in several commercial products and one major challenge in DMLC usage is leaf sequencing for intensity-modulated radiation therapy (IMRT). In this study we developed a leaf sequencing algorithm for IMRT with an orthogonal DMLC.<i>Methods and Materials</i>. This new algorithm is inspired by the algorithm proposed by Dai and Zhu for IMRT with single layer MLC (SMLC). It iterately determines a delivery segment intensity and corresponding segment shape for a given fluence matrix and leaves residual fluence matrix to following iterations. The segment intensity is determined according to complexities of residual fluence matrix when segment intensity varies from one to highest level in the matrix. The segment intensity and corresponding segment shape that result least complexity was selected. Although the algorithm framework is similar to Dai and Zhu's algorithm, this new algorithm develops complexity algorithms along with rules for determining segment leaf settings when delivered with orthogonal DMLC. This algorithm has been evaluated with 9 groups of randomly generated fluence matrices with various dimensions and intensity levels. Sixteen fluence matrices generated in Pinnacle system for two clinical IMRT examples were also used for evaluation. Statistical information of leaf sequences generated with this algorithm for both the random and clinical matrices were compared to the results of two typical algorithms for SMLC: that proposed by Dai and Zhu and that proposed by Bortfled.<i>Results</i>. Compared to the SMLC delivery sequences generated with Dai and Zhu's algorithm, the proposed algorithm for orthogonal DMLC delivery reduces the average number of segments by 27.7% ∼ 41.8% for 9 groups of randomly generated fluence matrices and 10.5% ∼ 41.7% for clinical ones. When comparing MU efficiency between different algorithms, it is observed that the proposed algorithm performs better than the optimal efficiency of SMLC delivery when dealing with simple fluence matrices, but slightly worse when handling complex ones.<i>Conclusion</i>. This new algorithm generates leaf sequences for orthogonal DMLC delivery with high delivery efficiency in terms of number of leaf segments. This algorithm has potential to work well with orthogonal DMLC for improving efficiency or quality of IMRT.</p>","PeriodicalId":8896,"journal":{"name":"Biomedical Physics & Engineering Express","volume":null,"pages":null},"PeriodicalIF":1.3000,"publicationDate":"2024-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Biomedical Physics & Engineering Express","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1088/2057-1976/ad6c52","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"RADIOLOGY, NUCLEAR MEDICINE & MEDICAL IMAGING","Score":null,"Total":0}
引用次数: 0

Abstract

Purpose. Dual layer MLC (DMLC) has have been adopted in several commercial products and one major challenge in DMLC usage is leaf sequencing for intensity-modulated radiation therapy (IMRT). In this study we developed a leaf sequencing algorithm for IMRT with an orthogonal DMLC.Methods and Materials. This new algorithm is inspired by the algorithm proposed by Dai and Zhu for IMRT with single layer MLC (SMLC). It iterately determines a delivery segment intensity and corresponding segment shape for a given fluence matrix and leaves residual fluence matrix to following iterations. The segment intensity is determined according to complexities of residual fluence matrix when segment intensity varies from one to highest level in the matrix. The segment intensity and corresponding segment shape that result least complexity was selected. Although the algorithm framework is similar to Dai and Zhu's algorithm, this new algorithm develops complexity algorithms along with rules for determining segment leaf settings when delivered with orthogonal DMLC. This algorithm has been evaluated with 9 groups of randomly generated fluence matrices with various dimensions and intensity levels. Sixteen fluence matrices generated in Pinnacle system for two clinical IMRT examples were also used for evaluation. Statistical information of leaf sequences generated with this algorithm for both the random and clinical matrices were compared to the results of two typical algorithms for SMLC: that proposed by Dai and Zhu and that proposed by Bortfled.Results. Compared to the SMLC delivery sequences generated with Dai and Zhu's algorithm, the proposed algorithm for orthogonal DMLC delivery reduces the average number of segments by 27.7% ∼ 41.8% for 9 groups of randomly generated fluence matrices and 10.5% ∼ 41.7% for clinical ones. When comparing MU efficiency between different algorithms, it is observed that the proposed algorithm performs better than the optimal efficiency of SMLC delivery when dealing with simple fluence matrices, but slightly worse when handling complex ones.Conclusion. This new algorithm generates leaf sequences for orthogonal DMLC delivery with high delivery efficiency in terms of number of leaf segments. This algorithm has potential to work well with orthogonal DMLC for improving efficiency or quality of IMRT.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
正交双层多叶准直器的叶片排序算法。
目的:双层 MLC(DMLC)已被多个商业产品采用,DMLC 使用中的一个主要挑战是强度调制放射治疗(IMRT)的叶片排序。在这项研究中,我们为采用正交 DMLC 的 IMRT 开发了一种叶片排序算法:这种新算法受 Dai 和 Zhu 提出的单层 MLC(SMLC)IMRT 算法的启发。它针对给定的通量矩阵迭代确定投射区段强度和相应的区段形状,并将残余通量矩阵留给后续迭代。当分段强度在矩阵中从一级到最高级不等时,分段强度根据残余通量矩阵的复杂性来确定。选择复杂度最小的网段强度和相应的网段形状。我们用随机生成的 9 组不同维度和强度等级的通量矩阵对该算法进行了评估。在 Pinnacle 系统中为两个临床 IMRT 示例生成的 16 个剂量矩阵也被用于评估。使用该算法生成的随机矩阵和临床矩阵叶序列的统计信息与两种典型的 SMLC 算法(Dai 和 Zhu 提出的算法以及 Bortfled 提出的算法)的结果进行了比较:与用 Dai 和 Zhu 算法生成的 SMLC 传输序列相比,所提出的正交 DMLC 传输算法在 9 组随机生成的荧光矩阵中平均减少了 27.7%~41.8% 的段数,在临床矩阵中平均减少了 10.5%~41.7% 的段数。在比较不同算法的 MU 效率时发现,在处理简单通量矩阵时,拟议算法的表现优于 SMLC 传输的最佳效率,但在处理复杂通量矩阵时,拟议算法的表现稍差。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Biomedical Physics & Engineering Express
Biomedical Physics & Engineering Express RADIOLOGY, NUCLEAR MEDICINE & MEDICAL IMAGING-
CiteScore
2.80
自引率
0.00%
发文量
153
期刊介绍: BPEX is an inclusive, international, multidisciplinary journal devoted to publishing new research on any application of physics and/or engineering in medicine and/or biology. Characterized by a broad geographical coverage and a fast-track peer-review process, relevant topics include all aspects of biophysics, medical physics and biomedical engineering. Papers that are almost entirely clinical or biological in their focus are not suitable. The journal has an emphasis on publishing interdisciplinary work and bringing research fields together, encompassing experimental, theoretical and computational work.
期刊最新文献
Optimizing pulmonary chest x-ray classification with stacked feature ensemble and swin transformer integration. Multi-level digital-twin models of pulmonary mechanics: correlation analysis of 3D CT lung volume and 2D Chest motion. Radar-based contactless heart beat detection with a modified Pan-Tompkins algorithm. Systematic characterization of new EBT4 radiochromic films in clinical x-ray beams. In silicodosimetry for a prostate cancer treatment using198Au nanoparticles.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1