The effectiveness of cost based subtree caching mechanisms in typed genetic programming for image segmentation

  • Authors:
  • Mark E. Roberts

  • Affiliations:
  • School of Computer Science, University of Birmingham, UK

  • Venue:
  • EvoWorkshops'03 Proceedings of the 2003 international conference on Applications of evolutionary computing
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

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.