Segmentation of Stochastic Images using ... - Jacobs University
Segmentation of Stochastic Images using ... - Jacobs University
Segmentation of Stochastic Images using ... - Jacobs University
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
7.5 <strong>Segmentation</strong> <strong>of</strong> <strong>Stochastic</strong> <strong>Images</strong> Using <strong>Stochastic</strong> Level Sets<br />
Figure 7.10: Mean (left) <strong>of</strong> the stochastic CT and the variance (right) <strong>of</strong> the stochastic Chan-Vese<br />
solution. Additionally, we show the expected value contour at different time steps.<br />
The regularized stochastic δ-function δ ε is<br />
1<br />
δ ε (z(ω)) =<br />
πε + π . (7.38)<br />
ε<br />
z(ω)2<br />
The mean value <strong>of</strong> the object and the background is a stochastic quantity because we have to average<br />
over a collection <strong>of</strong> random variables. The mean values are<br />
∫<br />
D<br />
c 1 (φ) =<br />
u ∫<br />
0(x)H ε (φ(x))dx<br />
∫<br />
D<br />
D H and c 2 (φ) =<br />
u 0(x)(1 − H ε (φ(x)))dx<br />
∫<br />
ε(φ(x))dx<br />
D (1 − H . (7.39)<br />
ε(φ(x)))dx<br />
Note that we average over the spatial dimensions, i.e. over the deterministic image domain only.<br />
Thus, c 1 and c 2 are random variables. In (7.39) we have to evaluate the Heaviside approximation,<br />
which involves the computation <strong>of</strong> the inverse tangent <strong>of</strong> a stochastic quantity. To avoid the necessity<br />
to develop a numerical scheme for the stochastic inverse tangent, we use a well-known approximation,<br />
see e.g. [131]:<br />
{<br />
x<br />
arctan(x) ≈<br />
1+0.28x 2 if |x| ≤ 1<br />
else<br />
π<br />
2 − x<br />
x 2 +0.28<br />
. (7.40)<br />
This is not a real drawback <strong>of</strong> the stochastic discretization, because it can be interpreted as an alternative<br />
approximation <strong>of</strong> the Heaviside function and is not as bad as an approximation <strong>of</strong> an approximation<br />
as it might look. The remaining part <strong>of</strong> the Chan-Vese model is generalized to stochastic<br />
quantities by <strong>using</strong> Debusschere’s methods for the computation with polynomial chaos quantities<br />
(see Section 3.3 and [38]). The main driving force <strong>of</strong> the stochastic Chan-Vese model is the difference<br />
between the mean value <strong>of</strong> the separated region and the actual gray value. The mean value<br />
<strong>of</strong> the image regions is computed via an averaging <strong>of</strong> a collection <strong>of</strong> random variables. Thus, the<br />
stochastic information cancels out <strong>of</strong> the stochastic Chan-Vese model, because we are approximating<br />
the “real”, noise-free, mean value when we average over a huge number <strong>of</strong> random variables.<br />
The Variance as Homogenization Criterion for <strong>Stochastic</strong> Chan-Vese <strong>Segmentation</strong><br />
Up to now, we have used the (spatial) mean value <strong>of</strong> the stochastic image as homogenization criterion<br />
only. Thus, we ignore stochastic information, e.g. the variance, <strong>of</strong> the stochastic image. Homogenizing<br />
the variance <strong>of</strong> the segmented object and background can improve the segmentation result<br />
further. For example, in medical images different organs or tissue components can have different<br />
93