Další formáty:
BibTeX
LaTeX
RIS
@inproceedings{923361,
author = {Daněk, Ondřej and Maška, Martin},
address = {Saarbrücken, Warden},
booktitle = {Sixth Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (Selected Papers)},
keywords = {maximum flow algorithm; topology preserving; image segmentation; graph cuts},
howpublished = {elektronická verze "online"},
language = {eng},
location = {Saarbrücken, Warden},
isbn = {978-3-939897-22-4},
note = {OASIcs: Open Access Series in Informatics},
pages = {19-25},
publisher = {Schloss Dagstuhl Publishing},
title = {A Simple Topology Preserving Max-Flow Algorithm for Graph Cut Based Image Segmentation},
url = {http://drops.dagstuhl.de/portals/oasics/index.php?semnr=11002},
year = {2011}
}
TY - JOUR
ID - 923361
AU - Daněk, Ondřej - Maška, Martin
PY - 2011
TI - A Simple Topology Preserving Max-Flow Algorithm for Graph Cut Based Image Segmentation
PB - Schloss Dagstuhl Publishing
CY - Saarbrücken, Warden
SN - 9783939897224
N1 - OASIcs: Open Access Series in Informatics
KW - maximum flow algorithm
KW - topology preserving
KW - image segmentation
KW - graph cuts
UR - http://drops.dagstuhl.de/portals/oasics/index.php?semnr=11002
N2 - 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.
ER -
DANĚK, Ondřej a Martin MAŠKA. A Simple Topology Preserving Max-Flow Algorithm for Graph Cut Based Image Segmentation. Online. In \textit{Sixth Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (Selected Papers)}. Saarbrücken, Warden: Schloss Dagstuhl Publishing, 2011. s.~19-25. ISBN~978-3-939897-22-4. [citováno 2024-04-24]
|
