An Active Contour Model without Edges

  • Tony Chan
  • Luminita Vese
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1682)


In this paper, we propose a new model for active contours to detect objects in a given image, based on techniques of curve evolution, Mumford-Shah functional for segmentation and level sets. Our model can detect objects whose boundaries are not necessarily defined by gra- dient. The model is a combination between more classical active contour models using mean curvature motion techniques, and the Mumford-Shah model for segmentation. We minimize an energy which can be seen as a particular case of the so-called minimal partition problem. In the level set formulation, the problem becomes a “mean-curvature flow”-like evolving the active contour, which will stop on the desired boundary. However, the stopping term does not depend on the gradient of the image, as in the classical active contour models, but is instead related to a particular segmentation of the image. Finally, we will present various experimental results and in particular some examples for which the classical snakes methods based on the gradient are not applicable.


Active Contour Active Contour Model Initial Curve Gradient Vector Flow Spatial Point Process 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Aubert, G., Vese, L.: A variational method in image recovery. SIAM J. Num. Anal. 34/5 (1997) 1948–1979.Google Scholar
  2. 2.
    Byers, S., Raftery, A.: Nearest-Neighbor Clutter Removal for Estimating Features in Spatial Point Processes. Journal of the American Statistical Association 93/442 (1998) 577–584.Google Scholar
  3. 3.
    Caselles, V., Catté, F., Coll, T., Dibos, F.: A geometric model for active contours in image processing. Numerische Mathematik 66 (1993) 1–31.Google Scholar
  4. 4.
    Caselles, V., Kimmel, R., Sapiro, G.: On geodesic active contours. Journal of Computer Vision 22(1) (1997) 61–79.Google Scholar
  5. 5.
    Dasgupta, A., Raftery, A.: Detecting Features in Spatial Point Processes With Clutter via Model-Based Clustering. Journal of the American Statistical Association 98/441 (1998) 294–302.Google Scholar
  6. 6.
    Kanizsa, G.: La Grammaire du Voir. Essais sur la perception. Diderot Editeur, Arts et Sciences (1997).Google Scholar
  7. 7.
    Kass, M., Witkin, A., Terzopoulos, D.: Snakes: Active contour models. International Journal of Computer Vision 1 (1988) 321–331.Google Scholar
  8. 8.
    Marquina, A., Osher, S.: Explicit Algorithms for a New Time Dependent Model Based on Level Set Motion for Nonlinear Deblurring and Noise Removal. UCLA CAM Report 99-55 (1999).Google Scholar
  9. 9.
    Malladi, R., Sethian, J.A., and Vemuri, B.C.: A Topology Independent Shape Modeling Scheme. Proc. SPIE Conf. on Geometric Methods in Computer Vision II, San Diego, 2031 (1993), 246–258.Google Scholar
  10. 10.
    Malladi, R., Sethian, J.A., and Vemuri, B.C.: Evolutionary Fronts for Topology-Independent Shape Modeling and Recovery. Proceedings of the Third European Conference on Computer Vision, LNCS 800 (1994), Stockholm, Sweden, 3–13.Google Scholar
  11. 11.
    Malladi, R., Sethian, J.A., Vemuri, B.C.: Shape Modeling with Front Propagation: A Level Set Approach. IEEE Transactions on Pattern Analysis and Machine Intelligence, 17, No. 2 (1995), 158–175.Google Scholar
  12. 12.
    Lee, M.S., Medioni, G: Inferred Descriptions in Terms of Curves, Regions and Junctions from Sparse, Noisy Binary Data. Proceedings of the IEEE International Symposium on Computer Vision, Coral Gable, Florida (1995), 73–78.Google Scholar
  13. 13.
    Mumford, D., Shah, J.: Optimal approximation by piecewise smooth functions and associated variational problems. Comm. Pure Appl. Math. 42 (1989) 577–685.Google Scholar
  14. 14.
    Osher, S., Sethian, J. A.: Fronts Propagating with Curvature-Dependent Speed: Algorithms Based on Hamilton-Jacobi Formulation. Journal of Computational Physics 79 (1988) 12–49.Google Scholar
  15. 15.
    Paragios, N., and Deriche, R.: Geodesic Active Regions for Texture Segmentation. INRIA Research Report 3440 (1998).Google Scholar
  16. 16.
    Paragios, N., and Deriche, R.: Geodesic Active Regions for Motion Estimation and Tracking. INRIA Research Report 3631 (1999).Google Scholar
  17. 17.
    Siddiqi, K., Lauzière, Y. B., Tannenbaum, A., and Zucker, S. W.: Area and Length Minimizing Flows for Shape Segmentation. IEEE Transactions on Image Processing (Special Issue) 7/3 (1998) 433–443.Google Scholar
  18. 18.
    Sussman, M., Smereka, P., Osher, S.: A Level Set Approach for Computing Solutions to Incompressible Two-Phase Flow. UCLA CAM Report 93-18 (1993).Google Scholar
  19. 19.
    Xu, C., Prince, J. L.: Snakes, Shapes and Gradient Vector Flow. IEEE Transactions on Image Processing (Special Issue) 7/3 (1998) 359–369.Google Scholar
  20. 20.
    Zhao, H. K., Chan, T., Merriman, B., Osher, S.: A Variational Level Set Approach to Multiphase Motion. Journal of Computational Physics 127 (1996) 179–195.Google Scholar
  21. 21.
    Zhao, H.-K., Osher, S., Merriman, B. and Kang, M.: Implicit, Nonparametric Shape Reconstruction from Unorganized Points Using A Variational Level Set Method. UCLA CAM Report 98-7 (1998) (revised February 1999).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Tony Chan
    • 1
  • Luminita Vese
    • 1
  1. 1.Department of MathematicsUniversity of California, Los AngelesLos Angeles

Personalised recommendations