Skip to main content
Log in

Stochastic Motion and the Level Set Method in Computer Vision: Stochastic Active Contours

  • Published:
International Journal of Computer Vision Aims and scope Submit manuscript

Abstract

Based on recent work on Stochastic Partial Differential Equations (SPDEs), this paper presents a simple and well-founded method to implement the stochastic evolution of a curve. First, we explain why great care should be taken when considering such an evolution in a Level Set framework. To guarantee the well-posedness of the evolution and to make it independent of the implicit representation of the initial curve, a Stratonovich differential has to be introduced. To implement this differential, a standard Ito plus drift approximation is proposed to turn an implicit scheme into an explicit one. Subsequently, we consider shape optimization techniques, which are a common framework to address various applications in Computer Vision, like segmentation, tracking, stereo vision etc. The objective of our approach is to improve these methods through the introduction of stochastic motion principles. The extension we propose can deal with local minima and with complex cases where the gradient of the objective function with respect to the shape is impossible to derive exactly. Finally, as an application, we focus on image segmentation methods, leading to what we call Stochastic Active Contours.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Ballerini, L. 1999. Genetic snakes for image segmentation. In Evolutionary Image Analysis, Signal Processing and Telecommunication, vol. 1596 of Lecture Notes in Computer Science, Springer, pp. 59–73.

  • Ben-Arous, G., Tannenbaum, A., and Zeitouni, O. 2002. Stochastic Approximations to Curve Shortening Flows via Particle Systems. Technical report, Technion Institute.

  • Bezdek, J.C. 1981. Pattern Recognition with Fuzzy Objective Function Algorithms, Kluwer Academic Publishers.

  • Buckdahn, R. and Ma, J. 2001. Stochastic viscosity solutions for nonlinear stochastic partial differential equations. Stochastic Processes and their Applications, 93:181–228.

    Article  MathSciNet  Google Scholar 

  • Cances, E., Keriven, R., Lodier, F., and Savin, A. 2004. How electrons guard the space: Shape optimization with proba bility distribution criteria. Theoret. Chem. Acc.

  • Caselles, V., Kimmel, R., and Sapiro, G. 1997. Geodesic Active Contours. The International Journal of Computer Vision, 22(1): 61–79.

    Article  Google Scholar 

  • deGruijter, J. and McBratney, A. 1988. A modified fuzzy k means for predictive classification. In Bock, H.H.(ed), Classification and Related Methods of Data Analysis, Elsevier Science, Amsterdam., pp. 97–104.

    Google Scholar 

  • Dempster, A.P., Laird, N.M., and Rubin, D.B. 1977. Maximum likelihood from incomplete data via the EM algorithm. Journal of the Royal Statistical Society, 39:1–38.

    MathSciNet  Google Scholar 

  • Faugeras, O. and Keriven, R. 1998. Variational principles, Surface Evolution, PDE’s, level set methods and the Stereo Problem. IEEE Transactions on Image Processing, 7(3):336–344.

    Article  MathSciNet  Google Scholar 

  • Gard, T. 1988. Introduction to Stochastic Differential Equations. Marcel Dekker, New York and Basel.

    Google Scholar 

  • Jiang, G.S. and Peng, D. 2000. Weighted ENO schemes for Hamilton-Jacobi equations. SIAM Journal of Scientific Computing, 21(6):2126–2143.

    Article  MathSciNet  Google Scholar 

  • Juan, O., Keriven, R., and Postelnicu, G. 2004. Stochastic Motion and the Level Set Method in Computer Vision: Stochastic Active Contours. Technical Report 04-01, CERTIS.

  • Karatzas, I. and Shreve, S. 1991. Brownian Motion and Stochastic Calculus, Springer-Verlag, New York.

    Google Scholar 

  • Katsoulakis, M. and Kho, A. 2001. Stochastic Curvature Flows: Asymptotic Derivation, Level Set Formulation and Numerical Experiments. Journal of Interfaces and Free Boundaries, 3:265–290.

    MathSciNet  Google Scholar 

  • Kirkpatrick, S., Gelatt, C.J., and Vecchi, M. 1983. Optimization by Simulated Annealing. Science, 220(4598).

    MathSciNet  Google Scholar 

  • Kunita, H. 1990. Stochastic Flows and Stochastic Differential Equations, Cambridge University Press.

  • Lions, P. and Souganidis, P. 1998a. Fully nonlinear stochastic partial differential equations. C.R. Acad. Sci. Paris Ser. I Math, 326:1085–1092.

    MathSciNet  Google Scholar 

  • Lions, P. and Souganidis, P. 1998b. Fully nonlinear stochastic partial differential equations: Nonsmooth equations and applications. C.R. Acad. Sci. Paris Ser. I Math, 327:735–741.

    MathSciNet  Google Scholar 

  • Lions, P. and Souganidis, P. 1999. Equations aux derivees partielles stochastiques non lineaires et solutions de viscosite. Seminaire X-EDP (Unpublished Lecture).

  • Lions, P. and Souganidis, P. 2000a. Fully nonlinear stochastic partial differential equations with semilinear stochastic dependence. C.R. Acad. Sci. Paris Ser. I Math, 331:617–624.

    MathSciNet  Google Scholar 

  • Lions, P. and Souganidis, P. 2000b. Uniqueness of weak solutions of fully nonlinear stochastic partial differential equations. C.R. Acad. Sci. Paris Ser. I Math, 331:783–790.

    MathSciNet  Google Scholar 

  • MacQueen, J. 1967. Some methods for classification and analysis of multivariate. In Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability, pp. 281–297.

  • McLachlan, G. and David, P. 2000. Finite Mixture Models, Wiley, New York.

    Google Scholar 

  • McLachlan, G. and Krishnan, T. 1997. The EM Algorithm and Extensions, Wiley, New York.

    Google Scholar 

  • Metropolis, N., Rosenbluth, A., Rosenbluth, M., Teller, A., and T.E. 1953. Equation of State Calculations by Fast Computing Machines. J. Chem. Phys., 21(6):1087–1092.

    Article  Google Scholar 

  • Osher, S. and Sethian, J. 1988. Fronts propagating with curvature dependent speed: Algorithms based on the Hamilton-Jacobi formulation. Journal of Computational Physics, 79:12–49.

    Article  MathSciNet  Google Scholar 

  • Paragios, N. and Deriche, R. 2002. Geodesic Active Regions and Level Set Methods for Supervised Texture Segmentation. The International Journal of Computer Vision, 46(3):223.

    Article  Google Scholar 

  • Rissanen, J. 1989. Stochastic Complexity in Statistical Inquiry, World Scientific Publishing Company.

  • Rousson, M. and Deriche, R. 2002. A Variational Framework for Active and Adaptative Segmentation of Vector Valued Images. In Proc. IEEE Workshop on Motion and Video Computing, Orlando, Florida, pp. 56–62.

  • Storvik, G. 1994. A Bayesian Approach to Dynamic Contours through Stochastic sampling and Simulated Annealing. IEEE Trans. Pattern Analysis and Machine Intelligence, 16(10):976–986.

    Article  Google Scholar 

  • Ueda, N., Nakano, R., Ghahramani, Z., and Hinton, G.E. 2000. SMEM Algorithm for Mixture Models. Neural Computation, 12(9):2109–2128.

    Article  Google Scholar 

  • Unal, G., Krim, H., and Yezzi, A. 2002. Stochastic Differential Equations and Geometric Flows. IEEE Transactions in Image Processing, 11(12):1405–1416.

    Article  MathSciNet  Google Scholar 

  • Unal, G., Nain, D., Ben-Arous, G., Shimkin, N., Tannenbaum, A., and Zeitouni, O. 2003. Algorithms for Stochastic Approximations of Curvature Flows. In IEEE International Conference on Image Processing.

  • Vese, L. and Chan, T. 2002. A Multiphase Level Set Framework for Image Segmentation Using the Mumford and Shah Model. International Journal of Computer Vision, 50(3):271–293.

    Article  Google Scholar 

  • Wallace, C. and Boulton, D. 1968. An information measure for classification. Computer Journal, 11(2):185–194.

    Google Scholar 

  • Walsh, J. 1994. An introduction to stochastic partial differential equations. In Ecole d’Été de Probabilités de Saint-Flour, vol. XIV-1180 of Lecture Notes in Math. Springer.

  • Yip, N. 1998. Stochastic Motion by Mean Curvature. Arch. Rational Mech. Anal., 144:331–355.

    Article  MathSciNet  Google Scholar 

  • Yip, N. 2002. Stochastic Curvature Driven Flows. In G. Da Prato and L. Tubaro (eds.), Stochastic Partial Differential Equations and Applications, vol. 227 of Lecture Notes in Pure and Applied Mathematics. Springer, pp. 443–460.

  • Yip, N. and Souganidis, P. 2004. Uniqueness of motion by mean curvature perturbed by stochastic noise. Annales de l’Institut Henri Poincare - analyse non lineaire, (21):1–23.

    MathSciNet  Google Scholar 

  • Zhang, B. and Hsu, M. 1999. K-Harmonic Means—A Data Clustering Algorithm.

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Renaud Keriven.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Juan, O., Keriven, R. & Postelnicu, G. Stochastic Motion and the Level Set Method in Computer Vision: Stochastic Active Contours. Int J Comput Vision 69, 7–25 (2006). https://doi.org/10.1007/s11263-006-6849-5

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11263-006-6849-5

Keywords

Navigation