Skip to main content
SpringerLink
Log in

The Effectiveness of Cost Based Subtree Caching Mechanisms in Typed Genetic Programming for Image Segmentation

  • Conference paper
  • First Online:
Book cover Applications of Evolutionary Computing (EvoWorkshops 2003)

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

Included in the following conference series:

Abstract

Genetic programming (GP) has long been known as a computationally expensive optimisation technique. When evolving imaging operations, the processing time increases dramatically. This work describes a system using a caching mechanism which reduces the number of evaluations needed by up to 66 percent, counteracting the effects of increasing tree size. This results in a decrease in elapsed time of up to 52 percent. A cost threshold is introduced which can guarantee a speed increase. This caching technique allows GP to be feasibly applied to problems in computer vision and image processing. The trade-offs involved in caching are analysed, and the use of the technique on a previously time consuming medical segmentation problem is shown.

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

Access this chapter

Log in via an institution
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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Tackett, W.A.: Genetic programming for feature discovery and image discrimination. In: Proceedings of the 5th International Conference on Genetic Algorithms, ICGA-93, Morgan Kaufmann (1994) 303–309

    Google Scholar 

  2. Johnson, M., Maes, P., Darrel, T.: Evolving visual routines. In: Proceedings of the Fourth International Workshop on the Synthesis and Simulation of Living Things, MIT Press (1994) 198–209

    Google Scholar 

  3. Ross, B.J., Fueten, F., Yashkir, D.Y.: Edge detection of petrographic images using genetic programming. In Whitley, D., Goldberg, D., Cantu-Paz, E., Spector, L., Parmee, I., Beyer, H.G., eds.: Proceedings of the Genetic and Evolutionary Computation Conference, San Francisco, USA, Morgan Kaufmann (2000) 658–665

    Google Scholar 

  4. Agnelli, D., Bollini, A., Lombardi, L.: Image classiffication: an evolutionary approach. Pattern Recognition Letters 23 (2002) 303–309

    Article  MATH  Google Scholar 

  5. Roberts, S.C., Howard, D.: Genetic programming for image analysis: Orientation detection. In Whitley, D., Goldberg, D., Cantu-Paz, E., Spector, L., Parmee, I., Beyer, H.G., eds.: Proceedings of the Genetic and Evolutionary Computation Conference, San Francisco, USA, Morgan Kaufmann (2000) 651–657

    Google Scholar 

  6. Poli, R.: Genetic programming for feature detection and image segmentation. In Fogarty, T., ed.: Proceedings of the AISB’96 Workshop on Evolutionary Computation. Volume 1143 of Lecture Notes in Computer Science., Springer (1996) 110–125

    Google Scholar 

  7. Belpaeme, T.: Evolution of visual feature detectors. In Poli, R., Cagnoni, S., Voigt, H.M., Fogarty, T., Nordin, P., eds.: Late Breaking Papers at EvoIASP’99, University of Birmingham Technical Report CSRP-99-10 (1999)

    Google Scholar 

  8. Handley, S.: On the use of a directed acyclic graph to represent a population of computer programs. In: Proceedings of the 1994 IEEE World Congress on Computational Intelligence, Orlando, Florida, USA, IEEE Press (1994) 154–159

    Google Scholar 

  9. Ehrenburg, H.: Improved direct acyclic graph handling and the combine operator in genetic programming. In Koza, J.R., Goldberg, D.E., Fogel, D.B., Riolo, R.L., eds.: Genetic Programming 1996: Proceedings of the First Annual Conference, Stanford University, CA, USA, MIT Press (1996) 285–291

    Google Scholar 

  10. Langdon, W.B.: Pareto, population partitioning, price and genetic programming. Research Note RN/95/29, University College London, UK (1995)

    Google Scholar 

  11. Montana, D.J.: Strongly typed genetic programming. Evolutionary Computation 3 (1995) 199–230

    Article  Google Scholar 

  12. Koza, J.R.: Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press (1992)

    Google Scholar 

  13. Ganster, H., Pinz, A., Rohrer, R., Wildling, E., Binder, M., Kittler, H.: Automated melanoma recognition. IEEE Transactions on Medical Imaging 20 (2001) 233–239

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer Science, University of Birmingham, B15 2TT, UK

    Mark E. Roberts

Authors
  1. Mark E. Roberts
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dept. of Computer Engineering, University of Parma, Parco Area delle Scienze 181/a, 43100, Parma, Italy

    Stefano Cagnoni

  2. Computing Laboratory, University of Kent, Canterbury, Kent, CT2 7NF, UK

    Colin G. Johnson

  3. Dept. of Information and Communications Technologies Faculty of Computer Science, University of A Coruña, A Coruña, CP 15071, Spain

    Juan J. Romero Cardalda

  4. Dept. of Mathematics and Computer Science, Free University of Amsterdam, de Boelelaan 1081a, 1081 HV, Amsterdam, The Netherlands

    Elena Marchiori

  5. Schol of Systems Engineering, University of Reading, PO Box 225, Whiteknights, Reading, RG6 6AY, UK

    David W. Corne

  6. AnimatLab, 8 rue du capitaine Scott, 75015, Paris, France

    Jean-Arcady Meyer  & Agnès Guillot  & 

  7. SAP AG, Neurottstrasse 16, 69190, Walldorf, Germany

    Jens Gottlieb

  8. Parallel Computing and Complex Systems Group, University of Leipzig, Augustusplatz 10/11, 04109, Leipzig, Germany

    Martin Middendorf

  9. Algorithms and Data Structures Group Institute of Computer Graphics, Vienna University of Technology, Favoritenstrasse 9-11/186, 1040, Vienna, Austria

    Günther R. Raidl

  10. School of Computing, Napier University, 219 Colinton Road, Edinburgh, EH14 1DJ, UK

    Emma Hart

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Roberts, M.E. (2003). The Effectiveness of Cost Based Subtree Caching Mechanisms in Typed Genetic Programming for Image Segmentation. In: Cagnoni, S., et al. Applications of Evolutionary Computing. EvoWorkshops 2003. Lecture Notes in Computer Science, vol 2611. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36605-9_41

Download citation

  • DOI: https://doi.org/10.1007/3-540-36605-9_41

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-00976-4

  • Online ISBN: 978-3-540-36605-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation