Deformable Model with Non-euclidean Metrics
Deformable models like snakes are a classical tool for image segmentation. Highly deformable models extend them with the ability to handle dynamic topological changes, and therefore to extract arbitrary complex shapes. However, the resolution of these models largely depends on the resolution of the image. As a consequence, their time and memory complexity increases at least as fast as the size of input data. In this paper we extend an existing highly deformable model, so that it is able to locally adapt its resolution with respect to its position. With this property, a significant precision is achieved in the interesting parts of the image, while a coarse resolution is maintained elsewhere. The general idea is to replace the Euclidean metric of the image space by a deformed non-Euclidean metric, which geometrically expands areas of interest. With this approach, we obtain a new model that follows the robust framework of classical deformable models, while offering a significant independence from both the size of input data and the geometric complexity of image components.
Keywordsimage segmentation deformable model non-Euclidean geometry topology adaptation optimization
Unable to display preview. Download preview PDF.
- 1.V. Caselles, R. Kimmel, and G. Sapiro. Geodesic active contours. In ICCV95, pages 694–699, 1995.Google Scholar
- 2.L. D. Cohen. On active contour models and balloons. CVGIP: Image Understanding, 53(2):211–218, March 1991.Google Scholar
- 3.H. Delingette. General object reconstruction based on simplex meshes. Research Report 3111, INRIA, Sophia Antipolis, France, February 1997.Google Scholar
- 4.H. Delingette and J. Montagnat. New algorithms for controlling active contours shape and topology. In D. Vernon, editor, European Conference on Computer Vision (ECCV’2000), number 1843 in LNCS, pages 381–395, Dublin, Ireland, June 2000. Springer.Google Scholar
- 7.J.-O. Lachaud and A. Vialard. Discrete deformable boundaries for the segmentation of multidimensional images. In C. Arcelli, L. P. Cordella, and G. Sanniti di Baja, editors, Proc. 4th Int. Workshop on Visual Form (IWVF4), Capri, Italy, volume 2059 of Lecture Notes in Computer Science, pages 542–551. Springer-Verlag, Berlin, 2001.Google Scholar
- 8.R. Malladi, J. A. Sethian, and B. C. Vemuri. Shape Modelling with Front Propagation: A Level Set Approach. IEEE Trans. on Pattern Analysis and Machine Intelligence, 17(2):158–174, February 1995.Google Scholar
- 9.T. McInerney and D. Terzopoulos. Medical Image Segmentation Using Topologically Adaptable Snakes. In Proc. of Computer Vision, Virtual Reality and Robotics in Medicine, pages 92–101, Nice, France, 1995. Springer-Verlag.Google Scholar
- 11.J.A. Sethian. Level Set Methods, volume 3 of Cambridge Monographs on Applied and Computational Mathematics. Cambridge University Press, 1996.Google Scholar
- 12.J. Strain. Tree methods for moving interfaces. Journal of Computational Physics, 15(2):616–648, May 1999.Google Scholar
- 13.C. Xu and J. L. Prince. Snakes, shapes, and gradient vector flow. IEEE Trans. on Image Processing, 7(3):359–369, March 1998.Google Scholar