Skip to main content

A Comparison of Fast Level Set-Like Algorithms for Image Segmentation in Fluorescence Microscopy

  • Conference paper
Advances in Visual Computing (ISVC 2007)

Part of the book series: Lecture Notes in Computer Science ((LNIP,volume 4842))

Included in the following conference series:

Abstract

Image segmentation, one of the fundamental task of image processing, can be accurately solved using the level set framework. However, the computational time demands of the level set methods make them practically useless, especially for segmentation of large three-dimensional images. Many approximations have been introduced in recent years to speed up the computation of the level set methods. Although these algorithms provide favourable results, most of them were not properly tested against ground truth images. In this paper we present a comparison of three methods: the Sparse-Field method [1], Deng and Tsui’s algorithm [2] and Nilsson and Heyden’s algorithm [3]. Our main motivation was to compare these methods on 3D image data acquired using fluorescence microscope, but we suppose that presented results are also valid and applicable to other biomedical images like CT scans, MRI or ultrasound images. We focus on a comparison of the method accuracy, speed and ability to detect several objects located close to each other for both 2D and 3D images. Furthermore, since the input data of our experiments are artificially generated, we are able to compare obtained segmentation results with ground truth images.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Whitaker, R.T.: A level-set approach to 3d reconstruction from range data. Int. J. Comput. Vision 29, 203–231 (1998)

    Article  Google Scholar 

  2. Deng, J., Tsui, H.T.: A fast level set method for segmentation of low contrast noisy biomedical images. Pattern Recognition Letters 23, 161–169 (2002)

    Article  MATH  Google Scholar 

  3. Nilsson, B., Heyden, A.: A fast algorithm for level set-like active contours. Pattern Recogn. Lett. 24, 1331–1337 (2003)

    Article  MATH  Google Scholar 

  4. Pratt, W.K.: Digital Image Processing. Wiley, Chichester (1991)

    MATH  Google Scholar 

  5. Yoo, T.S.: Insight into Images: Principles and Practice for Segmentation, Registration, and Image Analysis. AK Peters Ltd (2004)

    Google Scholar 

  6. Soille, P.: Morphological Image Analysis, 2nd edn. Springer, Heidelberg (2004)

    Google Scholar 

  7. Kass, M., Witkin, A., Terzopoulos, D.: Snakes: Active contour models. International Journal of Computer Vision 321–331 (1987)

    Google Scholar 

  8. Cohen, L.D.: On active contour models and balloons. CVGIP: Image Understanding 53, 211–218 (1991)

    Article  MATH  Google Scholar 

  9. Caselles, V., Catt, F., Coll, T., Dibos, F.: A geometric model for active contours in image processing. Numer. Math. 66, 1–31 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  10. Malladi, R., Sethian, J.A., Vemuri, B.C.: Shape modeling with front propagation: a level set approach. IEEE Transactions on Pattern Analysis and Machine Inteligence 17, 158–175 (1995)

    Article  Google Scholar 

  11. Caselles, V., Kimmel, R., Sapiro, G.: Geodesic active contours. Int. J. Comput. Vision 22, 61–79 (1997)

    Article  MATH  Google Scholar 

  12. Chan, T.F., Vese, L.A.: Active contours without edges. IEEE Transactions of Image Processing 10, 266–277 (2001)

    Article  MATH  Google Scholar 

  13. Osher, S., Sethian, J.A.: Fronts propagating with curvature dependent speed: algorithms based on Hamilton–Jacobi formulation. Journal of Computational Physics 79, 12–49 (1988)

    Article  MATH  MathSciNet  Google Scholar 

  14. Sethian, J.A.: Level Set Methods and Fast Marching Methods:Evolving interfaces in computational geometry, fluid mechanics, computer vision, and materials science, 2nd edn. Cambridge University Press, Cambridge (1999)

    MATH  Google Scholar 

  15. Sarti, A., Solórzano, C.O.d., Lockett, S., Malladi, R.: A geometric model for 3-D confocal image analysis. IEEE Transaction on Biomedical Engineering 47, 1600–1609 (2000)

    Article  Google Scholar 

  16. Adalsteinsson, D., Sethian, J.A.: The fast construction of extension velocities in level set methods. J. Comput. Phys. 148, 2–22 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  17. Solórzano, C.O.d., Malladi, R., Leliévre, S.A., Lockett, S.J.: Segmentation of nuclei and cells using membrane related protein markers. Journal of Microscopy 201, 404–415 (2001)

    Article  MathSciNet  Google Scholar 

  18. Sethian, J.A.: A fast marching level set method for monotonically advancing fronts. Proc. Nat’l Academy of Sciences 93, 1591–1595 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  19. Nilsson, B., Heyden, A.: Segmentation of complex cell clusters in microscopic images: Application to bone marrow samples. Cytometry part A 66, 24–31 (2005)

    Article  Google Scholar 

  20. Matula, P., Hubený, J., Kozubek, M.: Fast marching 3d reconstruction of interphase chromosomes. In: Sonka, M., Kakadiaris, I.A., Kybic, J. (eds.) CVAMIA. LNCS, vol. 3117, pp. 385–394. Springer, Heidelberg (2004)

    Google Scholar 

  21. Hubený, J., Matula, P., Matula, P., Kozubek, M.: Improved 3d reconstruction of interphase chromosomes based on nonlinear diffusion filtering. In: In Proceedings of PDE-Based Image Processing and Related Inverse Problem. Mathematics and Vizualization, pp. 163–173. Springer, Heidelberg (2006)

    Google Scholar 

  22. Svoboda, D., Kašík, M., Maška, M., Hubený, J., Stejskal, S., Zimmermann, M.: On simulating 3d fluorescent microscope images. In: Computer Analysis of Images and Patterns. LNCS, vol. 4673, pp. 309–316. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  23. Perlin, K.: An image synthesizer. In: SIGGRAPH 1985: Proceedings of the 12th annual conference on Computer graphics and interactive techniques, pp. 287–296. ACM Press, New York (1985)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

George Bebis Richard Boyle Bahram Parvin Darko Koracin Nikos Paragios Syeda-Mahmood Tanveer Tao Ju Zicheng Liu Sabine Coquillart Carolina Cruz-Neira Torsten Müller Tom Malzbender

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Maška, M., Hubený, J., Svoboda, D., Kozubek, M. (2007). A Comparison of Fast Level Set-Like Algorithms for Image Segmentation in Fluorescence Microscopy. In: Bebis, G., et al. Advances in Visual Computing. ISVC 2007. Lecture Notes in Computer Science, vol 4842. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-76856-2_56

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-76856-2_56

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-76855-5

  • Online ISBN: 978-3-540-76856-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics