Skip to main content

Genetic Algorithm to Set Active Contour

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2756))

Abstract

Active contours, very popular in image segmentation, suffer from delicate adjustments of many parameters. We propose to carry out these adjustments using genetic algorithm. Here an active contour is implemented using a greedy algorithm. Within this framework, two approaches are presented. A supervised approach which delivers a global set of parameters. In this case the greedy algorithm is involved in the evaluation function of the genetic algorithm. The second approach is unsupervised. It determines a local set of parameters. The genetic algorithm computes a set of parameters which minimizes the energy at each point in the neighborhood of the current point in the greedy algorithm try to move.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bäck, T.: Optimal Mutation Rates in Genetic Search. In: Fifth International Conference in Genetic algorithm (ICGA 1993), San mateo, CA., USA, pp. 2–8 (1993)

    Google Scholar 

  2. Cohen, L.D.: On Active Contour Models and Balloons. Computer Vision, Graphics, and Image Processing: Image Understanding 53(2), 211–218 (1991)

    MATH  Google Scholar 

  3. Denzler, J., Niemann, H.: Evaluating the Performance of Active Contour Models for Real-time Object Tracking. In: Second Asian Conference on Computer Vision, Singapore, pp. II/341–II/345 (1995)

    Google Scholar 

  4. Kass, M., Witkin, A., Terzopoulos, D.: Snakes: Active Contour Models. In: Proceedings of the first International Conference on Computer Vision, June 1987, pp. 259–268 (1987)

    Google Scholar 

  5. Michalewicz, Z.: Genetic Algorithms + Data Structures = Evolution Programs, p. 252. Springer, Heidelberg (1992) ISBN 3-540-55387-8

    Google Scholar 

  6. Rousselle, J.-J., Vincent, N.: Design of Experiments To Set Active Contour. In: 6th International Conference on Quality Control by Artificial Vision, Gattlinburg, Tenessee, USA (2003)

    Google Scholar 

  7. Vincent, N., Rousselle, J.-J.: Determination of Optimal Coefficients in active contour method for contour extraction. In: Eleven International Colloquium on Numerical Analysis and Computer Sciences with Applications, Plodiv, Bulgaria, August 12-17, p. 79 (2002)

    Google Scholar 

  8. Williams, D.J., Shah, M.: A Fast Algorithm for Active Contours and Curvature Estimation. CVIGP Computer Vision Graphics Image Process: Image Understanding 55(1), 14–26 (1992)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Rousselle, JJ., Vincent, N., Verbeke, N. (2003). Genetic Algorithm to Set Active Contour. In: Petkov, N., Westenberg, M.A. (eds) Computer Analysis of Images and Patterns. CAIP 2003. Lecture Notes in Computer Science, vol 2756. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45179-2_43

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-45179-2_43

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40730-0

  • Online ISBN: 978-3-540-45179-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics