Webbläsaren som du använder stöds inte av denna webbplats. Alla versioner av Internet Explorer stöds inte längre, av oss eller Microsoft (läs mer här: * https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Var god och använd en modern webbläsare för att ta del av denna webbplats, som t.ex. nyaste versioner av Edge, Chrome, Firefox eller Safari osv.

A fast algorithm for level set-like active contours

Författare

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.

Avdelning/ar

Publiceringsår

2003

Språk

Engelska

Sidor

1331-1337

Publikation/Tidskrift/Serie

Pattern Recognition Letters

Volym

24

Issue

9-10

Dokumenttyp

Artikel i tidskrift

Förlag

Elsevier

Ämne

  • Mathematics

Nyckelord

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

Status

Published

ISBN/ISSN/Övrigt

  • ISSN: 0167-8655