Regression forests for efficient anatomy detection and localization in computed tomography scans

A Criminisi, D Robertson, E Konukoglu, J Shotton… - Medical image …, 2013 - Elsevier
A Criminisi, D Robertson, E Konukoglu, J Shotton, S Pathak, S White, K Siddiqui
Medical image analysis, 2013Elsevier
This paper proposes a new algorithm for the efficient, automatic detection and localization of
multiple anatomical structures within three-dimensional computed tomography (CT) scans.
Applications include selective retrieval of patients images from PACS systems, semantic
visual navigation and tracking radiation dose over time. The main contribution of this work is
a new, continuous parametrization of the anatomy localization problem, which allows it to be
addressed effectively by multi-class random regression forests. Regression forests are …
Abstract
This paper proposes a new algorithm for the efficient, automatic detection and localization of multiple anatomical structures within three-dimensional computed tomography (CT) scans. Applications include selective retrieval of patients images from PACS systems, semantic visual navigation and tracking radiation dose over time.
The main contribution of this work is a new, continuous parametrization of the anatomy localization problem, which allows it to be addressed effectively by multi-class random regression forests. Regression forests are similar to the more popular classification forests, but trained to predict continuous, multi-variate outputs, where the training focuses on maximizing the confidence of output predictions. A single pass of our probabilistic algorithm enables the direct mapping from voxels to organ location and size.
Quantitative validation is performed on a database of 400 highly variable CT scans. We show that the proposed method is more accurate and robust than techniques based on efficient multi-atlas registration and template-based nearest-neighbor detection. Due to the simplicity of the regressor’s context-rich visual features and the algorithm’s parallelism, these results are achieved in typical run-times of only ∼4 s on a conventional single-core machine.
Elsevier