Variable depth recursion algorithm for leaf sequencing.
The processes of extraction and sweep are basic segmentation steps that are used in leaf sequencing algorithms. A modified version of a commercial leaf sequencer changed the way that the extracts are selected and expanded the search space, but the modification maintained the basic search paradigm of evaluating multiple solutions, each one consisting of up to 12 extracts and a sweep sequence. While it generated the best solutions compared to other published algorithms, it used more computation time. A new, faster algorithm selects one extract at a time but calls itself as an evaluation function a user-specified number of times, after which it uses the bidirectional sweeping window algorithm as the final evaluation function. To achieve a performance comparable to that of the modified commercial leaf sequencer, 2-3 calls were needed, and in all test cases, there were only slight improvements beyond two calls. For the 13 clinical test maps, computation speeds improved by a factor between 12 and 43, depending on the constraints, namely the ability to interdigitate and the avoidance of the tongue-and-groove under dose. The new algorithm was compared to the original and modified versions of the commercial leaf sequencer. It was also compared to other published algorithms for 1400, random, 15 X 15, test maps with 3-16 intensity levels. In every single case the new algorithm provided the best solution.
Siochi
R Alfredo C
RA
Department of Radiation Oncology, University of Iowa, 200 Hawkins Street, Iowa City, Iowa 52240, USA. ralfredo-siochi@uiowa.edu
D000465:Algorithms; D003198:Computer Simulation; D008954:Models, Biological; D011874:Radiometry / Q000379:methods*; D011879:Radiotherapy Dosage; D011880:Radiotherapy Planning, Computer-Assisted / Q000379:methods*; D020266:Radiotherapy, Conformal / Q000295:instrumentation* / Q000379:methods*; D015203:Reproducibility of Results; D012680:Sensitivity and Specificity