title: Modified gradient search for level set based image segmentation.
abstract: Level set methods are a popular way to solve the image segmentation problem. The solution contour is found by solving an optimization problem where a cost functional is minimized. Gradient descent methods are often used to solve this optimization problem since they are very easy to implement and applicable to general nonconvex functionals. They are, however, sensitive to local minima and often display slow convergence. Traditionally, cost functionals have been modified to avoid these problems. In this paper, we instead propose using two modified gradient descent methods, one using a momentum term and one based on resilient propagation. These methods are commonly used in the machine learning community. In a series of 2-D/3-D-experiments using real and synthetic data with ground truth, the modifications are shown to reduce the sensitivity for local optima and to increase the convergence rate. The parameter sensitivity is also investigated. The proposed methods are very simple modifications of the basic method, and are directly compatible with any type of level set implementation. Downloadable reference code with examples is available online.
authors.affiliation: Center for Medical Image Science and Visualization, Linköping University, Linköping, Sweden. thord.andersson@liu.se
authors.forename: Thord
authors.initials: T
authors.lastname: Andersson
authors.forename: Gunnar
authors.initials: G
authors.lastname: Läthén
authors.forename: Reiner
authors.initials: R
authors.lastname: Lenz
authors.forename: Magnus
authors.initials: M
authors.lastname: Borga
mesh_terms: D000465:Algorithms; D000792:Angiography / Q000379:methods; D001921:Brain / Q000098:blood supply; D016208:Databases, Factual; D006801:Humans; D007091:Image Processing, Computer-Assisted / Q000379:methods*; D012372:ROC Curve; D012171:Retinal Vessels / Q000033:anatomy & histology