This HTML5 document contains 48 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
n18http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n22http://localhost/temp/predkladatel/
n23http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F00216224%3A14330%2F09%3A00067104%21RIV14-MSM-14330___/
n9http://purl.org/net/nknouf/ns/bibtex#
n19http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n7http://linked.opendata.cz/resource/domain/vavai/projekt/
n17http://linked.opendata.cz/ontology/domain/vavai/
n15https://schema.org/
n11http://linked.opendata.cz/resource/domain/vavai/zamer/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n3http://linked.opendata.cz/ontology/domain/vavai/riv/
n21http://bibframe.org/vocab/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n14http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n20http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n16http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n4http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n8http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n5http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n10http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F00216224%3A14330%2F09%3A00067104%21RIV14-MSM-14330___
rdf:type
n17:Vysledek skos:Concept
dcterms: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.
dcterms:title
A Fast Level Set-Like Algorithm with Topology Preserving Constraint A Fast Level Set-Like Algorithm with Topology Preserving Constraint
skos:prefLabel
A Fast Level Set-Like Algorithm with Topology Preserving Constraint A Fast Level Set-Like Algorithm with Topology Preserving Constraint
skos:notation
RIV/00216224:14330/09:00067104!RIV14-MSM-14330___
n3:aktivita
n16:P n16:Z
n3:aktivity
P(2B06052), P(LC535), Z(MSM0021622419)
n3:dodaniDat
n10:2014
n3:domaciTvurceVysledku
n19:9465146 n19:9021094
n3:druhVysledku
n8:D
n3:duvernostUdaju
n20:S
n3:entitaPredkladatele
n23:predkladatel
n3:idSjednocenehoVysledku
301258
n3:idVysledku
RIV/00216224:14330/09:00067104
n3:jazykVysledku
n4:eng
n3:klicovaSlova
level set framework; topology preservation; contour evolution; image segmentation
n3:klicoveSlovo
n14:level%20set%20framework n14:contour%20evolution n14:image%20segmentation n14:topology%20preservation
n3:kontrolniKodProRIV
[48D76FB42DDE]
n3:mistoKonaniAkce
Muenster
n3:mistoVydani
Berlin, Heidelberg
n3:nazevZdroje
13th International Conference on Computer Analysis of Images and Patterns
n3:obor
n5:IN
n3:pocetDomacichTvurcuVysledku
2
n3:pocetTvurcuVysledku
2
n3:projekt
n7:2B06052 n7:LC535
n3:rokUplatneniVysledku
n10:2009
n3:tvurceVysledku
Maška, Martin Matula, Pavel
n3:typAkce
n18:WRD
n3:wos
000273458100113
n3:zahajeniAkce
2009-09-02+02:00
n3:zamer
n11:MSM0021622419
s:issn
0302-9743
s:numberOfPages
9
n21:doi
10.1007/978-3-642-03767-2_113
n9:hasPublisher
Springer-Verlag
n15:isbn
9783642037665
n22:organizacniJednotka
14330