14.08.2013 Views

Docteur de l'université Automatic Segmentation and Shape Analysis ...

Docteur de l'université Automatic Segmentation and Shape Analysis ...

Docteur de l'université Automatic Segmentation and Shape Analysis ...

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

Chapter 5 Quantitative shape analysis of hippocampus in AD 117<br />

Bootstrap aggregation, or bagging (Breiman, 1996a), is another approach to reduce<br />

the variance in the learning algorithm. It is based on the repeating bootstraps of<br />

the training set, <strong>and</strong> trains the classifier using the resampled data. Multiple clas-<br />

sifiers learned from the resampled data are often combined by a majority voting.<br />

When bagging is used, better performance is usually achieved with larger feature<br />

set without discarding weakly informative features (Munson <strong>and</strong> Caruana, 2009).<br />

We thus can train bagged classifier on the whole set of features to be evaluated<br />

<strong>and</strong> use the prediction performance of the bagged classifier as a measurement of<br />

the discriminant ability of the feature set.<br />

In addition to the shape variations, the hippocampal volume normalized by the<br />

total intracranial volume (TIV) are used as in<strong>de</strong>pen<strong>de</strong>nt feature. To compare the<br />

discrimination ability of the volume <strong>and</strong> the shape of the hippocampus, we eval-<br />

uate the classification performance of shape <strong>de</strong>scriptors both with <strong>and</strong> without<br />

the normalized volume feature. The TIV is calculated by summing the volume of<br />

white matter (WM), grey matter (GM) <strong>and</strong> cerebrospinal fluid (CSF). For each<br />

subject, the T1- <strong>and</strong> T2-weighted MR images were classified into WM, GM <strong>and</strong><br />

CSF using an implementation of the expectation maximization segmentation al-<br />

gorithm (Acosta et al., 2009). In brief, this algorithm mo<strong>de</strong>ls the image intensity<br />

histogram using a mixture of Gaussian distribution. The parameters of the Gaus-<br />

sian mixture are iteratively updated using an expectation maximization approach.<br />

For this study, 6 Gaussian distributions were used: 1 for each of the main tissue<br />

types, namely WM, GM, <strong>and</strong> CSF, <strong>and</strong> 3 for non-brain tissues. To provi<strong>de</strong> ini-<br />

tialization <strong>and</strong> spatial consistency to the expectation maximization algorithm, a<br />

template <strong>and</strong> associated probability maps of GM, WM, <strong>and</strong> CSF were spatially<br />

normalized to each individual scan, first through an affine registration using a ro-<br />

bust block matching approach (Ourselin et al., 2001) with 12 <strong>de</strong>grees of freedom,<br />

<strong>and</strong> then using a diffeomorphic <strong>de</strong>mons nonrigid registration (Vercauteren et al.,<br />

2009). The expectation maximization algorithm computed probability maps for<br />

each tissue type, which were discretized by assigning each voxel to its most likely<br />

tissue type.

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!