LUng Nodule Analysis 2016

Lung cancer is the leading cause of cancer-related death worldwide. Screening high risk individuals for lung cancer with low-dose CT scans is now being implemented in the United States and other countries are expected to follow soon. In CT lung cancer screening, many millions of CT scans will have to be analyzed, which is an enormous burden for radiologists. Therefore there is a lot of interest to develop computer algorithms to optimize screening. 

A vital first step in the analysis of lung cancer screening CT scans is the detection of pulmonary nodules, which may or may not represent early stage lung cancer. Many Computer-Aided Detection (CAD) systems have already been proposed for this task. The LUNA16 challenge will focus on a large-scale evaluation of automatic nodule detection algorithms on the LIDC/IDRI data set.

The LIDC/IDRI data set is publicly available, including the annotations of nodules by four radiologists. The LUNA16 challenge is therefore a completely open challenge. We have tracks for complete systems for nodule detection, and for systems that use a list of locations of possible nodules. We provide this list to also allow teams to participate with an algorithm that only determines the likelihood for a given location in a CT scan to contain a pulmonary nodule.


Number of users: 9000

How to Participate

  1. Teams can register to participate in the challenge. This registration is a mandatory step before downloading data and submitting results to the challenge.
  2. After registration, teams can download the dataset, including scans, annotations, and (optional) a list of candidates. The content of the dataset is described in this page.
  3. Results of CAD systems on those scans, consisting of a list of locations in the scans and a degree of suspicion that this location is a nodule, can be submitted. The format of the submission file is described in this page.
  4. The submitted results will be processed and will be published on the results page.



For questions, please email Colin Jacobs or Bram van Ginneken.