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

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

54 Chapter 3 Hippocampal segmentation using multiple atlases<br />

truth such as DSC score, <strong>and</strong> the boundary difference such as Hausdorff distance<br />

are thus not applicable.<br />

In or<strong>de</strong>r to evaluate the atlases produced <strong>and</strong> selected as <strong>de</strong>scribed in the previous<br />

section, the agreement among their propagated labels is taken into account. The<br />

un<strong>de</strong>rlying assumption is that the performance of classifier fusion may be affected<br />

by the disagreement among propagated segmentations. The agreement among the<br />

fused atlases more likely result from the reduction of r<strong>and</strong>om error, even though<br />

the accuracy of the propagated labels is intrinsically limited by the registration<br />

algorithm. It is preferable to <strong>de</strong>al with individual segmentations agreeing with each<br />

other in the fusion of labels. A higher agreement among the atlases means more<br />

overlap between the segmentation results, i.e. the consensus region with majority<br />

votes, <strong>and</strong> each individual segmentation propagation. It becomes a measurement<br />

of accuracy when the segmentation result is back-propagated to the atlas, <strong>and</strong><br />

overlap is transformed into the atlas space.<br />

A probability image can be created for each structure when fusing the label maps<br />

propagated from n atlases. For a given label l ∈ L , each pixel in the probability<br />

image counts the number of votes it receives, <strong>and</strong> is normalized by the total number<br />

of atlases<br />

Pl(x) = |{k : Lk ◦ Tk(x) = l}|<br />

n<br />

(3.16)<br />

The entropy of this probability image, <strong>and</strong> the partial moment of its histogram<br />

are used to measure the performance of the atlases.<br />

3.2.2.1 Entropy of probability image<br />

The entropy of image is a statistical measure of its r<strong>and</strong>omness. As far as the<br />

probability image is concerned, it can be <strong>de</strong>fined as<br />

n∑<br />

HP (Pl) = −pi log pi, (3.17)<br />

i=1

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

Saved successfully!

Ooh no, something went wrong!