Segmentation of Stochastic Images using ... - Jacobs University
Segmentation of Stochastic Images using ... - Jacobs University
Segmentation of Stochastic Images using ... - Jacobs University
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
Chapter 7 <strong>Stochastic</strong> Level Sets<br />
and Beckermann [143] based on an idea by Echebarria et al. [46]. It is given by<br />
( ) ∇ψ<br />
∇ ·<br />
|∇ψ|<br />
⎛<br />
≈ 1 ⎝<br />
h<br />
ψ i+1, j − ψ i, j<br />
√<br />
(ψ i+1, j − ψ i, j ) 2 + (ψ i+1, j+1 + ψ i, j+1 − ψ i+1, j−1 − ψ i, j−1 ) 2 /16<br />
ψ i, j − ψ i−1, j<br />
− √<br />
(ψ i, j − ψ i−1, j ) 2 + (ψ i−1, j+1 + ψ i, j+1 − ψ i−1, j−1 − ψ i, j−1 ) 2 /16<br />
+ √<br />
ψ i, j+1 − ψ i, j<br />
(ψ i, j+1 − ψ i, j ) 2 + (ψ i+1, j+1 + ψ i+1, j − ψ i−1, j+1 − ψ i−1, j ) 2 /16<br />
⎞<br />
−√<br />
ψ i, j − ψ i, j−1<br />
⎠ .<br />
(ψ i, j − ψ i, j−1 ) 2 + (ψ i+1, j−1 + ψ i+1, j − ψ i−1, j−1 − ψ i−1, j ) 2 /16<br />
(7.23)<br />
Due to the independence <strong>of</strong> the update for the spatial positions, this finite difference scheme can be<br />
parallelized on multiple processor cores easily.<br />
Remark 17. Due to the hyperbolic tangent pr<strong>of</strong>ile <strong>of</strong> the level sets across the interface, we have<br />
to respect a condition on the maximal curvature <strong>of</strong> the represented object. For a high curvature,<br />
the hyperbolic tangent pr<strong>of</strong>iles overlap for points on the interface. This leads to instabilities <strong>of</strong> the<br />
numerical schemes for the discretization.<br />
7.3 Reinitialization <strong>of</strong> <strong>Stochastic</strong> Level Sets<br />
The right hand side <strong>of</strong> (7.18) is an integrated reinitialization <strong>of</strong> the level set function. Following<br />
[143], this reinitialization is sufficient to get accurate results for deterministic level sets. When<br />
<strong>using</strong> a stochastic velocity, we have to reinitialize all polynomial chaos coefficients, which are on different<br />
scales. Typically, the first coefficient, the expected value, is orders <strong>of</strong> magnitude bigger than<br />
the remaining coefficients. Furthermore, the coefficients <strong>of</strong> polynomials in uncoupled random variables<br />
are close to zero. During the numerical experiments, we observed that the reinitialization via<br />
(7.18) is not sufficient. Thus, we need an additional reinitialization to get accurate stochastic results.<br />
The classical reinitialization methods for level sets are not applicable in the stochastic context.<br />
The Fast Marching method [138] is based on an upwinding scheme. As discussed in Section 7.1,<br />
a stochastic upwinding scheme is not available. Iterative reinitialization via φ t = sign(φ)(1 − |∇φ|)<br />
is not possible because the signature <strong>of</strong> a stochastic quantity is not well-defined. The equation for<br />
energy minimization [90], i.e. α|E(|∇φ| − 1) 2 | + β|Var(|∇φ|)| → min, is unstable if φ converges to<br />
the stochastic signed distance function.<br />
To get a working reinitialization scheme for stochastic level sets, we use a modification <strong>of</strong> the<br />
stochastic level set equation (7.18). As already mentioned, the right hand side <strong>of</strong> this function is<br />
an integrated reinitialization. We use this equation, set the speed to zero, i.e. a = 0, and solve the<br />
equation for artificial time T . Doing this, the reinitialization equation is<br />
( (<br />
1 − |∇ψ|<br />
2 )√ 2<br />
ψ t = b ∆ψ +<br />
tanh<br />
ψ<br />
( ) ) ∇ψ<br />
√ − |∇ψ|∇ ·<br />
. (7.24)<br />
W<br />
2W |∇ψ|<br />
In all numerical experiments, we apply this reinitialization equation. We use for every time step <strong>of</strong><br />
(7.18) ten reinitialization time steps <strong>of</strong> (7.24) with a time step size for the reinitialization <strong>of</strong> 0.5τ,<br />
where τ is the time step size <strong>of</strong> the original problem.<br />
84