Analysis of Numerical Methods for Level Set Based Image Segmentation

Authors:
Björn Scheuermann;Bodo Rosenhahn
Affiliations:
Institut für Informationsverarbeitung, Leibnitz Universität Hannover,;Institut für Informationsverarbeitung, Leibnitz Universität Hannover,
Venue:
ISVC '09 Proceedings of the 5th International Symposium on Advances in Visual Computing: Part II
Year:
2009

Citing 9
Cited 1

Efficient implementation of essentially non-oscillatory shock-capturing schemes

Journal of Computational Physics
Shape Modeling with Front Propagation: A Level Set Approach

IEEE Transactions on Pattern Analysis and Machine Intelligence
A variational level set approach to multiphase motion

Journal of Computational Physics
Region Competition: Unifying Snakes, Region Growing, and Bayes/MDL for Multiband Image Segmentation

IEEE Transactions on Pattern Analysis and Machine Intelligence
Diffusion Snakes: Introducing Statistical Shape Knowledge into the Mumford-Shah Functional

International Journal of Computer Vision
Shape Priors for Level Set Representations

ECCV '02 Proceedings of the 7th European Conference on Computer Vision-Part II
Natural Image Statistics for Natural Image Segmentation

International Journal of Computer Vision
Three-Dimensional Shape Knowledge for Joint Image Segmentation and Pose Tracking

International Journal of Computer Vision
Active contours without edges

IEEE Transactions on Image Processing

N-view human silhouette segmentation in cluttered, partially changing environments

Proceedings of the 32nd DAGM conference on Pattern recognition

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we analyze numerical optimization procedures in the context of level set based image segmentation. The Chan-Vese functional for image segmentation is a general and popular variational model. Given the corresponding Euler-Lagrange equation to the Chan-Vese functional the region based segmentation is usually done by solving a differential equation as an initial value problem. While most works use the standard explicit Euler method, we analyze and compare this method with two higher order methods (second and third order Runge-Kutta methods). The segmentation accuracy and the dependence of these methods on the involved parameters are analyzed by numerous experiments on synthetic images as well as on real images. Furthermore, the performance of the approaches is evaluated in a segmentation benchmark containing 1023 images. It turns out, that our proposed higher order methods perform more robustly, more accurately and faster compared to the commonly used Euler method.