MMBIA 2004, CVAMIA 2004: Computer Vision and Mathematical Methods in Medical and Biomedical Image Analysis pp 205-217 | Cite as
Efficient Initialization for Constrained Active Surfaces, Applications in 3D Medical Images
Abstract
A novel method allowing simplified and efficient active surface initialization for 3D images segmentation is presented. Our method allows to initialize an active surface through simple objects like points and curves and ensures that the further evolution of the active object will not be trapped by unwanted local minima. Our approach is based on minimal paths that integrate the information coming from the user given curves and from the image volume. The minimal paths build a network representing a first approximation of the initialization surface. An interpolation method is then used to build a mesh or an implicit representation based on the information retrieved from the network of paths. From this initialization, an active surface converges quickly to the expected solution. Our paper describes a fast construction obtained by exploiting the Fast Marching algorithm. The algorithm has been successfully applied to synthetic images and 3D medical images.
Preview
Unable to display preview. Download preview PDF.
References
- 1.Ardon, R., Cohen, L.D.: Fast Constrained surface extracion by minimal paths. 2nd IEEE Workshop on Variational, Geometric and Level Set Methods in Computer Vision, pp. 233–244 (October 2003)Google Scholar
- 2.Caselles, V., Kimmel, R., Sapiro, G.: Geodesic active contours. International Journal of Computer Vision 22(1), 61–79 (1997)MATHCrossRefGoogle Scholar
- 3.Caselles, V., Kimmel, R., Sapiro, G., Sbert, C.: Minimal-surfaces based object segmentation. IEEE Transactions On Pattern Analysis and Machine Intelligence 19(4), 394–398 (1997)CrossRefMathSciNetGoogle Scholar
- 4.Cheng, L.T.: The Level Set Method Applied to Geometrically Based Motion. Materials Science, and Image Processing. PhD thesis, University of California, Los Angeles (2000) Google Scholar
- 5.Cohen, L.D.: On active contour models and balloons. Computer Vision, Graphics, and Image Processing: Image Understanding 53(2), 211–218 (1991)MATHGoogle Scholar
- 6.Cohen, L.D., Kimmel, R.: Global minimum for active contour models: A minimal path approach. International Journal of Computer Vision 24(1), 57–78 (1997)CrossRefGoogle Scholar
- 7.Kass, M., Witkin, A., Terzopoulos, D.: Snakes: Active contour models. International Journal of Computer Vision 1(4), 321–331 (1988)CrossRefGoogle Scholar
- 8.Kimmel, R., Sethian, J.A.: Optimal algorithm for shape from shading and path planning. Journal of Mathematical Imaging and Vision 14(3), 237–244 (2001)MATHCrossRefMathSciNetGoogle Scholar
- 9.Malladi, R., Sethian, J.A., Vemuri, B.C.: Shape modelling with front propagation: A level set approach. IEEE Transactions On Pattern Analysis and Machine Intelligence 17(2), 158–175 (1995)CrossRefGoogle Scholar
- 10.Osher, S., Sethian, J.A.: Fronts propagating with curvature dependent speed: algorithms based on the hamilton-jacobi formulation. Journal of Computational Physics 79, 12–49 (1988)MATHCrossRefMathSciNetGoogle Scholar
- 11.Paragios, N., Deriche, R.: A pde-based level-set approach for detection and tracking of moving objects. Technical Report 3173, ROBOTVIS Project, INRIA Sophia-Antipolis (May 1997) Google Scholar
- 12.Sethian, J.A.: A fast marching level set method for monotonically advancing fronts. Proceedings of the Natural Academy of Sciences 93(4), 1591–1595 (1996)MATHCrossRefMathSciNetGoogle Scholar
- 13.Sethian, J.A.: Level set methods: Evolving Interfaces in Geometry, Fluid Mechanics, Computer Vision and Materials Sciences, 2nd edn. Cambridge University Press, University of California, Berkeley (1999)Google Scholar
- 14.Tsitsiklis, J.N.: Efficient algorithms for globally optimal trajectories. IEEE Transactions on Automatic Control 40(9), 1528–1538 (1995)MATHCrossRefMathSciNetGoogle Scholar
- 15.Zhao, H., Osher, S., Fedkiw, R.: Fast surface reconstruction using the level set method. In: Worksohp on Variational and Level Set Methods In Computer Vision, July 2001, pp. 194–201 (2001)Google Scholar