A Fast Level Set-Like Algorithm for Region-Based Active Contours
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 parameterization independence, topological flexibility, and straightforward extension into higher dimensions have led to their popularity. On the other hand, a numerical solution of associated partial differential equations (PDEs) is very time-consuming, especially for large 3D images. In this paper, we modify a fast level set-like algorithm by Nilsson and Heyden  intended for tracking gradient-based active contours in order to obtain a fast algorithm for tracking region-based active contours driven by the Chan-Vese model. The potential of the proposed algorithm and its comparison with two other fast methods minimizing the Chan-Vese model are demonstrated on both synthetic and real image data.
KeywordsActive Contour Active Contour Model Initial Contour Speed Function Interface Point
Unable to display preview. Download preview PDF.
- 7.Gibou, F., Fedkiw, R.: A fast hybrid k-means level set algorithm for segmentation. In: Proceedings of the 4th Annual Hawaii International Conference on Statistics and Mathematics, pp. 281–291 (2005)Google Scholar
- 9.Hubený, J., Matula, P.: Fast and robust segmentation of low contrast biomedical images. In: Proceedings of the 6th IASTED International Conference on Visualization, Imaging and Image Processing, pp. 189–196 (2006)Google Scholar
- 12.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)CrossRefGoogle Scholar
- 23.Zeng, Y., Chen, W., Peng, Q.: Efficiently solving the piecewise constant Mumford-Shah model using graph cuts. Tech. rep., Department of Computer Science, Zhejiang University, China (2006)Google Scholar