Evolutionary Art with Multiple Expression Programming By Quentin Freeman.

Slides:



Advertisements
Similar presentations
Department of Electronic Engineering NUIG Direct Evolution of Patterns using Genetic Algorithms By: John Brennan Supervisor: John Maher.
Advertisements

CS6800 Advanced Theory of Computation
1 An Adaptive GA for Multi Objective Flexible Manufacturing Systems A. Younes, H. Ghenniwa, S. Areibi uoguelph.ca.
Inpainting Assigment – Tips and Hints Outline how to design a good test plan selection of dimensions to test along selection of values for each dimension.
Tetris – Genetic Algorithm Presented by, Jeethan & Jun.
Genetic Algorithms By: Anna Scheuler and Aaron Smittle.
Genetic Algorithms for Real Parameter Optimization Written by Alden H. Wright Department of Computer Science University of Montana Presented by Tony Morelli.
CSI5112 Software Engineering Team: Andrei Anisenia Margi Fumtiwala.
Biologically Inspired AI (mostly GAs). Some Examples of Biologically Inspired Computation Neural networks Evolutionary computation (e.g., genetic algorithms)
Genetic Algorithms Representation of Candidate Solutions GAs on primarily two types of representations: –Binary-Coded –Real-Coded Binary-Coded GAs must.
EvoNet Flying Circus Introduction to Evolutionary Computation Brought to you by (insert your name) The EvoNet Training Committee The EvoNet Flying Circus.
Dynamic Layout Optimization for Newspaper Web Sites using a Controlled Annealed Genetic Algorithm Gjermund Brabrand H06MMT.
A new crossover technique in Genetic Programming Janet Clegg Intelligent Systems Group Electronics Department.
Using a GA to Create Prey Tactics Presented by Tony Morelli on 11/29/04.
Evolutionary Computing and the Traveling Salesman
Genetic Art. Network Record Using Network Information Chicago Evanston ParisMoscow.
1 Powerset Viewer: A Datamining Application Jordan Lee.
Evolutionary Computation Application Peter Andras peter.andras/lectures.
Optimizing a Chess Heuristic Using Evolutionary Algorithms Benjamin Rhew
Genetic Programming.
LOUKAS GEORGIOU and WILLIAM J. TEAHAN Artificial Intelligence and Intelligent Agents Research Group School of Computer Science, Bangor University, U.K.
Prepared by Barış GÖKÇE 1.  Search Methods  Evolutionary Algorithms (EA)  Characteristics of EAs  Genetic Programming (GP)  Evolutionary Programming.
Evolutionary algorithms
Genetic Algorithm.
Computer Implementation of Genetic Algorithm
Genetic Algorithms Genetic algorithms imitate natural optimization process, natural selection in evolution. Developed by John Holland at the University.
Soft Computing Lecture 18 Foundations of genetic algorithms (GA). Using of GA.
Zorica Stanimirović Faculty of Mathematics, University of Belgrade
Design of a real time strategy game with a genetic AI By Bharat Ponnaluri.
What is Genetic Programming? Genetic programming is a model of programming which uses the ideas (and some of the terminology) of biological evolution to.
A Genetic Solution to the Travelling Salesman Problem Ryan Honig.
Genetic Algorithms Genetic algorithms imitate a natural optimization process: natural selection in evolution. Developed by John Holland at the University.
Introduction to Evolutionary Algorithms Session 4 Jim Smith University of the West of England, UK May/June 2012.
G ENETIC A LGORITHMS Steve Foster. I NTRODUCTION Genetic Algorithms are based on the principals of evolutionary biology in order to find solutions to.
An Introduction to Genetic Algorithms Lecture 2 November, 2010 Ivan Garibay
FINAL EXAM SCHEDULER (FES) Department of Computer Engineering Faculty of Engineering & Architecture Yeditepe University By Ersan ERSOY (Engineering Project)
EE459 I ntroduction to Artificial I ntelligence Genetic Algorithms Kasin Prakobwaitayakit Department of Electrical Engineering Chiangmai University.
Introduction to Genetic Algorithms. Genetic Algorithms We’ve covered enough material that we can write programs that use genetic algorithms! –More advanced.
 Genetic Algorithms  A class of evolutionary algorithms  Efficiently solves optimization tasks  Potential Applications in many fields  Challenges.
Genetic Algorithms What is a GA Terms and definitions Basic algorithm.
ECE 103 Engineering Programming Chapter 52 Generic Algorithm Herbert G. Mayer, PSU CS Status 6/4/2014 Initial content copied verbatim from ECE 103 material.
Evolutionary Art (What we did on our holidays) David Broadhurst Dan Costelloe Lynne Jones Pantelis Nasikas Joanne Walker.
Routing and Scheduling in Multistage Networks using Genetic Algorithms Advisor: Dr. Yi Pan Chunyan Ji 3/26/01.
Coevolutionary Automated Software Correction Josh Wilkerson PhD Candidate in Computer Science Missouri S&T.
D Nagesh Kumar, IIScOptimization Methods: M8L5 1 Advanced Topics in Optimization Evolutionary Algorithms for Optimization and Search.
1 Circuitscape Capstone Presentation Team Circuitscape Katie Rankin Mike Schulte Carl Reniker Sean Collins.
(Genetic Algorithm Interface Architecture) Final Presentation CS 425 Created By: Chuck Hall Simone Connors Héctor Aybar Mike Grim.
Design of a real time strategy game with a genetic AI By Bharat Ponnaluri.
An Introduction to Genetic Algorithms Lecture 2 November, 2010 Ivan Garibay
Alice. Terms test 6:30pm Tuesday 8th April, 2003 MLT1 A - J PLT1 K - S PLT2 T - Z.
Genetic Algorithm Dr. Md. Al-amin Bhuiyan Professor, Dept. of CSE Jahangirnagar University.
ARRAYS IN C/C++ (1-Dimensional & 2-Dimensional) Introduction 1-D 2-D Applications Operations Limitations Conclusion Bibliography.
Artificial Intelligence By Mr. Ejaz CIIT Sahiwal Evolutionary Computation.
Overview Last two weeks we looked at evolutionary algorithms.
EVOLUTIONARY SYSTEMS AND GENETIC ALGORITHMS NAME: AKSHITKUMAR PATEL STUDENT ID: GRAD POSITION PAPER.
Genetic Algorithms An Evolutionary Approach to Problem Solving.
Estimation of Distribution Algorithm and Genetic Programming Structure Complexity Lab,Seoul National University KIM KANGIL.
Genetic Algorithm(GA)
Genetic Algorithm. Outline Motivation Genetic algorithms An illustrative example Hypothesis space search.
Genetic Algorithms and Evolutionary Programming A Brief Overview.
Hirophysics.com The Genetic Algorithm vs. Simulated Annealing Charles Barnes PHY 327.
Genetic (Evolutionary) Algorithms CEE 6410 David Rosenberg “Natural Selection or the Survival of the Fittest.” -- Charles Darwin.
Design of a real time strategy game with a genetic AI By Bharat Ponnaluri.
Using GA’s to Solve Problems
Selected Topics in CI I Genetic Programming Dr. Widodo Budiharto 2014.
Evolution strategies and genetic programming
Prof. Marie desJardins September 20, 2010
EE368 Soft Computing Genetic Algorithms.
Genetic algorithms: case study
Presentation transcript:

Evolutionary Art with Multiple Expression Programming By Quentin Freeman

System Overview Goal –To visualize images in real time as they evolve while allowing the user total control over the genetic algorithm. Why –Allow images to be generated using a good set of functions to reduce the amount of “static” images contain. –Most Evolutionary art programs use really basic functions which introduce a lot of static and take thousands of generations to find “good” images.

Chromosome Data Structure Each chromosome is represented by an array of genes. –Each gene contains 2 pointers, a function, and a parameter value. –Pointers index any gene that came before the current. It can also point to the X and Y pixel coordinate values. –Functions are a value from 0 to 1-MAX number of functions. –Parameter is a value from 0 – 255, these are used as extra input values into the function. –There is a special gene at the end of the chromosome which is the pointers for the RGB values.

Chromosome Data Structure Example of a chromosome with 3 genes.

Chromosome Data Structure Advantages –Pointers allow a chromosome which have the exact same function and parameters to be mapped many different ways. –The number and exact definition of functions is left out of the data structure for maximum flexability. For example, its easy to swap function sets.

Complex vs Basic functions

20 generations of searching Basic Complex

Example of mutation Starting image  Resulting image

Example of crossover Parent 1 + Parent 2 = Child

Program Flow

Design Process Data structures and Algorithms went through several revisions. –Original chromosome Data structure used strings instead of integers. Had to redesign because of speed issues –At one point function calculations were using doubles Had to restrict to integers for speed

Conclusion Successfully created a real time Evolutionary Art program. –The animator for images had to be dropped cause of time constraints. Primary loss of time was the result of 1-2 bugs that took a tremendous amount of time to fix. What I learned –Optimizing code that gets run 100,000 times for each image. –Learned more about using and manipulating java GUI

Any Questions?