Hier finden Sie wissenschaftliche Publikationen aus den Fraunhofer-Instituten.

Computer-aided detection of pulmonary nodules: a comparative study using the public LIDC/IDRI database

: Jacobs, C.; Rikxoort, E.M. van; Murphy, K.; Prokop, M.; Schaefer-Prokop, C.M.; Ginneken, B. van

Volltext (PDF; )

European radiology 26 (2016), Nr.7, S.2139-2147
ISSN: 0938-7994
ISSN: 1613-3749
ISSN: 1432-1084
Zeitschriftenaufsatz, Elektronische Publikation
Fraunhofer MEVIS ()


To benchmark the performance of state-of-the-art computer-aided detection (CAD) of pulmonary nodules using the largest publicly available annotated CT database (LIDC/IDRI), and to show that CAD finds lesions not identified by the LIDC’s four-fold double reading process.

The LIDC/IDRI database contains 888 thoracic CT scans with a section thickness of 2.5 mm or lower. We report performance of two commercial and one academic CAD system. The influence of presence of contrast, section thickness, and reconstruction kernel on CAD performance was assessed. Four radiologists independently analyzed the false positive CAD marks of the best CAD system.

The updated commercial CAD system showed the best performance with a sensitivity of 82 % at an average of 3.1 false positive detections per scan. Forty-five false positive CAD marks were scored as nodules by all four radiologists in our study.

On the largest publicly available reference database for lung nodule detection in chest CT, the updated commercial CAD system locates the vast majority of pulmonary nodules at a low false positive rate. Potential for CAD is substantiated by the fact that it identifies pulmonary nodules that were not marked during the extensive four-fold LIDC annotation process.
Key Points

• CAD systems should be validated on public, heterogeneous databases.

• The LIDC/IDRI database is an excellent database for benchmarking nodule CAD.

• CAD can identify the majority of pulmonary nodules at a low false positive rate.

• CAD can identify nodules missed by an extensive two-stage annotation process.