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

  • Authors:
  • Maxine Tan;Rudi Deklerck;Jan Cornelis;Bart Jansen

  • Affiliations:
  • -;-;-;-

  • Venue:
  • Artificial Intelligence in Medicine
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

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 4FP/scan, for nodules with a diameter greater than or equal to 3mm. It also evolves networks with shorter evolution times and with lower complexities than regular NEAT (p=0.026 and p