Other formats:
BibTeX
LaTeX
RIS
@inproceedings{794793,
author = {Maška, Martin and Matula, Pavel},
address = {Berlin, Heidelberg},
booktitle = {13th International Conference on Computer Analysis of Images and Patterns},
doi = {http://dx.doi.org/10.1007/978-3-642-03767-2_113},
keywords = {level set framework; topology preservation; contour evolution; image segmentation},
howpublished = {elektronická verze "online"},
language = {eng},
location = {Berlin, Heidelberg},
isbn = {978-3-642-03766-5},
note = {LNCS 5702},
pages = {930-938},
publisher = {Springer-Verlag},
title = {A Fast Level Set-Like Algorithm with Topology Preserving Constraint},
url = {http://dx.doi.org/10.1007/978-3-642-03767-2_113},
year = {2009}
}
TY - JOUR
ID - 794793
AU - Maška, Martin - Matula, Pavel
PY - 2009
TI - A Fast Level Set-Like Algorithm with Topology Preserving Constraint
PB - Springer-Verlag
CY - Berlin, Heidelberg
SN - 9783642037665
N1 - LNCS 5702
KW - level set framework
KW - topology preservation
KW - contour evolution
KW - image segmentation
UR - http://dx.doi.org/10.1007/978-3-642-03767-2_113
N2 - 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. The potential of the new algorithm is demonstrated on both synthetic and real image data.
ER -
MAŠKA, Martin and Pavel MATULA. A Fast Level Set-Like Algorithm with Topology Preserving Constraint. Online. In \textit{13th International Conference on Computer Analysis of Images and Patterns}. Berlin, Heidelberg: Springer-Verlag, 2009, p.~930-938. ISBN~978-3-642-03766-5. Available from: https://dx.doi.org/10.1007/978-3-642-03767-2\_{}113.
|
