Skip to main content
Springer Nature Link
Log in

Fast Surface Segmentation Guided by User Input Using Implicit Extension of Minimal Paths

  • Published:
Journal of Mathematical Imaging and Vision Aims and scope Submit manuscript

Abstract

We introduce a novel implicit approach for single object segmentation in 3D images. The boundary surface of this object is assumed to contain two or more known curves (the constraining curves), given by an expert. The aim of our method is to find the desired surface by exploiting the information given in the supplied curves as much as possible. We use a cost potential which penalizes image regions of low interest (for example areas of low gradient). In order to avoid local minima, we introduce a new partial differential equation and use its solution for segmentation. We show that the zero level set of this solution contains the constraining curves as well as a set of paths joining them. These paths globally minimize an energy which is defined from the cost potential. Our approach, although conceptually different, can be seen as an implicit extension to 3D of the minimal path framework already known for 2D image segmentation. As for this previous approach, and unlike other variational methods, our method is not prone to local minima traps of the energy. We present a fast implementation which has been successfully applied to 3D medical and synthetic images.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
€32.70 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (France)

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. D. Adalsteinsson and J.A. Sethian, “The fast construction of extension velocities in level set methods,” Journal of Computational Physics, vol. 148, pp. 2–22, 1999.

    Article  MATH  MathSciNet  Google Scholar 

  2. L. Ambrosio, “Transport equation and Cauchy problem for BV vector fields,” Preprints Scuola Normale Superiore, Department of Mathematics: http://cvgmt.sns.it/people/ambrosio/, 2003.

  3. R. Ardon and L.D. Cohen, “Fast constrained surface extraction by minimal paths,” 2nd IEEE Workshop on Variational, Geometric and Level Set Methods in Computer Vision, 2003 pp. 233–244,

  4. R. Ardon and L.D. Cohen, “Fast constrained surface extraction by minimal paths,” To appear in International Journal of Computer Vision, 2006.

  5. F. Bouchut, F. James, and S. Mancini, “Uniqueness and weak stability for multi-dimensional transport equations with one-sided lipschitz coefficient,” Prépublications du département Mathématiques et Applications, Physique Mathématique d’Orléans, 2004.

  6. A.M. Bruckstein, “On shape from shading,” Computer Vision, Graphics and Image Processing, vol. 44, no. (2), pp. 139–154, November 1988.

    Article  Google Scholar 

  7. V. Caselles, R. Kimmel, and G. Sapiro, “Geodesic active contours,” International Journal of Computer Vision, vol. 22, no. 1, pp. 61–79, 1997.

    Article  MATH  Google Scholar 

  8. V. Caselles, R. Kimmel, G. Sapiro, and C. Sbert, “Minimal-surfaces based object segmentation,” IEEE Transactions On Pattern Analysis and Machine Intelligence, vol. 19, no. 4, pp. 394–398, 1997.

    Article  MathSciNet  Google Scholar 

  9. L.D. Cohen, “On active contour models and balloons,” CVGIP, vol. 53, no. 2, pp. 211–218, 1991.

    Article  MATH  Google Scholar 

  10. L.D. Cohen, “Avoiding local minima for deformable curves in image analysis,” in Curves and Surfaces with Applications in CAGD, Nashville, Vanderbilt Univ. Press, 1997.

    Google Scholar 

  11. L.D. Cohen, “Multiple contour finding and perceptual grouping using minimal paths,” Journal of Mathematical Image Vision, vol. 14, no. 3, 2001.

  12. L.D Cohen and T. Deschamps, “Grouping connected components using minimal path techniques. application to reconstruction of vessels in 2D and 3D images,” in Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR’01), 2001.

  13. L.D. Cohen and R. Kimmel, “Global minimum for active contour models: A minimal path approach,” International Journal of Computer Vision, vol. 24, no. 1, pp. 57–78, 1997.

    Article  Google Scholar 

  14. W. P. Crowley, “Numerical advection experiments,” Monthly Weather Review, vol. 96, pp. 1–11, 1968.

    Google Scholar 

  15. T. Deschamps and L.D. Cohen, “Fast extraction of minimal paths in 3D images and applications to virtual endoscopy,” Medical Image Analysis, vol. 5, no. 4, 2001.

  16. O. Gerard, T. Deschamps, M. Greff, and L. D. Cohen, “Real-time interactive path extraction with on-the-fly adaptation of the external forces,” European Conference on Computer Vision, 2002.

  17. C.Y. Kao, S. Osher, and J. Qian, “Lax-Friedrichs sweeping scheme for static Hamilton-Jacobi equations,” Journal of Computational Physics, vol. 26, pp.367–391, 2004.

    Article  MathSciNet  Google Scholar 

  18. M. Kass, A. Witkin, and D. Terzopoulos, “Snakes: Active contour models,” International Journal of Computer Vision, vol. 1, no. 4, pp. 321–331, 1988.

    Article  Google Scholar 

  19. P. D. Lax and B. Wendorff, “Systems of conservation laws,” Communications on Pure and Applied mathematics, vol. 17, pp. 381–398, 1964.

    MATH  MathSciNet  Google Scholar 

  20. R. J. LeVeque, “High-resolution conservative algorithms for advection in incompressible flow,” SIAM Journal on Numerical Analysis, vol. 33, no. 2, pp. 627–665, 1996.

    Article  MATH  MathSciNet  Google Scholar 

  21. C. Mantegazza and A.C.G. Mennucci, “Hamilton-Jacobi equations and distance functions on Riemannian manifolds,” Appl. Math. Opt., vol. 47, no. 1, pp. 1–25, 2003.

    Article  MathSciNet  Google Scholar 

  22. S. Osher and J.A. Sethian, “Fronts propagating with curvature dependent speed: algorithms based on the hamilton-jacobi formulation,” Journal of Computational Physics, vol. 79, pp. 12–49, 1988.

    Article  MATH  MathSciNet  Google Scholar 

  23. N. Paragios, “Geodesic active regions and level set methods: contributions and applications in artificial vision,” Ph.D. thesis, Université de Nice Sophia-Antipolis, France, 2000.

  24. J.A. Sethian, “A fast marching level set method for monotonically advancing fronts,” Proceedings of the National Academy of Sciences, vol. 93, no. 4, pp. 1591–1595, 1996.

  25. P.K. Smolarkiewicz, “The multi-dimensional crowley advection scheme,” Monthly Weather Review, vol. 110, pp. 1968–1983, 1982.

    Article  Google Scholar 

  26. J.N. Tsitsiklis, “Efficient algorithms for globally optimal trajectories,” IEEE Transactions on Automatic Control, vol. 40, no. 9, pp. 1528–1538, 1995.

    Article  MATH  MathSciNet  Google Scholar 

  27. A. Yezzi, S. Kichenassamy, A. Kumar, P. Olver, and A. Tannenbaum, “A geometric snake model for segmentation of medical imagery,” IEEE Transactions On Medical Imaging, vol. 16, no. 2, pp. 199–209, 1997.

    Article  Google Scholar 

  28. A. Yezzi and J.L. Prince, “An Eulerian PDE approach for computing tissue thickness,” IEEE Transactions On Medical Imaging, vol. 22, pp. 1332–1339, 2003.

    Article  Google Scholar 

  29. A.L. Yuille, P.W. Hallinan, and D.S. Cohen, “Feature extraction from faces using deformable templates,” International Journal of Computer Vision, vol. 8, no. 2, pp. 99–111, 1992.

    Article  Google Scholar 

  30. S.C. Zhu and A. Yuille, “Region competition: Unifying snakes, region growing, and bayes/mdl for multiband image segmentation,” IEEE Transactions On Pattern Analysis and Machine Intelligence, vol. 18, no. 9, pp. 884–900, 1996.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. MEDISYS-Philips France, 51, rue Carnot, 92156, Suresnes, France

    Roberto Ardon

  2. CEREMADE, UMR CNRS 7534, Université Paris Dauphine, Place du Marchal de Lattre de Tassigny, 75775, Paris Cedex 16, France

    Roberto Ardon & Laurent D. Cohen

  3. Georgia Institute of Technology, Atlanta, GA, USA

    Anthony Yezzi

Authors
  1. Roberto Ardon
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Laurent D. Cohen
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Anthony Yezzi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Roberto Ardon.

Additional information

Roberto Ardon graduated from the Ecole Centrale Paris in 2001 with a major in applied mathematics, obtained his master degree in image processing from the Ecole Normale Supérieure de Cachan in the same year and his Ph.D. degree in applied mathematics from the University Paris-Dauphine in 2005. Currently he is a research scientist in Philips Medical Systems Research Paris. His research interests include calculus of variations mainlly focused on medical image processing.

Laurent D. Cohen was at Ecole Normale Superieure Ulm in Paris from 1981 to 1985. He received Master's and Ph.D. degrees in Applied Mathematics from Paris 6 in 1983 and 1986. From 1985 to 1987, he was member at the Computer Graphics and Image Processing group at Schlumberger Palo Alto Research, California and Schlumberger Montrouge Research, and remained consultant there for a few years afterwards. He began working with INRIA, France in 1988, mainly with the medical image understanding group Epidaure. Since 1990, he is Research Scholar (Charge then Directeur de Recherche) with CNRS in the Applied Mathematics and Image Processing group at CEREMADE, University Paris-Dauphine. His research interests and teaching at the university are applications of variational methods and Partial Differential Equations to Image Processing and Computer Vision, like deformable models, minimal paths, surface reconstruction, Image registration, Image segmentation and restoration. He obtained CS 2002 Prize for Image and Signal Processing. He has been member in program committees for boards for about 20 international conferences.

Anthony Yezzi obtained his Ph.D. in 1997 through the Department of Electrical Engineering at the University of Minnesota. After completing a postdoctoral research position in the Laboratory for Information and Decision Systems (LIDS) at Massacusetts Institute of Technology, he joined the faculty of the School of Electrical and Computer Engineering at Georgia Institute of Technology in 1999 where he currently holds the position of Associate Professor. Prof. Yezzi has also consulted for a number of medical imaging companies including GE, Picker, and VTI, and has been an IEEE member since 1999. His research lies primarily within the fields of image processing and computer vision. He has worked on a variety of problems including image denoising, edge-detection, segmentation and grouping, shape analysis, multi-frame stereo reconstruction, tracking, and registration. Some central themes of his research include curve and surface evolution theory, differential geometry, and partial differential equations.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ardon, R., Cohen, L.D. & Yezzi, A. Fast Surface Segmentation Guided by User Input Using Implicit Extension of Minimal Paths. J Math Imaging Vis 25, 289–305 (2006). https://doi.org/10.1007/s10851-006-9641-9

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10851-006-9641-9

Keywords

Search

Navigation