Abstract

We present a model for image segmentation and describe a gradient-descent method for level-set based shape optimization. It is commonly known that gradient-descent methods converge slowly due to zig–zag movement. This can also be observed for our problem, especially when sharp edges are present in the image. We interpret this in our specific context to gain a better understanding of the involved difficulties. One way to overcome slow convergence is the use of second-order methods. For our situation, they require derivatives of the potentially noisy image data and are thus undesirable. Hence, we propose a new method that can be interpreted as a self-consistent gradient flow and does not need any derivatives of the image data. It works very well in practice and leads to a far more efficient optimization algorithm. A related idea can also be used to describe the mean-curvature flow of a mean-convex surface. For this, we formulate a mean-curvature Eikonal equation, which allows a numerical propagation of the mean-curvature flow of a surface without explicit time stepping.

Highlights

  • We present a model for image segmentation and describe a gradient-descent method for level-set based shape optimization

  • We propose a new method that can be interpreted as a self-consistent gradient flow and does not need any derivatives of the image data

  • Since its introduction in [22], the level-set method of Osher and Sethian has become very popular for describing evolving geometries for shape optimization and free-boundary problems

Read more

Summary

Optimization Methods and Software

ISSN: 1055-6788 (Print) 1029-4937 (Online) Journal homepage: https://www.tandfonline.com/loi/goms. It is commonly known that gradient-descent methods converge slowly due to zig–zag movement This can be observed for our problem, especially when sharp edges are present in the image. We propose a new method that can be interpreted as a self-consistent gradient flow and does not need any derivatives of the image data. It works very well in practice and leads to a far more efficient optimization algorithm.

Introduction
A model for image segmentation
The gradient-descent method
Self-consistent speed fields
Numerical realization as a multi-step procedure
Demonstration in 1D
The image-segmentation problem
Incorporating topological derivatives
Boundary length and mean-curvature flow
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call