About: A Fast Level Set-Like Algorithm with Topology Preserving Constraint

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: A Fast Level Set-Like Algorithm with Topology Preserving Constraint Goto Sponge NotDistinct Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
Description	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. In order 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. 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. In order 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. (en)
Title	A Fast Level Set-Like Algorithm with Topology Preserving Constraint A Fast Level Set-Like Algorithm with Topology Preserving Constraint (en)
skos:prefLabel	A Fast Level Set-Like Algorithm with Topology Preserving Constraint A Fast Level Set-Like Algorithm with Topology Preserving Constraint (en)
skos:notation	RIV/00216224:14330/09:00067104!RIV14-MSM-14330___
http://linked.open...avai/riv/aktivita	P Z
http://linked.open...avai/riv/aktivity	P(2B06052), P(LC535), Z(MSM0021622419)
http://linked.open...vai/riv/dodaniDat	2014
http://linked.open...aciTvurceVysledku	Maška, Martin Matula, Pavel
http://linked.open.../riv/druhVysledku	D - Článek ve sborníku
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	Masarykova univerzita / Fakulta informatiky
http://linked.open...dnocenehoVysledku	301258
http://linked.open...ai/riv/idVysledku	RIV/00216224:14330/09:00067104
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	level set framework; topology preservation; contour evolution; image segmentation (en)
http://linked.open.../riv/klicoveSlovo	level set framework topology preservation image segmentation contour evolution
http://linked.open...ontrolniKodProRIV	[48D76FB42DDE]
http://linked.open...v/mistoKonaniAkce	Muenster
http://linked.open...i/riv/mistoVydani	Berlin, Heidelberg
http://linked.open...i/riv/nazevZdroje	13th International Conference on Computer Analysis of Images and Patterns
http://linked.open...in/vavai/riv/obor	IN
http://linked.open...ichTvurcuVysledku	2 (xsd:int)
http://linked.open...cetTvurcuVysledku	2 (xsd:int)
http://linked.open...vavai/riv/projekt	Determination of markers, screening and early diagnostics of cancer diseases using highly automated processing of multidimensional biomedical images Chromosome dynamics and organization during the cell cycle in normal and pathologic conditions
http://linked.open...UplatneniVysledku	2009
http://linked.open...iv/tvurceVysledku	Matula, Pavel Maška, Martin
http://linked.open...vavai/riv/typAkce	WRD - Světová
http://linked.open...ain/vavai/riv/wos	000273458100113
http://linked.open.../riv/zahajeniAkce	2009-09-02 (xsd:date)
http://linked.open...n/vavai/riv/zamer	Highly Parallel and Distributed Computing Systems
issn	0302-9743
number of pages	9 (xsd:int)
http://bibframe.org/vocab/doi	10.1007/978-3-642-03767-2_113
http://purl.org/ne...btex#hasPublisher	Springer-Verlag
https://schema.org/isbn	9783642037665
http://localhost/t...ganizacniJednotka	14330

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 38 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software