Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Lorensen, E., Cline, H.: Marching cubes: a high resolution 3D surface construction algorithm. Proceedings of the SIGGRAPH87, pp. 163–169 (1987)
Gibson S.F.F.: Using distance maps for accurate surface reconstruction in sampled volumes. In: Volume Visualization Symposium ‘1998, pp. 23–30. IEEE (1998)
Ju, T., Losasso, F., Schaefer, S., Warren, J.: Dual contouring of hermite data. In: Proceedings of the SIGGRAPH’2002 (2002)
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)
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)
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)
Museth, K.: An efficient level set toolkit for visual effects In: SIGGRAPH’09: SIGGRAPH (2009) Talks, pp. 1–1. ACM, New York (2009)
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)
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)
Osher, S., Sethian, J.A.: Fronts propagating with curvature-dependent speed: algorithms based on Hamilton-Jacobi formulations. J. Comp. Phys. 79, 12–49 (1988)
Caselles, V., Catte, F., Coll, T., Dibos, F.: A geometric model for active contours in image processing. Numer. Math. 66, 1–31 (1993)
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)
Sethian, J.A.: Level Set Methods and Fast Marching Methods. Cambridge University Press, Cambridge (1999)
Agoston, M.K.: Computer Graphics and Geometric Modeling. Springer, London (2005)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer India
About this paper
Cite this paper
Bindu, V.R., Nair, K.N.R. (2015). Volume Cutting of Medical Data Using Deformable Surfaces Modeled with Level Sets. In: Mandal, J., Satapathy, S., Kumar Sanyal, M., Sarkar, P., Mukhopadhyay, A. (eds) Information Systems Design and Intelligent Applications. Advances in Intelligent Systems and Computing, vol 340. Springer, New Delhi. https://doi.org/10.1007/978-81-322-2247-7_73
Download citation
DOI: https://doi.org/10.1007/978-81-322-2247-7_73
Published:
Publisher Name: Springer, New Delhi
Print ISBN: 978-81-322-2246-0
Online ISBN: 978-81-322-2247-7
eBook Packages: EngineeringEngineering (R0)