The human eye - an evolutionary look.

Slides:



Advertisements
Similar presentations
Tuesday, May 14 Genetic Algorithms Handouts: Lecture Notes Question: when should there be an additional review session?
Advertisements

Non-Linear Problems General approach. Non-linear Optimization Many objective functions, tend to be non-linear. Design problems for which the objective.
1 Lecture 8: Genetic Algorithms Contents : Miming nature The steps of the algorithm –Coosing parents –Reproduction –Mutation Deeper in GA –Stochastic Universal.
COMP305. Part II. Genetic Algorithms. Genetic Algorithms.
Introduction to Genetic Algorithms Yonatan Shichel.
COMP305. Part II. Genetic Algorithms. Genetic Algorithms.
Artificial Intelligence Genetic Algorithms and Applications of Genetic Algorithms in Compilers Prasad A. Kulkarni.
Intro to AI Genetic Algorithm Ruth Bergman Fall 2002.
Chapter 14 Genetic Algorithms.
Darwinian Natural Selection I.Motivation Most powerful mode of evolution and explains why one observes Descent with Modification Nonrandom survivorship/reproduction.
Intro to AI Genetic Algorithm Ruth Bergman Fall 2004.
Darwinian Natural Selection I.Motivation Most powerful mode of evolution.
Chapter 6: Transform and Conquer Genetic Algorithms The Design and Analysis of Algorithms.
Appendix B A BRIEF TOUR OF SOLVER Prescriptive Analytics
What is Genetic Programming? Genetic programming is a model of programming which uses the ideas (and some of the terminology) of biological evolution to.
Applying Genetic Algorithm to the Knapsack Problem Qi Su ECE 539 Spring 2001 Course Project.
1 Chapter 14 Genetic Algorithms. 2 Chapter 14 Contents (1) l Representation l The Algorithm l Fitness l Crossover l Mutation l Termination Criteria l.
Genetic Algorithms What is a GA Terms and definitions Basic algorithm.
An Experiment with Evolution – Developing an Eye Michael Guzman 21/2/2007.
Lab 9: Geometrical optics Only 3 more labs to go!! Today we are going to do three experiments: 1. Measure the intensity of light as a function of distance.
D Nagesh Kumar, IIScOptimization Methods: M8L5 1 Advanced Topics in Optimization Evolutionary Algorithms for Optimization and Search.
Genetic Algorithm Dr. Md. Al-amin Bhuiyan Professor, Dept. of CSE Jahangirnagar University.
Artificial Intelligence By Mr. Ejaz CIIT Sahiwal Evolutionary Computation.
P3 Physics Medical applications Section a) The structure of the eye. The structure of the eye is limited to: ■ retina ■ lens ■ cornea ■ pupil /iris.
Genetic Algorithm(GA)
March 1, 2016Introduction to Artificial Intelligence Lecture 11: Machine Evolution 1 Let’s look at… Machine Evolution.
Genetic Algorithm (Knapsack Problem)
Chapter 14 Genetic Algorithms.
Genetic Algorithms.
SUBMITTED BY Vandana ue7465
Evolution as Genetic Change
Natural Selection Lab 14.
Bulgarian Academy of Sciences
Introduction to Genetic Algorithm (GA)
Light.
Lesson Overview 17.1 Genes and Variation.
Lesson Overview 17.1 Genes and Variation.
Some examples Noughts and crosses exercise
Aperture, Exposure and Depth of Field
EVOLUTION OF POPULATIONS Evolution as Genetic Change
The Rest Of The Standards
Lenses Are classified by their Focal Length.
16-2 Evolution as Genetic Change
Basics of Genetic Algorithms (MidTerm – only in RED material)
Mechanisms of Evolution
Unit 16 Notes: Page 49 Test Date: 5/24/18
UNIT 7: Evolution How do populations grow?
Cameras and Eyes.
1) What would happen to the population size if the average female produced more than one surviving reproducing daughter? A) there would be more females.
Goal 8- The Eye Understand how we see    . Goal 8- The Eye Understand how we see    
Copyright Pearson Prentice Hall
Introduction to Artificial Intelligence Lecture 11: Machine Evolution
Camera Basics Digital Photography.
Lesson Overview 17.1 Genes and Variation Objectives:
Lesson Overview 17.1 Genes and Variation.
Human Eye Structure of Human Eye: Focusing Eye defects
Basics of Genetic Algorithms
Methods and Materials (cont.)
Copyright Pearson Prentice Hall
Lesson Overview 17.1 Genes and Variation.
III. Darwin’s Theory of Natural Selection
What is Evolution? The change in DNA of a population over time.
Applications of Genetic Algorithms TJHSST Computer Systems Lab
Aperture and Shutter Speed
Lesson Overview 17.1 Genes and Variation.
16-2 Evolution as Genetic Change
Derivative-free Methods for Structural Optimization
LIGHT AND SOUND YEAR 9 SCIENCE
Aperture, Exposure and Depth of Field
Presentation transcript:

The human eye - an evolutionary look

A short introduction The goal of this project was predicting the number of generations required for an eye to evolve. I used a genetic algorithm on a population of individual eyes, until I got the desired eye. A sort of Darwin principle: the strongest eye survives each time.

For those of you who forgot – some basic theory… There are two parameters (which I dealt with) that make one eye fitter than another: the first is the shape of the eye and the second is the lens. The shape of the initial eye is a flat patch of light-sensitive cells sandwiched between a transparent protective layer and a layer of dark pigment.

Forming a depression in the patch Closing the “hole” formed Our goal is to achieve better direction resolution. This is achieved by two successive operations: Forming a depression in the patch Closing the “hole” formed

Forming a depression in the patch This deepening reduces the angle at which each cell receives light.

But we still have a problem The problem comes from the fact that each point in the object (here - the dolphin) sends light to many different cells on the retina. We know that the object is on our right side, but we're not exactly sure where.

Closing the “hole” formed To solve this problem the “hole” is closed: And then we get a clearer picture:

when the pit depth equals its width, deepening is no longer helpful, and closure of this pit is more important. there is a limit to the size of the opening. As this opening gets smaller the optical image becomes well resolved but also much dimmer, which leads to noises.

Resolution is optimal when a/p=0.19 The theory of Snyder tells us that the maximum detectable special frequency is: We can then see the resolution as function of A and P: Resolution is optimal when a/p=0.19

The lens In a lensless eye each spot is blurred and has the size of the aperture. A lens situated in the aperture will converge the light into one place, making the object sharper, without decreasing the brightness of the image, which would have happened if we tried to achieve sharpness by further closure of the aperture.

Genetic algorithm A genetic algorithm is an iterative procedure that consists of a constant-size population of individuals. Every evolutionary step, which is called generation, the individuals are evaluated according to some pre-defined quality criterion called fitness

Genetic algorithm Forming a new generation consists of three major stages: Selection – individuals are selected with a probability proportional to their relative fitness. Reproduction – two selected individuals change parameters by some probability. Mutation – there is a small chance for each individual to mutate. That means change a parameter by chance.

Fitness function The heart of the algorithm - the “fitness” function. This function should be the quality of vision, because that should be reason for an eye to evolve in a certain way.

The algorithm’s parameters The eye has 3 parameters: the length of the light-sensitive patch – it is constant. The next 2 contribute to the fitness: radius (which is the inverse of the curvature of the patch) the lens focal length.

How the algorithm works We start with a population of 100 eyes The eyes are sorted by fitness Each time 2 eyes are selected The selection function:: 99-(random^2)*100 These eyes reproduce and have a child This child mutates after a 100 children are born, they are the new generation

The different stages

The different stages

The different stages

Results The results depend on a lot of different choices made: What is the probability for mutation By how much to mutate each time What are the initial factors given What is the percentage of children that look exactly like their parents The different possible options for a selection function And – of course, the fitness function.

Results for different mutation probability Maximum error Average number of generations mutation 6% 17274 0.001 5% 6040 0.004 3% 4236 0.007

Results for a different amount of mutation each time Maximum error Average number of generations Amount of change 6% 17274 1% ~0% 173063 0. 1%

conclusions The results are a very rough estimation, of course, but they let us see that it is possible the number of generations it takes the eye to evolve varies a lot by the parameters introduced in every group where the parameters stayed the same, the results were very close to one another

The results show the eye’s structure up to now The results show the eye’s structure up to now. We’ll leave the future to evolution!