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 5 <strong>Stochastic</strong> <strong>Images</strong><br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
❳❳<br />
❳❳ ❳ supp ξ j , j = 1,...n<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
✘ ✘ ✘ ✘✘ ✘ x i<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
❳ ❳ ❳ ❳ ❳ supp Pi (x)<br />
<br />
<br />
Figure 5.1: Sketch <strong>of</strong> the ingredients <strong>of</strong> a stochastic image. We discretize the spatial dimensions<br />
<strong>using</strong> finite elements, but the coefficients <strong>of</strong> the FE basis functions are random variables.<br />
Every random variable has a support, which spans over the complete image, thus pixels<br />
depend on a random vector.<br />
and an interpolation rule provides the values at positions between neighboring pixels. For fixed α<br />
we call the coefficient f i α a stochastic mode <strong>of</strong> the pixel i. The set { f i α} i∈I collects the stochastic<br />
modes <strong>of</strong> all pixels for fixed α. Thus, it is possible to visualize the set as a classical image.<br />
From the polynomial chaos expansion <strong>of</strong> a stochastic image, we compute stochastic moments <strong>of</strong><br />
the image. With the use <strong>of</strong> the orthogonal set <strong>of</strong> basis functions we have E(Ψ 1 ) = 1, E(Ψ α ) = 0 for<br />
α > 1 and E(Ψ α Ψ β ) = 0 if α ≠ β. The expected value and the variance <strong>of</strong> a stochastic pixel are<br />
E( f (x i ,·)) = f i 1 ,<br />
Var( f (x i ,·)) = ∑ N α=2<br />
(<br />
f<br />
i<br />
α<br />
) 2<br />
E<br />
(<br />
(Ψ α ) 2) .<br />
(5.5)<br />
We obtain higher stochastic moments in a similar way. Furthermore, it is possible to visualize the<br />
complete stochastic information <strong>of</strong> every pixel, e.g. via a visualization <strong>of</strong> the PDFs <strong>of</strong> all pixels.<br />
Note that the representation <strong>of</strong> stochastic images presented here differs from the one discussed by<br />
Preusser et al. [130]. There, a space is used in which every pixel depends on one random variable<br />
only. However, for most <strong>of</strong> the image acquisition processes and image processing methods the<br />
assumption that the noise is independent for every pixel is not true. To represent these images in the<br />
ansatz space we let every pixel depend on a random vector ξ . Section 5.3 compares both concepts.<br />
The first step, required before the processing <strong>of</strong> the stochastic images starts, is the identification<br />
<strong>of</strong> the random variables in the input data. We estimate these random variables from data samples<br />
through the Karhunen-Loève expansion [41]. The Karhunen-Loève expansion, a stochastic version<br />
<strong>of</strong> the principal component analysis (PCA) [74], determines the eigenvalues and eigenvectors <strong>of</strong> the<br />
covariance matrix <strong>of</strong> the data samples and identifies the significant random variables in the data<br />
samples with these eigenvectors and eigenvalues.<br />
5.2 Generation <strong>of</strong> <strong>Stochastic</strong> <strong>Images</strong> from Samples<br />
We obtain the polynomial chaos coefficients <strong>of</strong> the random variables X ∈ L 2 (Ω) by a maximum<br />
likelihood estimation [41], leading to a representation <strong>of</strong> X ∈ L 2 (Ω) in the polynomial chaos by<br />
X = ∑ N α=1 a αΨ α (ξ ) . (5.6)<br />
To use the notion <strong>of</strong> stochastic images developed in the previous sections for image processing, we<br />
need to obtain the coefficients <strong>of</strong> the representation (5.3) for the image undergoing the analysis. Let<br />
48