About: A Simple Topology Preserving Max-Flow Algorithm for Graph Cut Based Image Segmentation

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

About: A Simple Topology Preserving Max-Flow Algorithm for Graph Cut Based Image Segmentation 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	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. (en)
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 (en)
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 (en)
skos:notation	RIV/00216224:14330/11:00051805!RIV12-MSM-14330___
http://linked.open...avai/riv/aktivita	P S Z
http://linked.open...avai/riv/aktivity	P(2B06052), P(LC535), S, Z(MSM0021622419)
http://linked.open...vai/riv/dodaniDat	2012
http://linked.open...aciTvurceVysledku	Daněk, Ondřej Maška, Martin
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	184147
http://linked.open...ai/riv/idVysledku	RIV/00216224:14330/11:00051805
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	maximum flow algorithm; topology preserving; image segmentation; graph cuts (en)
http://linked.open.../riv/klicoveSlovo	graph cuts image segmentation maximum flow algorithm topology preserving
http://linked.open...ontrolniKodProRIV	[A919B11C08BF]
http://linked.open...v/mistoKonaniAkce	Mikulov
http://linked.open...i/riv/mistoVydani	Saarbrücken, Warden
http://linked.open...i/riv/nazevZdroje	Sixth Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (Selected Papers)
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	2011
http://linked.open...iv/tvurceVysledku	Daněk, Ondřej Maška, Martin
http://linked.open...vavai/riv/typAkce	EUR - Evropská
http://linked.open.../riv/zahajeniAkce	2010-10-22 (xsd:date)
http://linked.open...n/vavai/riv/zamer	Highly Parallel and Distributed Computing Systems
issn	2190-6807
number of pages	7 (xsd:int)
http://purl.org/ne...btex#hasPublisher	Schloss Dagstuhl Publishing
https://schema.org/isbn	978-3-939897-22-4
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