You have requested a machine translation of selected content from our databases. This functionality is provided solely for your convenience and is in no way intended to replace human translation. Neither SPIE nor the owners and publishers of the content make, and they explicitly disclaim, any express or implied representations or warranties of any kind, including, without limitation, representations and warranties as to the functionality of the translation feature or the accuracy or completeness of the translations.
Translations are not retained in our system. Your use of this feature and the translations is subject to all use restrictions contained in the Terms and Conditions of Use of the SPIE website.
4 March 2011A cost constrained boosting algorithm for fast lesion detection and segmentation
Machine learning techniques like pointwise classification are widely used for object detection and segmentation.
However, for large search spaces like CT images, this approach becomes computationally very demanding. Designing
strong yet compact classifiers is thus of great importance for systems that ought to be clinically used as
time is a limiting factor in clinical routine. The runtime of a system plays an important role in the decision about
its application. In this paper we propose a novel technique for reducing the computational complexity of voxel
classification systems based on the well-known AdaBoost algorithm in general and Probabilistic Boosting Trees
in particular. We describe a means of incorporating a measure of hypothesis complexity into the optimization
process, resulting in classifiers with lower evaluation cost. More specifically, in our approach the hypothesis
generation that is performed during the AdaBoost training is no longer based only on the error of a hypothesis
but also on its complexity. This leads to a reduced overall classifier complexity and thus shorter evaluation
times. The validity of the approach is shown in an experimental evaluation. In a cross validation experiment,
a system for automatic segmentation of liver tumors in CT images, that is based on the Probabilistic Boosting
Tree, was trained with and without the proposed extension. In this preliminary study, the evaluation cost for
classifying previously unseen samples could be reduced by 83% using the methods described here without losing
classification accuracy.
The alert did not successfully save. Please try again later.
Arne Militzer, Christian Tietjen, Joachim Hornegger, "A cost constrained boosting algorithm for fast lesion detection and segmentation," Proc. SPIE 7963, Medical Imaging 2011: Computer-Aided Diagnosis, 79631B (4 March 2011); https://doi.org/10.1117/12.877944