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

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

2.3 Mumford-Shah and Ambrosio-Tortorelli <strong>Segmentation</strong><br />

Theorem 2.1. Define Ẽ AT : L 1 (D) × L 1 (D) → IR + by<br />

{<br />

EAT (u,φ) if (u,φ) ∈ H<br />

Ẽ AT (u,φ) :=<br />

1 (D) × H 1 (D),0 ≤ φ ≤ 1<br />

+∞ otherwise<br />

(2.21)<br />

and G : L 1 (D) × L 1 (D) → IR + by<br />

{<br />

EMS (u) if u ∈ GSBV(D) and φ = 1 almost everywhere<br />

G(u,φ) =<br />

+∞ otherwise.<br />

(2.22)<br />

If k ε = o(ε), then Ẽ AT Γ-converges to G(u,φ) for ε → 0.<br />

The convergence <strong>of</strong> the Ambrosio-Tortorelli energy towards the Mumford-Shah energy enables us<br />

to use the coupled pair <strong>of</strong> PDEs obtained as Euler-Lagrange equations <strong>of</strong> the Ambrosio-Tortorelli<br />

energy and to solve this with very small ε. The result is a phase field that is close to the characteristic<br />

function <strong>of</strong> the edge set <strong>of</strong> the Mumford-Shah functional.<br />

2.3.3 Edge Continuity and Edge Consistency<br />

The classical Mumford-Shah model and the Ambrosio-Tortorelli approximation lack a step linking<br />

edges. This step is necessary to enforce the detection <strong>of</strong> closed contours in the images. Otherwise,<br />

the appearance <strong>of</strong> partially detected, breaking up contours is possible, see Fig. 2.5. For example,<br />

Erdem et al. [49] introduced such a step for the Ambrosio-Tortorelli model. The idea is to use a<br />

modified diffusion coefficient in the image equation. This modified coefficient does not depend on<br />

the phase field exclusively, but contains information about the continuity and directional consistency<br />

<strong>of</strong> the detected edges. To be more precise, Erdem et al. [49] proposed to use the equation<br />

−∇ · (µ((cφ) 2 + k ε )∇u ) + u = u 0 , (2.23)<br />

instead <strong>of</strong> the first equation <strong>of</strong> (2.18). The additional factor c is the product <strong>of</strong> the two factors from<br />

the directional consistency c dc and the edge continuity c h , i.e.<br />

c = c dc · c h . (2.24)<br />

If c < 1, the diffusivity decreases, allowing to form new edges in the image, whereas c > 1 leads to<br />

an increased diffusivity, allowing to smooth away unwanted edges.<br />

Directional Consistency<br />

The directional consistency tries to judge the quality <strong>of</strong> the detected edges based on information<br />

from surrounding pixels. The idea is that an edge is reliable if the gradients <strong>of</strong> the image for pixels<br />

in directions perpendicular to the edge are in parallel. For inaccurately detected edges, e.g. due to<br />

noise, these gradients are typically not aligned. To do so, Erdem et al. [49] introduced<br />

(c dc ) i = ζ dc<br />

i<br />

+ 1 − ζ i<br />

dc<br />

(2.25)<br />

φ i<br />

for all pixels i ∈ I , where ζi<br />

dc measures the alignment <strong>of</strong> the gradients. This factor increases the<br />

diffusion, if the image gradients around the detected edge are not aligned. As the feedback measure<br />

for the alignment <strong>of</strong> the gradients they proposed to use<br />

( ( ))<br />

1<br />

ζi<br />

dc = exp ε dc |η s | ∑ ∇v<br />

j∈η s i · ∇v j − 1 , (2.26)<br />

15

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

Saved successfully!

Ooh no, something went wrong!