首页> 外文期刊>Artificial intelligence in medicine >Phased searching with NEAT in a Time-Scaled Framework: Experiments on a computer-aided detection system for lung nodules
【24h】

Phased searching with NEAT in a Time-Scaled Framework: Experiments on a computer-aided detection system for lung nodules

机译:在时标框架中使用NEAT进行分阶段搜索:在计算机辅助的肺结节检测系统上进行的实验

获取原文
获取原文并翻译 | 示例
获取外文期刊封面目录资料

摘要

Objective: In the field of computer-aided detection (CAD) systems for lung nodules in computed tomography (CT) scans, many image features are presented and many artificial neural network (ANN) classifiers with various structural topologies are analyzed; frequently, the classifier topologies are selected by trial-and-error experiments. To avoid these trial and error approaches, we present a novel classifier that evolves ANNs using genetic algorithms, called "Phased Searching with NEAT in a Time or Generation-Scaled Framework", integrating feature selection with the classification task. Methods and materials: We analyzed our method's performance on 360 CT scans from the public Lung Image Database Consortium database. We compare our method's performance with other more-established classifiers, namely regular NEAT, Feature-Deselective NEAT (FD-NEAT), fixed-topology ANNs, and support vector machines (SVMs) using ten-fold cross-validation experiments of all 360 scans. Results: The results show that the proposed "Phased Searching" method performs better and faster than regular NEAT, better than FD-NEAT, and achieves sensitivities at 3 and 4 false positives (FP) per scan that are comparable with the fixed-topology ANN and SVM classifiers, but with fewer input features. It achieves a detection sensitivity of 83.0 ± 9.7% with an average of 4 FP/scan, for nodules with a diameter greater than or equal to 3 mm. It also evolves networks with shorter evolution times and with lower complexities than regular NEAT (p = 0.026 and p < 0.001, respectively). Analysis on the average and best network complexities evolved by regular NEAT and by our approach shows that our approach searches for good solutions in lower dimensional search spaces, and evolves networks without superfluous structure. Conclusions: We have presented a novel approach that combines feature selection with the evolution of ANN topology and weights. Compared with the original threshold-based Phased Searching method of Green, our method requires fewer parameters and converges to the optimal network complexity required for the classification task at hand. The results of the ten-fold cross-validation experiments also show that our proposed CAD system for lung nodule detection performs well with respect to other methods in the literature.
机译:目的:在计算机断层扫描(CT)扫描中的肺结节计算机辅助检测(CAD)系统领域中,提出了许多图像特征并分析了具有各种结构拓扑的许多人工神经网络(ANN)分类器;通常,通过反复试验来选择分类器拓扑。为避免这些反复试验的方法,我们提出了一种新颖的分类器,该分类器使用遗传算法演化了神经网络,称为“在时间或世代规模框架中使用NEAT进行阶段搜索”,将特征选择与分类任务集成在一起。方法和材料:我们在来自公共肺图像数据库协会数据库的360 CT扫描中分析了该方法的性能。我们使用所有360次扫描的十倍交叉验证实验,将我们的方法的性能与其他更成熟的分类器(即常规NEAT,特征非选择性NEAT(FD-NEAT),固定拓扑ANN和支持向量机(SVM))进行比较。结果:结果表明,所提出的“分阶段搜索”方法比常规的NEAT更好,更快,比FD-NEAT更好,并且每次扫描在3和4个假阳性(FP)时的灵敏度与固定拓扑ANN相当和SVM分类器,但输入功能较少。对于直径大于或等于3 mm的结节,平均4 FP /扫描可获得83.0±9.7%的检测灵敏度。与常规的NEAT相比,它的进化网络的进化时间更短且复杂度更低(分别为p = 0.026和p <0.001)。对常规NEAT和我们的方法所演化出的平均和最佳网络复杂性的分析表明,我们的方法在低维搜索空间中寻找良好的解决方案,并且演化出没有多余结构的网络。结论:我们提出了一种新颖的方法,该方法将特征选择与ANN拓扑和权重的演变相结合。与原始的基于格林的基于阈值的分阶段搜索方法相比,我们的方法需要更少的参数,并且收敛到手头分类任务所需的最佳网络复杂度。十倍交叉验证实验的结果还表明,我们提出的用于肺结节检测的CAD系统相对于文献中的其他方法表现良好。

著录项

  • 来源
    《Artificial intelligence in medicine》 |2013年第3期|157-167|共11页
  • 作者单位

    Department of Electronics and Informatics, Vrije Universiteit Brussel, Pleinlaan 2, B-1050 Brussel, Belgium,Department of Future Media and Imaging, iMinds, Caston Crommenlaan 8,9050 Cent, Belgium;

    Department of Electronics and Informatics, Vrije Universiteit Brussel, Pleinlaan 2, B-1050 Brussel, Belgium,Department of Future Media and Imaging, iMinds, Caston Crommenlaan 8,9050 Cent, Belgium;

    Department of Electronics and Informatics, Vrije Universiteit Brussel, Pleinlaan 2, B-1050 Brussel, Belgium;

    Department of Electronics and Informatics, Vrije Universiteit Brussel, Pleinlaan 2, B-1050 Brussel, Belgium,Department of Future Media and Imaging, iMinds, Caston Crommenlaan 8,9050 Cent, Belgium;

  • 收录信息
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

    Classifiers; Feature selection; Evolutionary computation; Artificial neural networks; Medical image analysis; Lung nodule detection;

    机译:分类器功能选择;进化计算;人工神经网络;医学图像分析;肺结节检测;

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号