一种改进的多叶准直器射野分割算法  

Improved algorithm of multileaf collimator field segmentation

作　　者：张鹏程[1] 朱健[1,2] 李元金[1,3] 舒华忠[1] 

机构地区：[1]东南大学影像科学与技术实验室,南京210096 [2]山东省肿瘤医院,济南250117 [3]滁州学院计算机科学与技术系,滁州239000

出　　处：《东南大学学报（自然科学版）》2012年第5期875-879,共5页Journal of Southeast University：Natural Science Edition

基　　金：国家重点基础研究发展计划(973计划)资助项目(2011CB707904);国家自然科学基金资助项目(60911130370);山东省自然科学基金资助项目(ZR2010HQ053)

摘　　要：针对多叶准直器射野分割中使用过多的子野个数和总机器跳数的问题,结合Engel算法和Luan算法的优点,提出了一种改进的多叶准直器射野分割算法.首先将射野强度矩阵按行分割,然后将每一行分割成若干个多叶准直器开口形状和机器跳数对,并将这些准直器开口形状和机器跳数对整合成相应的子野.在整合子野时,每次选取的机器跳数为所有行中最大可选取的机器跳数,从而使得每次分割时尽可能多地减少射野强度矩阵的复杂度.实验结果表明:该算法在减少总子野个数和总机器跳数的同时,能够保证每行中准直器的开口最大;与Engel算法相比,该算法所需计算时间更短.To solve the problem of using too many total numbers of segments and monitor units, an improved algorithm of multileaf collimator field segmentation is proposed based on the Engel algo- rithm and the Luan algorithm. First, the intensity matrix is splitted into rows. Then, each row is segmented into different pairs of multileaf collimator shape and monitor units. Finally, the corre- sponding fields are constituted by these different pairs of multileaf collimator shape and monitor units. In order to reduce the complexity of the intensity matrix as much as possible, the maximum monitor unit of each row is selected at each segment. The experimental results show that the pro- posed algorithm can not only reduce the total number of segments and monitor units, but also maxi- mize the opening area of the multileaf collimator. Besides, the computation time of the proposed algorithm is less than that of the Engel algorithm.

关 键 词：射野分割 多叶准直器 机器跳数 子野个数 

分 类 号：TP391.9[自动化与计算机技术—计算机应用技术]