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 2<br />
Image <strong>Segmentation</strong> and Limitations<br />
In this chapter, we give a short review <strong>of</strong> the research in mathematical image processing and segmentation<br />
related to the work in this thesis. We focus on PDE based methods for image processing,<br />
because these methods have advantages over other image processing methods:<br />
• They are based on a continuous formulation <strong>of</strong> images, but the discretization based on finite<br />
differences or finite elements naturally leads to regular grids, characteristic for digital images.<br />
• It is possible to show existence and uniqueness <strong>of</strong> solutions <strong>of</strong> PDE based methods <strong>using</strong><br />
well-known results from functional analysis.<br />
• Later, we will see that PDE based methods extend naturally to stochastic images, the object<br />
under investigation in this thesis.<br />
The application <strong>of</strong> PDE models in image processing is a rapidly growing field <strong>of</strong> research. Many<br />
authors (see [17,130] for an overview) presented methods based on PDEs to solve problems arising in<br />
image processing like denoising, restoration, segmentation, registration, flow extraction, etc. Since<br />
we are interested in segmentation, the presentation focuses on results important for segmentation.<br />
Image segmentation, the separation <strong>of</strong> an image into object and background, is a repeatedly investigated<br />
problem in image processing. The literature divides the proposed methods into three<br />
categories, based on the user interaction necessary to perform the segmentation:<br />
Automatic segmentation: The user defines segmentation parameters at the beginning only, but<br />
has no possibility to refine the segmentation result.<br />
Semi-automatic segmentation: The user defines initial contours and parameters to optimize the<br />
segmentation result, but again has no chance to refine the result.<br />
Interactive segmentation: The user interactively refines the segmentation result. Thus, this<br />
method computes a segmentation result based on the user input and allows user interaction<br />
afterwards to get new input for the next iteration step.<br />
PDE based image segmentation methods are in all <strong>of</strong> these segmentation categories. The random<br />
walker segmentation [59] is an interactive segmentation approach, where the user interactively refines<br />
the segmentation result. The level set based segmentation methods [29, 96, 138] are semiautomatic,<br />
because the user has to define an initial contour as the starting point for the algorithm, but<br />
has no chance to influence the segmentation result during the run <strong>of</strong> the algorithm. The Mumford-<br />
Shah approach [107] is fully automatic. The user defines parameters only, but has no possibility to<br />
define initial contours or to modify the result locally afterwards.<br />
We organized this chapter as follows: First, we present basic definitions needed for the presentation<br />
<strong>of</strong> PDE based segmentation algorithms. Afterwards, we present five segmentation algorithms:<br />
random walker segmentation, Ambrosio-Tortorelli segmentation, and the level set based segmentation<br />
methods gradient-based segmentation, geodesic active contours and Chan-Vese segmentation.<br />
At the end, we present limitations <strong>of</strong> classical segmentation algorithms to motivate further investigations<br />
to extend these classical methods and draw conclusions.<br />
7