Volume Cutting of Medical Data Using Deformable Surfaces Modeled with Level Sets

Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 340)


With the advancement of digital imaging technology in the medical domain an increased amount of sampled biological data is being generated. Clipping of volume data has become more and more important because it allows us to cut away selected parts of the volume and plays a crucial part in medical image understanding, computer assisted diagnosis and surgery simulations. We propose a method for volume cutting using deformable surfaces modeled with level sets. Using Boolean operations the method is extended to multi-object clipping. The overall computational cost is reduced by using a fast and computationally efficient narrow band level set algorithm. The proposed model has been used to extract arbitrary shapes from scanned volume data including some low contrast medical data with promising results.


Level sets Deformable surfaces Volume cutting Narrow band 


  1. 1.
    Lorensen, E., Cline, H.: Marching cubes: a high resolution 3D surface construction algorithm. Proceedings of the SIGGRAPH87, pp. 163–169 (1987)Google Scholar
  2. 2.
    Gibson S.F.F.: Using distance maps for accurate surface reconstruction in sampled volumes. In: Volume Visualization Symposium ‘1998, pp. 23–30. IEEE (1998)Google Scholar
  3. 3.
    Ju, T., Losasso, F., Schaefer, S., Warren, J.: Dual contouring of hermite data. In: Proceedings of the SIGGRAPH’2002 (2002)Google Scholar
  4. 4.
    Kachouie, N.N., Fieguth P.: A narrow band level set method with dynamic velocity for neural stem cell cluster segmentation, image analysis and recognition. Lecture Notes in Computer Science, vol. 3656, pp. 1006–1013. (2005)Google Scholar
  5. 5.
    Rosenthal, P., Molchanov, V., Linsen, L.: A narrow band level set method for surface extraction from unstructured point-based volume data. In: Proceedings of WSCG, The 18th International Conference on Computer Graphics, Visualization and Computer Vision, UNION Agency, pp. 73–80. Science Press, Plzen (2010)Google Scholar
  6. 6.
    Rosenthal, P., Linsen, L.: Smooth surface extraction from unstructured point-based volume data using PDEs. IEEE Trans. Visual Comput. Graph. 14(6), 1531–1546 (2008)CrossRefGoogle Scholar
  7. 7.
    Museth, K.: An efficient level set toolkit for visual effects In: SIGGRAPH’09: SIGGRAPH (2009) Talks, pp. 1–1. ACM, New York (2009)Google Scholar
  8. 8.
    Nielsen, M.B., Museth, K.: Dynamic tubular grid: an efficient data structure and algorithms for high resolution level sets. J. Sci. Comput. 26(3), 261–299 (2006)MathSciNetCrossRefMATHGoogle Scholar
  9. 9.
    Bindu, V.R., Ramachandran, Nair, K.N.: A fast narrow band level set formulation for shape extraction. In: Proceedings of Fifth International Conference on the Applications of Digital Information and Web Technologies (ICADIWT 2014), pp. 141–146. IEEE (2014)Google Scholar
  10. 10.
    Osher, S., Sethian, J.A.: Fronts propagating with curvature-dependent speed: algorithms based on Hamilton-Jacobi formulations. J. Comp. Phys. 79, 12–49 (1988)MathSciNetCrossRefMATHGoogle Scholar
  11. 11.
    Caselles, V., Catte, F., Coll, T., Dibos, F.: A geometric model for active contours in image processing. Numer. Math. 66, 1–31 (1993)MathSciNetCrossRefMATHGoogle Scholar
  12. 12.
    Malladi, R., Sethian, J.A., Vemuri, B.C.: Shape modeling with front propagation: a level set approach. IEEE Trans. Patt. Anal. Mach. Intell. 17, 158–175 (1995)CrossRefGoogle Scholar
  13. 13.
    Sethian, J.A.: Level Set Methods and Fast Marching Methods. Cambridge University Press, Cambridge (1999)MATHGoogle Scholar
  14. 14.
    Agoston, M.K.: Computer Graphics and Geometric Modeling. Springer, London (2005)MATHGoogle Scholar

Copyright information

© Springer India 2015

Authors and Affiliations

  1. 1.School of Computer Sciences, Mahatma Gandhi University KottayamKottayamIndia
  2. 2.Department of Computer Science and EngineeringViswajyothi College of EngineeringMuvattupuzhaIndia

Personalised recommendations