PO57

Philippe Chatigny, Cédric Bélanger, Éric Poulin, Luc Beaulieu
{"title":"PO57","authors":"Philippe Chatigny, Cédric Bélanger, Éric Poulin, Luc Beaulieu","doi":"10.1016/j.brachy.2023.06.158","DOIUrl":null,"url":null,"abstract":"Purpose In the past years, a key improvement in the generation of treatment plans in high-dose-rate (HDR) brachytherapy comes from the development of multicriteria optimization (MCO) algorithms that generate thousands of pareto optimal plans within seconds. This brings a shift, from the objective of generating an acceptable plan to choosing the best plans out of thousands. Not only does the chosen plan depend on the planner, it also takes about 5-10 minutes to choose the preferred plan. The purpose of the present work is to speed up this process and to find a common ground for different specialists regarding the plan quality. Materials and Methods An AI algorithm based on the ResNet deep neural network architecture is developed to choose the best plan(s) from the generated plans. The algorithm classifies the plans, from the 3D dose distribution and anatomical structures, in 3 different classes, (1) violating hard (minimum) criteria, (2) respecting hard criteria and (3) respecting soft criteria, with every class being more stringent than the last one (increase in plan quality). The three classes are based on dosimetric criteria used at our institution for 15 Gy in a single fraction. For the classification, the more confident the model is that a plan belongs to class 3, the better is the plan. To mimic the behaviour of experts, visual-like criteria are implemented for the bladder, rectum and urethra. Visual criteria are defined as 100% and 125% isodose distance from the organ at risk. During training, the algorithm learns the link between the inputs (3D dose and anatomy) and outputs (visual-like and DVH's criteria). 850 previously treated prostate's cancer patients are used for the training and another set of 20 patients previously evaluated by two experts (clinical medical physicist) as part of an inter-observer MCO study are used for validation. For the training, 100 plans are generated for each patient using MCO and 27 000 plans are chosen at random to have the same quantity in each class. A NVIDIA GeForce RTX 3090 is used for training. Results The model takes 20 s to classify 2000 plans in order of preference (vs 5-10 mins for experts to rank 4 preferred plans). Currently, the training time is not optimized and it takes less than 2 days to train on the 27 000 plans with 75 epochs. For the 20 validation patients, 39.9 ± 20.2%, 46.4 ± 15.3% and 14.5 ± 21.9% of the plan are in class 1, 2 and 3 respectively. Table 1 shows the results obtained on 20 cases, each with 2000 plans; the mean and deviation are calculated based on the plan chosen by the model and by the experts. The table includes the best ranked and worst ranked plan of class 3. Looking at the best plan according to the model and comparing it with the plan chosen by the two experts show that the behaviour is similar. Out of the 40 chosen plans by the two experts, on 3 occasions our model ranked the same plan as the best plan. Looking more in depth, we find that the median ranking of the plans chosen by expert 1 and 2 is 71.5 and 136.5 respectively out of 2000. In one of the cases, there is no plan respecting the DVH criteria of class 3 and the result is suboptimal; the plan chosen by each expert does not respect only 1 of the criteria while the plan chosen by our model does not respect 3 criteria. This type of behaviour is undesirable and one of the next steps is to address this rare problem, where it is unfeasible to reach all criteria. Adding visual criteria restricted the number of plans which were considered for class number 3 from 16 500 (originally) to 9 000. Conclusions The approach is fast, adding negligible time to MCO planning, and preliminary results demonstrated the potential for clinical use. The approach is flexible with the possibility to adapt all criteria as desired. Future work will investigate model improvement, the non-inferiority of the best class 3 plan by the expert and methods to quickly restrict the number of navigated plans in order to obtain faster planning time. In the past years, a key improvement in the generation of treatment plans in high-dose-rate (HDR) brachytherapy comes from the development of multicriteria optimization (MCO) algorithms that generate thousands of pareto optimal plans within seconds. This brings a shift, from the objective of generating an acceptable plan to choosing the best plans out of thousands. Not only does the chosen plan depend on the planner, it also takes about 5-10 minutes to choose the preferred plan. The purpose of the present work is to speed up this process and to find a common ground for different specialists regarding the plan quality. An AI algorithm based on the ResNet deep neural network architecture is developed to choose the best plan(s) from the generated plans. The algorithm classifies the plans, from the 3D dose distribution and anatomical structures, in 3 different classes, (1) violating hard (minimum) criteria, (2) respecting hard criteria and (3) respecting soft criteria, with every class being more stringent than the last one (increase in plan quality). The three classes are based on dosimetric criteria used at our institution for 15 Gy in a single fraction. For the classification, the more confident the model is that a plan belongs to class 3, the better is the plan. To mimic the behaviour of experts, visual-like criteria are implemented for the bladder, rectum and urethra. Visual criteria are defined as 100% and 125% isodose distance from the organ at risk. During training, the algorithm learns the link between the inputs (3D dose and anatomy) and outputs (visual-like and DVH's criteria). 850 previously treated prostate's cancer patients are used for the training and another set of 20 patients previously evaluated by two experts (clinical medical physicist) as part of an inter-observer MCO study are used for validation. For the training, 100 plans are generated for each patient using MCO and 27 000 plans are chosen at random to have the same quantity in each class. A NVIDIA GeForce RTX 3090 is used for training. The model takes 20 s to classify 2000 plans in order of preference (vs 5-10 mins for experts to rank 4 preferred plans). Currently, the training time is not optimized and it takes less than 2 days to train on the 27 000 plans with 75 epochs. For the 20 validation patients, 39.9 ± 20.2%, 46.4 ± 15.3% and 14.5 ± 21.9% of the plan are in class 1, 2 and 3 respectively. Table 1 shows the results obtained on 20 cases, each with 2000 plans; the mean and deviation are calculated based on the plan chosen by the model and by the experts. The table includes the best ranked and worst ranked plan of class 3. Looking at the best plan according to the model and comparing it with the plan chosen by the two experts show that the behaviour is similar. Out of the 40 chosen plans by the two experts, on 3 occasions our model ranked the same plan as the best plan. Looking more in depth, we find that the median ranking of the plans chosen by expert 1 and 2 is 71.5 and 136.5 respectively out of 2000. In one of the cases, there is no plan respecting the DVH criteria of class 3 and the result is suboptimal; the plan chosen by each expert does not respect only 1 of the criteria while the plan chosen by our model does not respect 3 criteria. This type of behaviour is undesirable and one of the next steps is to address this rare problem, where it is unfeasible to reach all criteria. Adding visual criteria restricted the number of plans which were considered for class number 3 from 16 500 (originally) to 9 000. The approach is fast, adding negligible time to MCO planning, and preliminary results demonstrated the potential for clinical use. The approach is flexible with the possibility to adapt all criteria as desired. Future work will investigate model improvement, the non-inferiority of the best class 3 plan by the expert and methods to quickly restrict the number of navigated plans in order to obtain faster planning time.","PeriodicalId":93914,"journal":{"name":"Brachytherapy","volume":"23 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Brachytherapy","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1016/j.brachy.2023.06.158","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Purpose In the past years, a key improvement in the generation of treatment plans in high-dose-rate (HDR) brachytherapy comes from the development of multicriteria optimization (MCO) algorithms that generate thousands of pareto optimal plans within seconds. This brings a shift, from the objective of generating an acceptable plan to choosing the best plans out of thousands. Not only does the chosen plan depend on the planner, it also takes about 5-10 minutes to choose the preferred plan. The purpose of the present work is to speed up this process and to find a common ground for different specialists regarding the plan quality. Materials and Methods An AI algorithm based on the ResNet deep neural network architecture is developed to choose the best plan(s) from the generated plans. The algorithm classifies the plans, from the 3D dose distribution and anatomical structures, in 3 different classes, (1) violating hard (minimum) criteria, (2) respecting hard criteria and (3) respecting soft criteria, with every class being more stringent than the last one (increase in plan quality). The three classes are based on dosimetric criteria used at our institution for 15 Gy in a single fraction. For the classification, the more confident the model is that a plan belongs to class 3, the better is the plan. To mimic the behaviour of experts, visual-like criteria are implemented for the bladder, rectum and urethra. Visual criteria are defined as 100% and 125% isodose distance from the organ at risk. During training, the algorithm learns the link between the inputs (3D dose and anatomy) and outputs (visual-like and DVH's criteria). 850 previously treated prostate's cancer patients are used for the training and another set of 20 patients previously evaluated by two experts (clinical medical physicist) as part of an inter-observer MCO study are used for validation. For the training, 100 plans are generated for each patient using MCO and 27 000 plans are chosen at random to have the same quantity in each class. A NVIDIA GeForce RTX 3090 is used for training. Results The model takes 20 s to classify 2000 plans in order of preference (vs 5-10 mins for experts to rank 4 preferred plans). Currently, the training time is not optimized and it takes less than 2 days to train on the 27 000 plans with 75 epochs. For the 20 validation patients, 39.9 ± 20.2%, 46.4 ± 15.3% and 14.5 ± 21.9% of the plan are in class 1, 2 and 3 respectively. Table 1 shows the results obtained on 20 cases, each with 2000 plans; the mean and deviation are calculated based on the plan chosen by the model and by the experts. The table includes the best ranked and worst ranked plan of class 3. Looking at the best plan according to the model and comparing it with the plan chosen by the two experts show that the behaviour is similar. Out of the 40 chosen plans by the two experts, on 3 occasions our model ranked the same plan as the best plan. Looking more in depth, we find that the median ranking of the plans chosen by expert 1 and 2 is 71.5 and 136.5 respectively out of 2000. In one of the cases, there is no plan respecting the DVH criteria of class 3 and the result is suboptimal; the plan chosen by each expert does not respect only 1 of the criteria while the plan chosen by our model does not respect 3 criteria. This type of behaviour is undesirable and one of the next steps is to address this rare problem, where it is unfeasible to reach all criteria. Adding visual criteria restricted the number of plans which were considered for class number 3 from 16 500 (originally) to 9 000. Conclusions The approach is fast, adding negligible time to MCO planning, and preliminary results demonstrated the potential for clinical use. The approach is flexible with the possibility to adapt all criteria as desired. Future work will investigate model improvement, the non-inferiority of the best class 3 plan by the expert and methods to quickly restrict the number of navigated plans in order to obtain faster planning time. In the past years, a key improvement in the generation of treatment plans in high-dose-rate (HDR) brachytherapy comes from the development of multicriteria optimization (MCO) algorithms that generate thousands of pareto optimal plans within seconds. This brings a shift, from the objective of generating an acceptable plan to choosing the best plans out of thousands. Not only does the chosen plan depend on the planner, it also takes about 5-10 minutes to choose the preferred plan. The purpose of the present work is to speed up this process and to find a common ground for different specialists regarding the plan quality. An AI algorithm based on the ResNet deep neural network architecture is developed to choose the best plan(s) from the generated plans. The algorithm classifies the plans, from the 3D dose distribution and anatomical structures, in 3 different classes, (1) violating hard (minimum) criteria, (2) respecting hard criteria and (3) respecting soft criteria, with every class being more stringent than the last one (increase in plan quality). The three classes are based on dosimetric criteria used at our institution for 15 Gy in a single fraction. For the classification, the more confident the model is that a plan belongs to class 3, the better is the plan. To mimic the behaviour of experts, visual-like criteria are implemented for the bladder, rectum and urethra. Visual criteria are defined as 100% and 125% isodose distance from the organ at risk. During training, the algorithm learns the link between the inputs (3D dose and anatomy) and outputs (visual-like and DVH's criteria). 850 previously treated prostate's cancer patients are used for the training and another set of 20 patients previously evaluated by two experts (clinical medical physicist) as part of an inter-observer MCO study are used for validation. For the training, 100 plans are generated for each patient using MCO and 27 000 plans are chosen at random to have the same quantity in each class. A NVIDIA GeForce RTX 3090 is used for training. The model takes 20 s to classify 2000 plans in order of preference (vs 5-10 mins for experts to rank 4 preferred plans). Currently, the training time is not optimized and it takes less than 2 days to train on the 27 000 plans with 75 epochs. For the 20 validation patients, 39.9 ± 20.2%, 46.4 ± 15.3% and 14.5 ± 21.9% of the plan are in class 1, 2 and 3 respectively. Table 1 shows the results obtained on 20 cases, each with 2000 plans; the mean and deviation are calculated based on the plan chosen by the model and by the experts. The table includes the best ranked and worst ranked plan of class 3. Looking at the best plan according to the model and comparing it with the plan chosen by the two experts show that the behaviour is similar. Out of the 40 chosen plans by the two experts, on 3 occasions our model ranked the same plan as the best plan. Looking more in depth, we find that the median ranking of the plans chosen by expert 1 and 2 is 71.5 and 136.5 respectively out of 2000. In one of the cases, there is no plan respecting the DVH criteria of class 3 and the result is suboptimal; the plan chosen by each expert does not respect only 1 of the criteria while the plan chosen by our model does not respect 3 criteria. This type of behaviour is undesirable and one of the next steps is to address this rare problem, where it is unfeasible to reach all criteria. Adding visual criteria restricted the number of plans which were considered for class number 3 from 16 500 (originally) to 9 000. The approach is fast, adding negligible time to MCO planning, and preliminary results demonstrated the potential for clinical use. The approach is flexible with the possibility to adapt all criteria as desired. Future work will investigate model improvement, the non-inferiority of the best class 3 plan by the expert and methods to quickly restrict the number of navigated plans in order to obtain faster planning time.
PO57
在过去的几年中,高剂量率(HDR)近距离放射治疗方案生成的关键改进来自于多准则优化(MCO)算法的发展,该算法可以在几秒钟内生成数千个帕累托最优方案。这带来了一个转变,目标从生成一个可接受的计划转变为从数千个计划中选择最佳计划。所选择的计划不仅取决于计划者,而且还需要大约5-10分钟来选择首选计划。目前工作的目的是加快这一进程,并为不同的专家找到关于计划质量的共同基础。材料与方法基于ResNet深度神经网络架构,开发了一种人工智能算法,从生成的方案中选择最佳方案。该算法根据三维剂量分布和解剖结构将方案分为三类,(1)违反硬标准(最低),(2)尊重硬标准,(3)尊重软标准,每一类都比前一类严格(提高方案质量)。这三个等级是根据我们机构在单个分数中使用的剂量学标准为15 Gy。对于分类,模型越确信某计划属于第3类,则该计划越好。为了模仿专家的行为,对膀胱、直肠和尿道实施了类似视觉的标准。视觉标准定义为与危险器官的等剂量距离为100%和125%。在训练过程中,算法学习输入(3D剂量和解剖结构)和输出(视觉和DVH标准)之间的联系。850名先前接受过治疗的前列腺癌患者被用于培训,另外20名患者被两名专家(临床医学物理学家)作为观察者间MCO研究的一部分进行评估,用于验证。对于培训,使用MCO为每个患者生成100个计划,随机选择27000个计划,使每个班级的数量相同。NVIDIA GeForce RTX 3090用于训练。结果该模型对2000个方案按偏好排序需要20秒(专家对4个方案排序需要5-10分钟)。目前培训时间没有优化,27000计划75个epoch的培训时间不到2天。20例验证患者中,1、2、3类患者分别占39.9±20.2%、46.4±15.3%、14.5±21.9%。表1显示了20个案例的结果,每个案例有2000个计划;根据模型和专家选择的方案计算平均值和偏差。表格中包含了第3类排名最好和最差的计划。根据模型查看最佳方案,并将其与两位专家选择的方案进行比较,结果表明行为是相似的。在两位专家选择的40个方案中,我们的模型有3次将同一方案列为最佳方案。更深入地看,我们发现专家1和专家2选择的方案在2000个方案中排名中位数分别为71.5和136.5。在其中一种情况下,没有符合第3类DVH标准的计划,结果是次优的;每位专家选择的方案不符合其中1个标准,而我们的模型选择的方案不符合3个标准。这种类型的行为是不受欢迎的,接下来的步骤之一是解决这个罕见的问题,在这个问题上,达到所有标准是不可行的。加入视觉标准后,第3类的设计数量从原先的16500个减少到9000个。结论该方法快速,缩短了MCO计划的时间,初步结果显示了临床应用的潜力。该方法是灵活的,可以根据需要调整所有标准。未来的工作将研究模型改进,专家给出的最佳3类方案的非劣效性,以及如何快速限制导航方案的数量以获得更快的规划时间。在过去几年中,高剂量率(HDR)近距离放射治疗方案生成的关键改进来自多准则优化(MCO)算法的发展,该算法可在几秒钟内生成数千个帕累托最优方案。这带来了一个转变,目标从生成一个可接受的计划转变为从数千个计划中选择最佳计划。所选择的计划不仅取决于计划者,而且还需要大约5-10分钟来选择首选计划。目前工作的目的是加快这一进程,并为不同的专家找到关于计划质量的共同基础。开发了一种基于ResNet深度神经网络架构的人工智能算法,从生成的方案中选择最佳方案。 该算法根据三维剂量分布和解剖结构将方案分为三类,(1)违反硬标准(最低),(2)尊重硬标准,(3)尊重软标准,每一类都比前一类严格(提高方案质量)。这三个等级是根据我们机构在单个分数中使用的剂量学标准为15 Gy。对于分类,模型越确信某计划属于第3类,则该计划越好。为了模仿专家的行为,对膀胱、直肠和尿道实施了类似视觉的标准。视觉标准定义为与危险器官的等剂量距离为100%和125%。在训练过程中,算法学习输入(3D剂量和解剖结构)和输出(视觉和DVH标准)之间的联系。850名先前接受过治疗的前列腺癌患者被用于培训,另外20名患者被两名专家(临床医学物理学家)作为观察者间MCO研究的一部分进行评估,用于验证。对于培训,使用MCO为每个患者生成100个计划,随机选择27000个计划,使每个班级的数量相同。NVIDIA GeForce RTX 3090用于训练。该模型按偏好顺序对2000个计划进行分类需要20秒(专家对4个首选计划进行排序需要5-10分钟)。目前培训时间没有优化,27000计划75个epoch的培训时间不到2天。20例验证患者中,1、2、3类患者分别占39.9±20.2%、46.4±15.3%、14.5±21.9%。表1显示了20个案例的结果,每个案例有2000个计划;根据模型和专家选择的方案计算平均值和偏差。表格中包含了第3类排名最好和最差的计划。根据模型查看最佳方案,并将其与两位专家选择的方案进行比较,结果表明行为是相似的。在两位专家选择的40个方案中,我们的模型有3次将同一方案列为最佳方案。更深入地看,我们发现专家1和专家2选择的方案在2000个方案中排名中位数分别为71.5和136.5。在其中一种情况下,没有符合第3类DVH标准的计划,结果是次优的;每位专家选择的方案不符合其中1个标准,而我们的模型选择的方案不符合3个标准。这种类型的行为是不受欢迎的,接下来的步骤之一是解决这个罕见的问题,在这个问题上,达到所有标准是不可行的。加入视觉标准后,第3类的设计数量从原先的16500个减少到9000个。该方法快速,为MCO计划增加了可忽略不计的时间,初步结果显示了临床应用的潜力。该方法是灵活的,可以根据需要调整所有标准。未来的工作将研究模型改进,专家给出的最佳3类方案的非劣效性,以及如何快速限制导航方案的数量以获得更快的规划时间。 该算法根据三维剂量分布和解剖结构将方案分为三类,(1)违反硬标准(最低),(2)尊重硬标准,(3)尊重软标准,每一类都比前一类严格(提高方案质量)。这三个等级是根据我们机构在单个分数中使用的剂量学标准为15 Gy。对于分类,模型越确信某计划属于第3类,则该计划越好。为了模仿专家的行为,对膀胱、直肠和尿道实施了类似视觉的标准。视觉标准定义为与危险器官的等剂量距离为100%和125%。在训练过程中,算法学习输入(3D剂量和解剖结构)和输出(视觉和DVH标准)之间的联系。850名先前接受过治疗的前列腺癌患者被用于培训,另外20名患者被两名专家(临床医学物理学家)作为观察者间MCO研究的一部分进行评估,用于验证。对于培训,使用MCO为每个患者生成100个计划,随机选择27000个计划,使每个班级的数量相同。NVIDIA GeForce RTX 3090用于训练。该模型按偏好顺序对2000个计划进行分类需要20秒(专家对4个首选计划进行排序需要5-10分钟)。目前培训时间没有优化,27000计划75个epoch的培训时间不到2天。20例验证患者中,1、2、3类患者分别占39.9±20.2%、46.4±15.3%、14.5±21.9%。表1显示了20个案例的结果,每个案例有2000个计划;根据模型和专家选择的方案计算平均值和偏差。表格中包含了第3类排名最好和最差的计划。根据模型查看最佳方案,并将其与两位专家选择的方案进行比较,结果表明行为是相似的。在两位专家选择的40个方案中,我们的模型有3次将同一方案列为最佳方案。更深入地看,我们发现专家1和专家2选择的方案在2000个方案中排名中位数分别为71.5和136.5。在其中一种情况下,没有符合第3类DVH标准的计划,结果是次优的;每位专家选择的方案不符合其中1个标准,而我们的模型选择的方案不符合3个标准。这种类型的行为是不受欢迎的,接下来的步骤之一是解决这个罕见的问题,在这个问题上,达到所有标准是不可行的。加入视觉标准后,第3类的设计数量从原先的16500个减少到9000个。该方法快速,为MCO计划增加了可忽略不计的时间,初步结果显示了临床应用的潜力。该方法是灵活的,可以根据需要调整所有标准。未来的工作将研究模型改进,专家给出的最佳3类方案的非劣效性,以及如何快速限制导航方案的数量以获得更快的规划时间。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信