11.03.2014 Views

Segmentation of Stochastic Images using ... - Jacobs University

Segmentation of Stochastic Images using ... - Jacobs University

Segmentation of Stochastic Images using ... - Jacobs University

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

Chapter 3 SPDEs and Polynomial Chaos Expansions<br />

H 1 (x) = 1<br />

H 2 (x) = √ 3x<br />

H 3 (x) = √ 5 · (1.5 ∗ x 2 − 0.5)<br />

H 4 (x) = √ 7 · (2.5x 3 − 1.5 ∗ x)<br />

H 5 (x) = √ 9 · 1<br />

8 (35x4 − 30x 2 + 3.0)<br />

H 6 (x) = √ 11 · 1<br />

8 (63x5 − 70x 3 + 15x)<br />

H 7 (x) = √ 13 · 1<br />

16 (231x6 − 315x 4 + 105x − 5)<br />

H 8 (x) = √ 15 · 1<br />

16 (429x7 − 693x 5 + 315x 3 − 35x)<br />

H 9 (x) = √ 1<br />

17 ·<br />

128 (6435x8 − 12012x 6 + 6930x 4 − 1260x 2 + 35)<br />

H 10 (x) = √ 1<br />

19 ·<br />

128 (12155x9 − 25740x 7 + 18018x 5 − 4620x 3 + 315x)<br />

Table 3.1: The first ten one-dimensional Legendre-polynomials. The multi-dimensional polynomials<br />

up to degree nine are based on these polynomials and (3.40).<br />

<strong>of</strong> polynomial chaos expansion. In this expansion, one random variable acts as indicator function for<br />

the modes <strong>of</strong> the approximated random variable. Then the multimodal random variable is approximated<br />

on all modes independently. Wan and Karniadakis [152] introduced a similar approach called<br />

multi-element polynomial chaos (MEPC). The idea <strong>of</strong> this method is to decompose the stochastic<br />

space into smaller elements. Since we are approximating L 2 -functions in the stochastic space, we<br />

need no coupling condition between the stochastic elements, i.e. the solutions may have jumps across<br />

the elements. This allows for an efficient parallelization <strong>of</strong> the MEPC, because it is possible to perform<br />

the computations for elements in the stochastic space on different machines and there is no<br />

need for communication between the machines.<br />

To use the polynomial chaos expansion in numerical schemes makes it necessary to cut <strong>of</strong> the<br />

series expansion after a finite number <strong>of</strong> terms. This is done by choosing the number <strong>of</strong> random<br />

variables used for the approximation, denoted by n and by prescribing the maximal polynomial<br />

degree p in the expansion. As usual for a polynomial basis, the number <strong>of</strong> terms in the expansion is<br />

( ) n + p<br />

N = . (3.30)<br />

p<br />

Random variable Wiener-Askey chaos Support<br />

Gaussian Hermite-Polynomials (−∞,∞)<br />

Gamma Laguerre-Polynomials [0,∞)<br />

Beta Jacobi-Polynomials [a,b]<br />

Uniform Legendre-Polynomials [a,b]<br />

Poisson Charlier-Polynomials discrete<br />

Binomial Krawtchouk-Polynomials discrete<br />

Table 3.2: Important distributions and the corresponding polynomials for the expansion.<br />

32

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

Saved successfully!

Ooh no, something went wrong!