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
n19http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n23http://localhost/temp/predkladatel/
n22http://purl.org/net/nknouf/ns/bibtex#
n17http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n9http://linked.opendata.cz/resource/domain/vavai/projekt/
n8http://linked.opendata.cz/resource/domain/vavai/subjekt/
n7http://linked.opendata.cz/ontology/domain/vavai/
n21https://schema.org/
n15http://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/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n6http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n10http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n18http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n11http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n20http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n16http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n13http://reference.data.gov.uk/id/gregorian-year/
n12http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F00216224%3A14330%2F11%3A00051805%21RIV12-MSM-14330___/

Statements

Subject Item
n2:RIV%2F00216224%3A14330%2F11%3A00051805%21RIV12-MSM-14330___
rdf:type
skos:Concept n7:Vysledek
dcterms:description
In this paper, we propose a modification to the Boykov-Kolmogorov maximum flow algorithm in order to make the algorithm preserve the topology of an initial interface. This algorithm is being widely used in computer vision and image processing fields for its efficiency and speed when dealing with problems such as graph cut based image segmentation. Using our modification we are able to incorporate a topology prior into the algorithm allowing us to apply it in situations in which the inherent topological flexibility of graph cuts is inconvenient (e.g., biomedical image segmentation). Our approach exploits the simple point concept from digital geometry and is simpler and more straightforward to implement than previously introduced methods. Due to the NP-completeness of the topology preserving problem our algorithm is only an approximation and is initialization dependent. However, promising results are demonstrated on graph cut based segmentation of both synthetic and real image data. In this paper, we propose a modification to the Boykov-Kolmogorov maximum flow algorithm in order to make the algorithm preserve the topology of an initial interface. This algorithm is being widely used in computer vision and image processing fields for its efficiency and speed when dealing with problems such as graph cut based image segmentation. Using our modification we are able to incorporate a topology prior into the algorithm allowing us to apply it in situations in which the inherent topological flexibility of graph cuts is inconvenient (e.g., biomedical image segmentation). Our approach exploits the simple point concept from digital geometry and is simpler and more straightforward to implement than previously introduced methods. Due to the NP-completeness of the topology preserving problem our algorithm is only an approximation and is initialization dependent. However, promising results are demonstrated on graph cut based segmentation of both synthetic and real image data.
dcterms:title
A Simple Topology Preserving Max-Flow Algorithm for Graph Cut Based Image Segmentation A Simple Topology Preserving Max-Flow Algorithm for Graph Cut Based Image Segmentation
skos:prefLabel
A Simple Topology Preserving Max-Flow Algorithm for Graph Cut Based Image Segmentation A Simple Topology Preserving Max-Flow Algorithm for Graph Cut Based Image Segmentation
skos:notation
RIV/00216224:14330/11:00051805!RIV12-MSM-14330___
n7:predkladatel
n8:orjk%3A14330
n3:aktivita
n11:Z n11:S n11:P
n3:aktivity
P(2B06052), P(LC535), S, Z(MSM0021622419)
n3:dodaniDat
n13:2012
n3:domaciTvurceVysledku
n17:9021094 n17:8900736
n3:druhVysledku
n20:D
n3:duvernostUdaju
n10:S
n3:entitaPredkladatele
n12:predkladatel
n3:idSjednocenehoVysledku
184147
n3:idVysledku
RIV/00216224:14330/11:00051805
n3:jazykVysledku
n18:eng
n3:klicovaSlova
maximum flow algorithm; topology preserving; image segmentation; graph cuts
n3:klicoveSlovo
n6:maximum%20flow%20algorithm n6:graph%20cuts n6:topology%20preserving n6:image%20segmentation
n3:kontrolniKodProRIV
[A919B11C08BF]
n3:mistoKonaniAkce
Mikulov
n3:mistoVydani
Saarbrücken, Warden
n3:nazevZdroje
Sixth Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (Selected Papers)
n3:obor
n16:IN
n3:pocetDomacichTvurcuVysledku
2
n3:pocetTvurcuVysledku
2
n3:projekt
n9:2B06052 n9:LC535
n3:rokUplatneniVysledku
n13:2011
n3:tvurceVysledku
Daněk, Ondřej Maška, Martin
n3:typAkce
n19:EUR
n3:zahajeniAkce
2010-10-22+02:00
n3:zamer
n15:MSM0021622419
s:issn
2190-6807
s:numberOfPages
7
n22:hasPublisher
Schloss Dagstuhl Publishing
n21:isbn
978-3-939897-22-4
n23:organizacniJednotka
14330