# [1]张鹏程,朱健,李元金,等.一种改进的多叶准直器射野分割算法[J].东南大学学报(自然科学版),2012,42(5):875-879.[doi:10.3969/j.issn.1001-0505.2012.05.015] 　Zhang Pengcheng,Zhu Jian,Li Yuanjin,et al.Improved algorithm of multileaf collimator field segmentation[J].Journal of Southeast University (Natural Science Edition),2012,42(5):875-879.[doi:10.3969/j.issn.1001-0505.2012.05.015] 点击复制 一种改进的多叶准直器射野分割算法() 分享到： var jiathis_config = { data_track_clickback: true };

42

2012年第5期

875-879

2012-09-20

## 文章信息/Info

Title:
Improved algorithm of multileaf collimator field segmentation

1 东南大学影像科学与技术实验室, 南京 210096; 2 山东省肿瘤医院, 济南 250117; 3 滁州学院计算机科学与技术系, 滁州 239000
Author(s):
1 Laboratory of Image Science and Technology, Southeast University, Nanjing 210096, China
2 Shandong Tumor Hospital, Jinan 250117, China
3 Department of Computer Science and Technology, Chuzhou University, Chuzhou 239000,China

Keywords:

TP391.9
DOI:
10.3969/j.issn.1001-0505.2012.05.015

Abstract:
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 algorithm 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 corresponding 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 proposed algorithm can not only reduce the total number of segments and monitor units, but also maximize the opening area of the multileaf collimator. Besides, the computation time of the proposed algorithm is less than that of the Engel algorithm.

## 参考文献/References:

[1] Boyer A L,Yu C X.Intensity-modulated radiation therapy with dynamic multileaf collimators[J].Semin Radiat Oncol,1999,9(1):48-59.
[2] 胡逸民.肿瘤放射物理学[M].北京:原子能出版社,1999:550.
[3] Dai J,Zhu Y.Minimizing the number of segments in a delivery sequence for intensity-modulated radiation therapy with multileaf collimator[J].Med Phys,2001,28(10):2113-2120.
[4] Xia P,Verhey L J.Multileaf collimator leaf sequencing algorithm for intensity modulated beams with multiple static segments[J].Med Phys,1998,25(8):1424-1434.
[5] 朱健,刘敏,李建彬,等.多叶光栅静态调强技术对鼻咽癌放疗中危及器官受量的作用[J].中华放射医学与防护杂志,2009,26(2):171-173.
Zhu Jian,Liu Min,Li Jianbin,et al.The role of the organ at risk in radiotherapy for nasopharyngeal carcinoma using multileaf in collimator static intensity modulated [J].Chin J Radio Med Prot,2009,26(2):171-173.(in Chinese)
[6] Kalinowski T.Realization of intensity modulated radiation fields using multileaf collimators [C] //Lecture Notes in Computer Science.Berlin:Springer-Verlag,2006,4123:1010-1055.
[7] Engel K.A new algorithm for optimal multileaf collimator field segmentation[J].Discrete Appl Math,2005,152(1/2/3):35-51.
[8] Kalinowski T.A duality based algorithm for multileaf collimator field segmentation with interleaf collision constraint[J].Discrete Appl Math,2005,152(1/2/3):52-88.
[9] Siochi R A C.Variable depth recursion algorithm for leaf sequencing[J].Med Phys,2007,34(2):664-672.
[10] Cambazard H,O’Mahony E,O’Sullivan B.A shortest path-based approach to the multileaf collimator sequencing problem[J].Discrete Appl Math,2012,160(1/2):81-99.
[11] Taskin Z,Smith J,Romeijn H,et al.Optimal multileaf collimator leaf sequencing in IMRT treatment planning[J].Operations Research,2010,58(3):674-690.
[12] Luan S,Saia J,Young M.Approximation algorithms for minimizing segments in radiation therapy[J].Information Processing Letters,2007,101(6):239-244.
[13] Biedl T,Durocher S,Hoos H.et al.A note on improving the performance of approximation algorithms for radiation therapy[J].Information Processing Letters,2011,111(7):326-333.
[14] Biedl T,Durocher S,Engelbeen C,et al.Faster optimal algorithms for segment minimization with small maximal value[C] //Proceedings of the 12th International Conference on Algorithms and Data Structures.New York,USA,2011:86-97.