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 3 SPDEs and Polynomial Chaos Expansions<br />
variables. Fig. 3.1 shows the situation. Instead <strong>of</strong> the direct computation <strong>of</strong> the integrals with the<br />
random variable X and the measure Π, we transform the integration into integration over the real<br />
numbers by <strong>using</strong> the polynomial chaos and the PDF ρ <strong>of</strong> the underlying random variables.<br />
3.3.1 Wiener Chaos<br />
In his seminal paper [156], Wiener developed the homogeneous (or Wiener) chaos formulated <strong>using</strong><br />
Hermite-polynomials in independent Gaussian random variables with zero mean and unit variance.<br />
Let ˜ξ = (ξ 1 ,...) be a vector <strong>of</strong> independent Gaussian random variables with zero mean, unit variance<br />
and PDFs ρ i , and V n (ξ i1 ,...,ξ in ) be Hermite-polynomials in n random variables. Cameron and<br />
Martin [27] proved that a random variable X with finite second-order moments has the representation<br />
X(ω) = a 0 V 0 +<br />
∞<br />
∑<br />
i 1 =1<br />
a i1 V 1 (ξ i1 (ω)) +<br />
∞ ∞<br />
∑ ∑<br />
i 1 =1 i 2 =1<br />
a i1 i 2<br />
V 2 (ξ i1 (ω),ξ i2 (ω)) + ... . (3.19)<br />
For notational convenience, this expression can be rewritten <strong>using</strong> multi-index notation<br />
X(ω) = ∑ ∞ α=1 a αΨ α ( ˜ξ (ω)) . (3.20)<br />
The functions V n and Ψ α have a one-to-one correspondence, i.e. every V n appears in the summation<br />
over j, but has a different index. In what follows, we do not denote the dependence <strong>of</strong> ξ on ω<br />
explicitly to ease notation when no integration over the stochastic space Ω is involved.<br />
The Hermite-polynomials Ψ α form an orthogonal basis <strong>of</strong> the space L 2 (Ω), i.e.<br />
∫<br />
Ω<br />
Ψ α ( ˜ξ (ω)<br />
)<br />
Ψ β ( ˜ξ (ω)<br />
)dω = 〈Ψ α ,Ψ β 〉 = 〈(Ψ α ) 2 〉δ αβ . (3.21)<br />
For a finite number <strong>of</strong> basic random variables ξ = (ξ 1 ,...,ξ n ) we simplify (3.21) by <strong>using</strong> (3.1). The<br />
scalar product 〈 f ,g〉 is<br />
∫<br />
∫<br />
〈Ψ α (ξ ),Ψ β (ξ )〉 = Ψ α (ξ (ω))Ψ β (ξ (ω))dω = Ψ α (x)Ψ β (x)dΠ, (3.22)<br />
Ω<br />
Γ<br />
where Γ = supp(ξ ) ⊂ IR n . It follows from (3.22) that the weighting function w that is needed to get<br />
orthonormal polynomials is<br />
1<br />
w(x) = √ . (3.23)<br />
(2π) n e − 1 2 xT x<br />
This weighting function is the key to understand the good approximation quality <strong>of</strong> the Hermiteexpansion,<br />
because the weighting function for the Hermite-polynomials is the same as the PDF <strong>of</strong><br />
an n-dimensional Gaussian random variable, i.e. w(x) = ∏ i ρ i = ρ(x). Xiu and Karniadakis [160]<br />
investigated this correspondence between the weighting functions for the orthogonal polynomial<br />
basis and the density functions <strong>of</strong> random variables. Section 3.3.3 summarizes the findings. Thus,<br />
the computation <strong>of</strong> the scalar product reduces to integration over a subset <strong>of</strong> IR n . For this, we use a<br />
quadrature rule. Since we are integrating polynomials, the usage <strong>of</strong> a suitable quadrature rule leads<br />
to exact results up to numerical inaccuracies.<br />
3.3.2 Cameron-Martin Theorem<br />
The Wiener chaos is an abstract representation for random variables, but it is unclear whether it converges<br />
to the desired random variable. The Cameron-Martin theorem [27] fills this gap <strong>of</strong> knowledge.<br />
We present the theorem in the version proposed in [27], but with the notation used in this thesis.<br />
30