A Fast Level Set-Like Algorithm with Topology Preserving Constraint

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F09%3A00034150" target="_blank" >RIV/00216224:14330/09:00034150 - isvavai.cz</a>

Nalezeny alternativní kódy

RIV/00216224:14330/09:00067104

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

A Fast Level Set-Like Algorithm with Topology Preserving Constraint

Popis výsledku v původním jazyce

Implicit active contours are widely employed in image processing and related areas. Their implementation using the level set framework brings several advantages over parametric snakes. In particular, a parametrization independence, topological flexibility, and straightforward extension into higher dimensions have led to their popularity. However, in some applications the topological flexibility of the implicit contour is not desirable. Imposing topology-preserving constraints on evolving contours is often more convenient than including additional postprocessing steps. In this paper, we build on the work by Han et al. (2003) introducing a topology-preserving extension of the narrow band algorithm involving simple point concept from digital geometry. Inorder to significantly increase computational speed, we integrate a fast level set-like algorithm by Nilsson and Heyden (2003) with the simple point concept to obtain a fast topology-preserving algorithm for implicit active contours.

Název v anglickém jazyce

A Fast Level Set-Like Algorithm with Topology Preserving Constraint

Popis výsledku anglicky

Implicit active contours are widely employed in image processing and related areas. Their implementation using the level set framework brings several advantages over parametric snakes. In particular, a parametrization independence, topological flexibility, and straightforward extension into higher dimensions have led to their popularity. However, in some applications the topological flexibility of the implicit contour is not desirable. Imposing topology-preserving constraints on evolving contours is often more convenient than including additional postprocessing steps. In this paper, we build on the work by Han et al. (2003) introducing a topology-preserving extension of the narrow band algorithm involving simple point concept from digital geometry. Inorder to significantly increase computational speed, we integrate a fast level set-like algorithm by Nilsson and Heyden (2003) with the simple point concept to obtain a fast topology-preserving algorithm for implicit active contours.

Druh

D - Stať ve sborníku

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

Výsledek vznikl pri realizaci vícero projektů. Více informací v záložce Projekty.

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)

Rok uplatnění

2009

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název statě ve sborníku

13th International Conference on Computer Analysis of Images and Patterns

ISBN

978-3-642-03766-5

ISSN

—

e-ISSN

—

Počet stran výsledku

9

Strana od-do

—

Název nakladatele

Springer-Verlag

Místo vydání

Berlin, Heidelberg

Místo konání akce

Muenster

Datum konání akce

2. 9. 2009

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

000273458100113