The browser you are using is not supported by this website. All versions of Internet Explorer are no longer supported, either by us or Microsoft (read more here: https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Please use a modern browser to fully experience our website, such as the newest versions of Edge, Chrome, Firefox or Safari etc.

A fast algorithm for level set-like active contours

På svenska

Author

Summary, in English

This paper describes a fast algorithm for topology independent tracking of moving interfaces under curvature- and velocity field-dependent speed laws. This is usually done in the level set framework using the narrow-band algorithm, which accurately solves the level set equation but is too slow to use in real-time or near real-time image segmentation applications. In this paper we introduce a fast algorithm for tracking moving interfaces in a level set-like manner. The algorithm relies on two key components: First, it tracks the interface by scheduling point-wise propagation events using a heap sorted queue. Second, the local geometric properties of the interface are defined so that they can be efficiently updated in an incremental manner and so that they do not require the presence of the signed distance function. Finally examples are given that indicate that the algorithm is fast and accurate enough for near real-time segmentation applications.

Publishing year

2003

Language

English

Pages

1331-1337

Publication/Series

Pattern Recognition Letters

Volume

24

Issue

9-10

Document type

Journal article

Publisher

Elsevier

Topic

  • Mathematics

Keywords

  • level set methods
  • image segmentation
  • processing
  • medical image
  • active contours

Status

Published

ISBN/ISSN/Other

  • ISSN: 0167-8655