Abstract
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. [1] 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 [2] 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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Han, X., Xu, C., Prince, J.L.: A topology preserving level set method for geometric deformable models. IEEE Transactions on Pattern Analysis and Machine Inteligence 25(6), 755–768 (2003)
Nilsson, B., Heyden, A.: A fast algorithm for level set-like active contours. Pattern Recognition Letters 24(9-10), 1331–1337 (2003)
Caselles, V., Catté, F., Coll, T., Dibos, F.: A geometric model for active contours in image processing. Numerische Mathematik 66(1), 1–31 (1993)
Caselles, V., Kimmel, R., Sapiro, G.: Geodesic active contours. International Journal of Computer Vision 22(1), 61–79 (1997)
Kass, M., Witkin, A., Terzopoulos, D.: Snakes: Active contour models. International Journal of Computer Vision 1(4), 321–331 (1987)
Osher, S., Fedkiw, R.: Level Set Methods and Dynamic Implicit Surfaces. Springer, New York (2003)
Goldenberg, R., Kimmel, R., Rivlin, E., Rudzsky, M.: Fast geodesic active contours. IEEE Transactions on Image Processing 10(10), 1467–1475 (2001)
Kühne, G., Weickert, J., Beier, M., Effelsberg, W.: Fast implicit active contour models. In: Van Gool, L. (ed.) DAGM 2002. LNCS, vol. 2449, pp. 133–140. Springer, Heidelberg (2002)
Adalsteinsson, D., Sethian, J.A.: A fast level set method for propagating interfaces. Journal of Computational Physics 118(2), 269–277 (1995)
Whitaker, R.T.: A level-set approach to 3D reconstruction from range data. International Journal of Computer Vision 29(3), 203–231 (1998)
Sethian, J.A.: A fast marching level set method for monotonically advancing fronts. Proceedings of the National Academy of Sciences 93(4), 1591–1595 (1996)
Deng, J., Tsui, H.T.: A fast level set method for segmentation of low contrast noisy biomedical images. Pattern Recognition Letters 23(1-3), 161–169 (2002)
Maška, M., Hubený, J., Svoboda, D., Kozubek, M.: A comparison of fast level set-like algorithms for image segmentation in fluorescence microscopy. In: Bebis, G., Boyle, R., Parvin, B., Koracin, D., Paragios, N., Tanveer, S.-M., Ju, T., Liu, Z., Coquillart, S., Cruz-Neira, C., Müller, T., Malzbender, T. (eds.) ISVC 2007, Part II. LNCS, vol. 4842, pp. 571–581. Springer, Heidelberg (2007)
Alexandrov, O., Santosa, F.: A topology-preserving level set method for shape optimization. Journal of Computational Physics 204(1), 121–130 (2005)
Le Guyader, C., Vese, L.A.: Self-repelling snakes for topology-preserving segmentation models. IEEE Transactions on Image Processing 17(5), 767–779 (2008)
Klette, R., Rosenfeld, A.: Digital Geometry: Geometric Methods for Digital Picture Analysis. Morgan Kaufmann, San Francisco (2004)
Bertrand, G., Malandain, G.: A new characterization of three-dimensional simple points. Pattern Recognition Letters 15(2), 169–175 (1994)
Malandain, G., Bertrand, G.: Fast characterization of 3d simple points. In: Proceedings of 11th International Conference on Pattern Recognition, pp. 232–235 (1992)
Svoboda, D., Kozubek, M., Stejskal, S.: Digital cell phantom generation and simulation of image formation in 3d image cytometry. Cytometry Part A 75A(6), 494–509 (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Maška, M., Matula, P. (2009). A Fast Level Set-Like Algorithm with Topology Preserving Constraint. In: Jiang, X., Petkov, N. (eds) Computer Analysis of Images and Patterns. CAIP 2009. Lecture Notes in Computer Science, vol 5702. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03767-2_113
Download citation
DOI: https://doi.org/10.1007/978-3-642-03767-2_113
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-03766-5
Online ISBN: 978-3-642-03767-2
eBook Packages: Computer ScienceComputer Science (R0)