Woody Plants Model Recognition by Differential Evolution

Size: px
Start display at page:

Download "Woody Plants Model Recognition by Differential Evolution"

Transcription

1 Woody Plants Model Recognition by Differential Evolution BIOMA 2010, Ljubljana, May 2010 Woody Plants Model Recognition by Differential Evolution 1 / 22

2 1 Introduction 2 Related Work 3 Woody Plants Recognition by Differential Evolution 4 Experimental Results 5 Conclusion Woody Plants Model Recognition by Differential Evolution 2 / 22

3 Motivation At CEC 2009, an approach for recognition of two-dimensional procedural models was presented, the procedural model used was not as complex to express woody plants, we now extend this approach to the domain of three-dimensional procedural models suitable to model complex woody plants. A new approach: to design three-dimensional geometrical models for woody plants (trees), used in computer graphics and animation. Recognition of trees: evolutionary algorithms (our jde) and procedural modeling of trees (our EcoMod). Woody Plants Model Recognition by Differential Evolution 3 / 22

4 1 Introduction 2 Related Work 3 Woody Plants Recognition by Differential Evolution 4 Experimental Results 5 Conclusion Woody Plants Model Recognition by Differential Evolution 4 / 22

5 Differential Evolution (DE) A floating point encoding EA for global optimization over continuous spaces, trough generations, the evolution process improves population of vectors by combining a parent individual and several other individuals of the same population. We have chosen the strategy jde/rand/1/bin mutation: vi,g+1 = x r1,g { + F (x r2,g x r3,g ), v i,j,g+1 if rand(0, 1) CR or j = j rand crossover: ui,j,g+1 = and x i,j,g otherwise { u i,g+1 if f (u i,g+1 ) < f (x i,g ) selection: x i,g+1 =, x i,g otherwise includes mechanism of F and CR control parameters self-adaptation. Woody Plants Model Recognition by Differential Evolution 5 / 22

6 Problem Domain: Woody Plants Procedural Model 3D tree models are compactly represented using a procedural model our EcoMod framework uses a numerically coded procedural model with fixed dimensionality suitable for parameter estimation using DE. Parameterized procedural model builds a 3D structure of a tree and all its building parts: by recursively executing a fixed procedure, over a given set of numerically coded input parameters, such as branch thickness, relative branch length and branching structure proportions. Woody Plants Model Recognition by Differential Evolution 6 / 22

7 Trees Representable by EcoMod Framework Foliage or coniferous trees with very different branching structures, each branch and each leaf can be animated in real time to show the growth of a tree or its sway in the wind. Woody Plants Model Recognition by Differential Evolution 7 / 22

8 Recognizing Trees: Image-based Approaches to Modeling Image-based approaches have the best potential to produce realistically looking plants they rely on images of real plants. Little work has been done to design trees with the use of a general recognition from images without user interaction use of sketch based guide techniques or the procedural models recognized were only two-dimensional. We now extended this recognition to the domain of 3D procedural models suitable to model woody plants without user interaction. Woody Plants Model Recognition by Differential Evolution 8 / 22

9 1 Introduction 2 Related Work 3 Woody Plants Recognition by Differential Evolution 4 Experimental Results 5 Conclusion Woody Plants Model Recognition by Differential Evolution 9 / 22

10 Woody Plants Recognition by Differential Evolution: Recognition Method Based on an optimization procedure with three main parts: Part I: genotype encoding, Part II: genotype-phenotype mapping, and Part III: fitness evaluation: phenotype and reference image comparison. Woody Plants Model Recognition by Differential Evolution 10 / 22

11 Genotype Encoding An individual genotype vector x of jde population represents a set of procedural model parameters, by computing recursive procedure using a set of parameters, EcoMod renders a woody plant, dimensionality of the genotype x is D = 4509, where g {0, G = 15}, w {0, W = 50}, and each G W = 750 real-coded parameters encode: one matrix of a Gravelius and Weibull ordered parameter for recursive calculations. Woody Plants Model Recognition by Differential Evolution 11 / 22

12 Genotype Encoding (x i,j [0, 1], i 1..NP in j 1..D) Number of strands of a tree S = 400x i, (S [10, 410]), height of base trunk l 0,0 0 = x i,1 10 m (l 0,0 0 [0 m, 10 m]), coefficient of branch thickness k d = 0.05x i,2 (k d [0, 0.05]), phyllotaxis angle α p = 360 x i,3 (α p [0, 360 ]), branching ratio of subbranch strands distribution ks g,w = 0.5x i,j + 0.5, j {4, 753} (ks g,w [0.5, 1]), branching angle between dividing subbranches α g,w = 180 x i,j, j {754, 1503} (α g,w [0, 180 ]), maximum relative subbranch to base branch length M g,w = 20x i,j, j {1504, 2253} (M g,w [0, 20]), minimum relative subbranch to base branch length m g,w = 20x i,j, j {2254, 3003} (m g,w [0, 20]), branch length scaling factor k g,w l = 20x i,j, j {3004, 3753} (k g,w l [0, 20]), gravicentralism impact k c = x i,3754 (k c [0, 1]), gravimorphism impact (i.e. gravitational bending of branches) αm g,w = 360 x i,j 180, j {3755, 4504} (α g,w m [ 180, 180 ]), enabling leaves display on a tree B l = x i, (B l {0, 1}), density of leaves ρ l = 30x i,4507 (ρ l {0, 30}), size of leaves l l = 0.3x i,4506 (l l [0, 0.3]), and leaf distribution type l type = 5x i,4508 (l type {Spiral, Stacked, Staggered, Bunched, Coniferous}). Woody Plants Model Recognition by Differential Evolution 12 / 22

13 Genotype-phenotype Mapping Recognition method is based on recognition of two-dimensional images of woody plants z (digital camera), to compare the three-dimensional tree evolved with the use of genotype x to the reference image z, genotype x must be transformed to its phenotype first, phenotype is a rendered two-dimensional image z, images z and z are all of dimensionality X Y pixels, both images are converted to black and white, where white (0) pixels mark background and black (1) pixels mark material, e.g. wood, the reference image is scaled to the given resolution, if necessary. An evolved procedural model is compared to reference images twice, to favor three-dimensional procedural models generation, projections differ by β = 90 camera view angle along the trunk base. Woody Plants Model Recognition by Differential Evolution 13 / 22

14 Phenotype and Reference Image Comparison The recognition success is measured by similarity of the reference original images and the generated rendered images of evolved parametrized procedural models. Images are compared pixel-wise: in the evolved image, for each pixel rendered as material: the Manhattan distance to the nearest material pixel in the reference image is computed, and vice-versa. Fitness evaluation of each phenotype is the sum of this distances: f (x) = f (g(x, 0 ), g(x, 90 )) = h(z 1 ) + h(z 2 ), h(z) = x,y m 1 (z x,y, z x,y ) + x,y m 1 (z x,y, z x,y ), where m 1 denotes a function computing Manhattan distance to the nearest material pixel in the image z. Woody Plants Model Recognition by Differential Evolution 14 / 22

15 1 Introduction 2 Related Work 3 Woody Plants Recognition by Differential Evolution 4 Experimental Results 5 Conclusion Woody Plants Model Recognition by Differential Evolution 15 / 22

16 Experiment Design Sampling rate dimension of the rendered parametrized procedural model was set to 250x250, the maximal number of strands in the tree was S = 410, the maximal number of fitness evaluations (FEs) for jde algorithm was FEs = 10, 000, the tests were run for different settings of population size NP in the evolutionary algorithm, each over 30 runs, the remaining parameters were kept default as in original algorithms from their literature. Reference model to recognize: (rendered in EcoMod) Woody Plants Model Recognition by Differential Evolution 16 / 22

17 Final Fitness (varied on the NP) Best Worst Average Std 2000 Fitness Population size Worst possible fitness is = 31, 250, 000 =3.125e7. Tests run for population sizes NP 50 to 500, step 50, best obtained results at NP=100, Woody Plants Model Recognition by Differential Evolution 17 / 22

18 Evolution of a sample procedural model For population size of NP = 100, the algorithm in 30 runs obtained the best fitness value of 1806 (i.e. 5,7792e-05 of quality), the worst being 1870, and the average of (with standard deviation of 84.4). NP=100, run 1 (seed RN 0 = 1): < 0.01% different Woody Plants Model Recognition by Differential Evolution 18 / 22

19 1 Introduction 2 Related Work 3 Woody Plants Recognition by Differential Evolution 4 Experimental Results 5 Conclusion Woody Plants Model Recognition by Differential Evolution 19 / 22

20 Summary We presented an approach to design woody plant geometrical models, parameters of the procedural model were evolved using jde differential evolution algorithm to recognize geometrical models, sampled procedural models were rendered using EcoMod framework, rendered images were then compared to the reference source images, for recognition, to guide the optimization process. Recognition of a sample woody plant model and statistical analysis of the obtained results demonstrate usability of the proposed approach. Woody Plants Model Recognition by Differential Evolution 20 / 22

21 Future research Improve metrics for comparison of rendered and reference images, add segmentation methods to separate tree imagery from background, use multiple metrics recognition combined with the use of multi-objective optimization, implement the application for mobile phones, and add interactive methods for optimization. Woody Plants Model Recognition by Differential Evolution 21 / 22

22 Thank you for listening. Questions? Woody Plants Model Recognition by Differential Evolution 22 / 22

WOODY PLANTS MODEL RECOGNITION BY DIFFERENTIAL EVOLUTION

WOODY PLANTS MODEL RECOGNITION BY DIFFERENTIAL EVOLUTION WOODY PLANTS MODEL RECOGNITION BY DIFFERENTIAL EVOLUTION Aleš Zamuda, Janez Brest, Borko Bošković, Viljem Žumer Faculty of Electrical Engineering and Computer Science University of Maribor, Slovenia {ales.zamuda;

More information

Using Genetic Algorithms to Solve the Box Stacking Problem

Using Genetic Algorithms to Solve the Box Stacking Problem Using Genetic Algorithms to Solve the Box Stacking Problem Jenniffer Estrada, Kris Lee, Ryan Edgar October 7th, 2010 Abstract The box stacking or strip stacking problem is exceedingly difficult to solve

More information

1. Introduction. 2. Motivation and Problem Definition. Volume 8 Issue 2, February Susmita Mohapatra

1. Introduction. 2. Motivation and Problem Definition. Volume 8 Issue 2, February Susmita Mohapatra Pattern Recall Analysis of the Hopfield Neural Network with a Genetic Algorithm Susmita Mohapatra Department of Computer Science, Utkal University, India Abstract: This paper is focused on the implementation

More information

Classification Using Genetic Programming. Patrick Kellogg General Assembly Data Science Course (8/23/15-11/12/15)

Classification Using Genetic Programming. Patrick Kellogg General Assembly Data Science Course (8/23/15-11/12/15) Classification Using Genetic Programming Patrick Kellogg General Assembly Data Science Course (8/23/15-11/12/15) Iris Data Set Iris Data Set Iris Data Set Iris Data Set Iris Data Set Create a geometrical

More information

Lecture 6: Genetic Algorithm. An Introduction to Meta-Heuristics, Produced by Qiangfu Zhao (Since 2012), All rights reserved

Lecture 6: Genetic Algorithm. An Introduction to Meta-Heuristics, Produced by Qiangfu Zhao (Since 2012), All rights reserved Lecture 6: Genetic Algorithm An Introduction to Meta-Heuristics, Produced by Qiangfu Zhao (Since 2012), All rights reserved Lec06/1 Search and optimization again Given a problem, the set of all possible

More information

MULTI-OBJECTIVE EVOLUTIONARY ALGORITHMS FOR ENERGY-EFFICIENCY IN HETEROGENEOUS WIRELESS SENSOR NETWORKS

MULTI-OBJECTIVE EVOLUTIONARY ALGORITHMS FOR ENERGY-EFFICIENCY IN HETEROGENEOUS WIRELESS SENSOR NETWORKS MULTI-OBJECTIVE EVOLUTIONARY ALGORITHMS FOR ENERGY-EFFICIENCY IN HETEROGENEOUS WIRELESS SENSOR NETWORKS José M. Lanza-Gutiérrez, Juan A. Gómez-Pulido, Miguel A. Vega- Rodríguez, Juan M. Sánchez University

More information

Evolutionary Approaches for Resilient Surveillance Management. Ruidan Li and Errin W. Fulp. U N I V E R S I T Y Department of Computer Science

Evolutionary Approaches for Resilient Surveillance Management. Ruidan Li and Errin W. Fulp. U N I V E R S I T Y Department of Computer Science Evolutionary Approaches for Resilient Surveillance Management Ruidan Li and Errin W. Fulp WAKE FOREST U N I V E R S I T Y Department of Computer Science BioSTAR Workshop, 2017 Surveillance Systems Growing

More information

Applying genetic algorithm on power system stabilizer for stabilization of power system

Applying genetic algorithm on power system stabilizer for stabilization of power system Applying genetic algorithm on power system stabilizer for stabilization of power system 1,3 Arnawan Hasibuan and 2,3 Syafrudin 1 Engineering Department of Malikussaleh University, Lhokseumawe, Indonesia;

More information

Encoding Techniques in Genetic Algorithms

Encoding Techniques in Genetic Algorithms Encoding Techniques in Genetic Algorithms Debasis Samanta Indian Institute of Technology Kharagpur dsamanta@iitkgp.ac.in 01.03.2016 Debasis Samanta (IIT Kharagpur) Soft Computing Applications 01.03.2016

More information

An Introduction to Evolutionary Algorithms

An Introduction to Evolutionary Algorithms An Introduction to Evolutionary Algorithms Karthik Sindhya, PhD Postdoctoral Researcher Industrial Optimization Group Department of Mathematical Information Technology Karthik.sindhya@jyu.fi http://users.jyu.fi/~kasindhy/

More information

Neural Network Weight Selection Using Genetic Algorithms

Neural Network Weight Selection Using Genetic Algorithms Neural Network Weight Selection Using Genetic Algorithms David Montana presented by: Carl Fink, Hongyi Chen, Jack Cheng, Xinglong Li, Bruce Lin, Chongjie Zhang April 12, 2005 1 Neural Networks Neural networks

More information

A Memetic Heuristic for the Co-clustering Problem

A Memetic Heuristic for the Co-clustering Problem A Memetic Heuristic for the Co-clustering Problem Mohammad Khoshneshin 1, Mahtab Ghazizadeh 2, W. Nick Street 1, and Jeffrey W. Ohlmann 1 1 The University of Iowa, Iowa City IA 52242, USA {mohammad-khoshneshin,nick-street,jeffrey-ohlmann}@uiowa.edu

More information

METAHEURISTICS Genetic Algorithm

METAHEURISTICS Genetic Algorithm METAHEURISTICS Genetic Algorithm Jacques A. Ferland Department of Informatique and Recherche Opérationnelle Université de Montréal ferland@iro.umontreal.ca Genetic Algorithm (GA) Population based algorithm

More information

Mutations for Permutations

Mutations for Permutations Mutations for Permutations Insert mutation: Pick two allele values at random Move the second to follow the first, shifting the rest along to accommodate Note: this preserves most of the order and adjacency

More information

Genetic Algorithms. Kang Zheng Karl Schober

Genetic Algorithms. Kang Zheng Karl Schober Genetic Algorithms Kang Zheng Karl Schober Genetic algorithm What is Genetic algorithm? A genetic algorithm (or GA) is a search technique used in computing to find true or approximate solutions to optimization

More information

One type of these solutions is automatic license plate character recognition (ALPR).

One type of these solutions is automatic license plate character recognition (ALPR). 1.0 Introduction Modelling, Simulation & Computing Laboratory (msclab) A rapid technical growth in the area of computer image processing has increased the need for an efficient and affordable security,

More information

Face Recognition Using Long Haar-like Filters

Face Recognition Using Long Haar-like Filters Face Recognition Using Long Haar-like Filters Y. Higashijima 1, S. Takano 1, and K. Niijima 1 1 Department of Informatics, Kyushu University, Japan. Email: {y-higasi, takano, niijima}@i.kyushu-u.ac.jp

More information

Using Genetic Algorithms to optimize ACS-TSP

Using Genetic Algorithms to optimize ACS-TSP Using Genetic Algorithms to optimize ACS-TSP Marcin L. Pilat and Tony White School of Computer Science, Carleton University, 1125 Colonel By Drive, Ottawa, ON, K1S 5B6, Canada {mpilat,arpwhite}@scs.carleton.ca

More information

March 19, Heuristics for Optimization. Outline. Problem formulation. Genetic algorithms

March 19, Heuristics for Optimization. Outline. Problem formulation. Genetic algorithms Olga Galinina olga.galinina@tut.fi ELT-53656 Network Analysis and Dimensioning II Department of Electronics and Communications Engineering Tampere University of Technology, Tampere, Finland March 19, 2014

More information

V.Petridis, S. Kazarlis and A. Papaikonomou

V.Petridis, S. Kazarlis and A. Papaikonomou Proceedings of IJCNN 93, p.p. 276-279, Oct. 993, Nagoya, Japan. A GENETIC ALGORITHM FOR TRAINING RECURRENT NEURAL NETWORKS V.Petridis, S. Kazarlis and A. Papaikonomou Dept. of Electrical Eng. Faculty of

More information

Generate Leaf Shapes using L-system and Genetic Algorithms

Generate Leaf Shapes using L-system and Genetic Algorithms Generate Leaf Shapes using L-system and Genetic Algorithms Yodthong Rodkaew 1, Suchada Siripant 2, Chidchanok Lursinsap 3 and Prabhas Chongstitvatana 4 Department of Computer Engineering Faculty of Engineering

More information

Genetic Algorithms. Genetic Algorithms

Genetic Algorithms. Genetic Algorithms A biological analogy for optimization problems Bit encoding, models as strings Reproduction and mutation -> natural selection Pseudo-code for a simple genetic algorithm The goal of genetic algorithms (GA):

More information

Convexization in Markov Chain Monte Carlo

Convexization in Markov Chain Monte Carlo in Markov Chain Monte Carlo 1 IBM T. J. Watson Yorktown Heights, NY 2 Department of Aerospace Engineering Technion, Israel August 23, 2011 Problem Statement MCMC processes in general are governed by non

More information

CS5401 FS2015 Exam 1 Key

CS5401 FS2015 Exam 1 Key CS5401 FS2015 Exam 1 Key This is a closed-book, closed-notes exam. The only items you are allowed to use are writing implements. Mark each sheet of paper you use with your name and the string cs5401fs2015

More information

Genetic Programming Part 1

Genetic Programming Part 1 Genetic Programming Part 1 Evolutionary Computation Lecture 11 Thorsten Schnier 06/11/2009 Previous Lecture Multi-objective Optimization Pareto optimality Hyper-volume based indicators Recent lectures

More information

Data Partitioning. Figure 1-31: Communication Topologies. Regular Partitions

Data Partitioning. Figure 1-31: Communication Topologies. Regular Partitions Data In single-program multiple-data (SPMD) parallel programs, global data is partitioned, with a portion of the data assigned to each processing node. Issues relevant to choosing a partitioning strategy

More information

Binary Differential Evolution Strategies

Binary Differential Evolution Strategies Binary Differential Evolution Strategies A.P. Engelbrecht, Member, IEEE G. Pampará Abstract Differential evolution has shown to be a very powerful, yet simple, population-based optimization approach. The

More information

Tools & Applications 1. Introduction 2. Design of Matrix Turbines

Tools & Applications 1. Introduction 2. Design of Matrix Turbines NATIONAL TECHNICAL UNIVERSITY of ATHENS Lab. Thermal Turbomachines Parallel CFD & Optimization Unit Design Optimization Tools & Applications 1. Introduction 2. Design of Matrix Turbines Kyriakos C. Giannakoglou

More information

Data Mining. 3.5 Lazy Learners (Instance-Based Learners) Fall Instructor: Dr. Masoud Yaghini. Lazy Learners

Data Mining. 3.5 Lazy Learners (Instance-Based Learners) Fall Instructor: Dr. Masoud Yaghini. Lazy Learners Data Mining 3.5 (Instance-Based Learners) Fall 2008 Instructor: Dr. Masoud Yaghini Outline Introduction k-nearest-neighbor Classifiers References Introduction Introduction Lazy vs. eager learning Eager

More information

Introduction (7.1) Genetic Algorithms (GA) (7.2) Simulated Annealing (SA) (7.3) Random Search (7.4) Downhill Simplex Search (DSS) (7.

Introduction (7.1) Genetic Algorithms (GA) (7.2) Simulated Annealing (SA) (7.3) Random Search (7.4) Downhill Simplex Search (DSS) (7. Chapter 7: Derivative-Free Optimization Introduction (7.1) Genetic Algorithms (GA) (7.2) Simulated Annealing (SA) (7.3) Random Search (7.4) Downhill Simplex Search (DSS) (7.5) Jyh-Shing Roger Jang et al.,

More information

CHAPTER 5 ENERGY MANAGEMENT USING FUZZY GENETIC APPROACH IN WSN

CHAPTER 5 ENERGY MANAGEMENT USING FUZZY GENETIC APPROACH IN WSN 97 CHAPTER 5 ENERGY MANAGEMENT USING FUZZY GENETIC APPROACH IN WSN 5.1 INTRODUCTION Fuzzy systems have been applied to the area of routing in ad hoc networks, aiming to obtain more adaptive and flexible

More information

A Co-Clustering approach for Sum-Product Network Structure Learning

A Co-Clustering approach for Sum-Product Network Structure Learning Università degli Studi di Bari Dipartimento di Informatica LACAM Machine Learning Group A Co-Clustering approach for Sum-Product Network Antonio Vergari Nicola Di Mauro Floriana Esposito December 8, 2014

More information

EVOLVING LEGO. Exploring the impact of alternative encodings on the performance of evolutionary algorithms. 1. Introduction

EVOLVING LEGO. Exploring the impact of alternative encodings on the performance of evolutionary algorithms. 1. Introduction N. Gu, S. Watanabe, H. Erhan, M. Hank Haeusler, W. Huang, R. Sosa (eds.), Rethinking Comprehensive Design: Speculative Counterculture, Proceedings of the 19th International Conference on Computer- Aided

More information

Color. making some recognition problems easy. is 400nm (blue) to 700 nm (red) more; ex. X-rays, infrared, radio waves. n Used heavily in human vision

Color. making some recognition problems easy. is 400nm (blue) to 700 nm (red) more; ex. X-rays, infrared, radio waves. n Used heavily in human vision Color n Used heavily in human vision n Color is a pixel property, making some recognition problems easy n Visible spectrum for humans is 400nm (blue) to 700 nm (red) n Machines can see much more; ex. X-rays,

More information

Self-Adaptive Differential Evolution Algorithm in Constrained Real-Parameter Optimization

Self-Adaptive Differential Evolution Algorithm in Constrained Real-Parameter Optimization 006 IEEE Congress on Evolutionary Computation Sheraton Vancouver Wall Centre Hotel, Vancouver, BC, Canada July 6-, 006 Self-Adaptive Differential Evolution Algorithm in Constrained Real-Parameter Optimization

More information

Chapter 9: Genetic Algorithms

Chapter 9: Genetic Algorithms Computational Intelligence: Second Edition Contents Compact Overview First proposed by Fraser in 1957 Later by Bremermann in 1962 and Reed et al in 1967 Popularized by Holland in 1975 Genetic algorithms

More information

UNIT 4 Branch and Bound

UNIT 4 Branch and Bound UNIT 4 Branch and Bound General method: Branch and Bound is another method to systematically search a solution space. Just like backtracking, we will use bounding functions to avoid generating subtrees

More information

Overview. FIT3094 AI, A-Life and Virtual Environments Assignment 2 - The Artificial, Aesthetic Evolution of Flowers

Overview. FIT3094 AI, A-Life and Virtual Environments Assignment 2 - The Artificial, Aesthetic Evolution of Flowers FIT3094 AI, A-Life and Virtual Environments Assignment 2 - The Artificial, Aesthetic Evolution of Flowers In this assignment you will be guided step-by-step through the design and implementation of an

More information

Pit Pattern Classification of Zoom-Endoscopic Colon Images using D

Pit Pattern Classification of Zoom-Endoscopic Colon Images using D Pit Pattern Classification of Zoom-Endoscopic Colon Images using DCT and FFT Leonhard Brunauer Hannes Payer Robert Resch Department of Computer Science University of Salzburg February 1, 2007 Outline 1

More information

Constructing an Optimisation Phase Using Grammatical Evolution. Brad Alexander and Michael Gratton

Constructing an Optimisation Phase Using Grammatical Evolution. Brad Alexander and Michael Gratton Constructing an Optimisation Phase Using Grammatical Evolution Brad Alexander and Michael Gratton Outline Problem Experimental Aim Ingredients Experimental Setup Experimental Results Conclusions/Future

More information

Evolutionary design for the behaviour of cellular automaton-based complex systems

Evolutionary design for the behaviour of cellular automaton-based complex systems Evolutionary design for the behaviour of cellular automaton-based complex systems School of Computer Science & IT University of Nottingham Adaptive Computing in Design and Manufacture Bristol Motivation

More information

Previous Lecture Genetic Programming

Previous Lecture Genetic Programming Genetic Programming Previous Lecture Constraint Handling Penalty Approach Penalize fitness for infeasible solutions, depending on distance from feasible region Balanace between under- and over-penalization

More information

An Evolutionary Algorithm for the Multi-objective Shortest Path Problem

An Evolutionary Algorithm for the Multi-objective Shortest Path Problem An Evolutionary Algorithm for the Multi-objective Shortest Path Problem Fangguo He Huan Qi Qiong Fan Institute of Systems Engineering, Huazhong University of Science & Technology, Wuhan 430074, P. R. China

More information

SUPPLEMENTARY FILE S1: 3D AIRWAY TUBE RECONSTRUCTION AND CELL-BASED MECHANICAL MODEL. RELATED TO FIGURE 1, FIGURE 7, AND STAR METHODS.

SUPPLEMENTARY FILE S1: 3D AIRWAY TUBE RECONSTRUCTION AND CELL-BASED MECHANICAL MODEL. RELATED TO FIGURE 1, FIGURE 7, AND STAR METHODS. SUPPLEMENTARY FILE S1: 3D AIRWAY TUBE RECONSTRUCTION AND CELL-BASED MECHANICAL MODEL. RELATED TO FIGURE 1, FIGURE 7, AND STAR METHODS. 1. 3D AIRWAY TUBE RECONSTRUCTION. RELATED TO FIGURE 1 AND STAR METHODS

More information

Genetic L-System Programming: Breeding and Evolving Artificial Flowers with Mathematica

Genetic L-System Programming: Breeding and Evolving Artificial Flowers with Mathematica Genetic L-System Programming: Breeding and Evolving Artificial Flowers with Mathematica C. Jacob, jacob@informatik.uni-erlangen.de, Chair of Programming Languages, Department of Computer Science, University

More information

Computational Foundations of Cognitive Science

Computational Foundations of Cognitive Science Computational Foundations of Cognitive Science Lecture 16: Models of Object Recognition Frank Keller School of Informatics University of Edinburgh keller@inf.ed.ac.uk February 23, 2010 Frank Keller Computational

More information

New Research in Nature Inspired Algorithms for Mobility Management in GSM Networks

New Research in Nature Inspired Algorithms for Mobility Management in GSM Networks 1 of 12 New Research in Nature Inspired Algorithms for in GSM Networks Enrique Alba, José García-Nieto, Javid Taheri and Albert Zomaya 2 of 12 becomes a crucial issue when designing infrastructure for

More information

A Multiple Population Differential Evolution Sampler for Trade Space Visualization

A Multiple Population Differential Evolution Sampler for Trade Space Visualization A Multiple Population Differential Evolution Sampler for Trade Space Visualization Dan Carlsen Pennsylvania State University University Park, PA 1682 dec24@psu.edu ABSTRACT In this paper the evolutionary

More information

Review: Final Exam CPSC Artificial Intelligence Michael M. Richter

Review: Final Exam CPSC Artificial Intelligence Michael M. Richter Review: Final Exam Model for a Learning Step Learner initially Environm ent Teacher Compare s pe c ia l Information Control Correct Learning criteria Feedback changed Learner after Learning Learning by

More information

METAHEURISTIC. Jacques A. Ferland Department of Informatique and Recherche Opérationnelle Université de Montréal.

METAHEURISTIC. Jacques A. Ferland Department of Informatique and Recherche Opérationnelle Université de Montréal. METAHEURISTIC Jacques A. Ferland Department of Informatique and Recherche Opérationnelle Université de Montréal ferland@iro.umontreal.ca March 2015 Overview Heuristic Constructive Techniques: Generate

More information

CSE 549: Computational Biology

CSE 549: Computational Biology CSE 549: Computational Biology Phylogenomics 1 slides marked with * by Carl Kingsford Tree of Life 2 * H5N1 Influenza Strains Salzberg, Kingsford, et al., 2007 3 * H5N1 Influenza Strains The 2007 outbreak

More information

Cluster Analysis for Microarray Data

Cluster Analysis for Microarray Data Cluster Analysis for Microarray Data Seventh International Long Oligonucleotide Microarray Workshop Tucson, Arizona January 7-12, 2007 Dan Nettleton IOWA STATE UNIVERSITY 1 Clustering Group objects that

More information

COMPARISON OF ALGORITHMS FOR NONLINEAR REGRESSION ESTIMATES

COMPARISON OF ALGORITHMS FOR NONLINEAR REGRESSION ESTIMATES COMPSTAT 2004 Symposium c Physica-Verlag/Springer 2004 COMPARISON OF ALGORITHMS FOR NONLINEAR REGRESSION ESTIMATES Tvrdík J. and Křivý I. Key words: Global optimization, evolutionary algorithms, heuristics,

More information

Evolved Multi-resolution Transforms for Optimized Image Compression and Reconstruction under Quantization

Evolved Multi-resolution Transforms for Optimized Image Compression and Reconstruction under Quantization Evolved Multi-resolution Transforms for Optimized Image Compression and Reconstruction under Quantization FRANK W. MOORE Mathematical Sciences Department University of Alaska Anchorage CAS 154, 3211 Providence

More information

Genetic Programming. Charles Chilaka. Department of Computational Science Memorial University of Newfoundland

Genetic Programming. Charles Chilaka. Department of Computational Science Memorial University of Newfoundland Genetic Programming Charles Chilaka Department of Computational Science Memorial University of Newfoundland Class Project for Bio 4241 March 27, 2014 Charles Chilaka (MUN) Genetic algorithms and programming

More information

Probability Control Functions Settings in Continual Evolution Algorithm

Probability Control Functions Settings in Continual Evolution Algorithm Probability Control Functions Settings in Continual Evolution Algorithm Zdeněk Buk, Miroslav Šnorek Dept. of Computer Science and Engineering, Karlovo nám. 3, 2 35 Praha 2, Czech Republic bukz@fel.cvut.cz,

More information

Influence of the tape number on the optimized structural performance of locally reinforced composite structures

Influence of the tape number on the optimized structural performance of locally reinforced composite structures Proceedings of the 7th GACM Colloquium on Computational Mechanics for Young Scientists from Academia and Industry October 11-13, 2017 in Stuttgart, Germany Influence of the tape number on the optimized

More information

Genetic L-System Programming

Genetic L-System Programming Genetic L-System Programming Christian Jacob Chair of Programming Languages, Department of Computer Science, University of Erlangen-Nürnberg, Martens-Str. 3, D-958 Erlangen, Germany email: jacob@informatik.uni-erlangen.de

More information

Evolutionary form design: the application of genetic algorithmic techniques to computer-aided product design

Evolutionary form design: the application of genetic algorithmic techniques to computer-aided product design Loughborough University Institutional Repository Evolutionary form design: the application of genetic algorithmic techniques to computer-aided product design This item was submitted to Loughborough University's

More information

12.2 Plants. CS Dept, UK

12.2 Plants. CS Dept, UK 1 12.2 Plants - modeling and animation of plants represents an interesting and challenging area - exhibit arbitrary complexity while possessing a constrained branching structure - grow from a single source

More information

GenTree: An Interactive Genetic Algorithms System for Designing 3D Polygonal Tree Models

GenTree: An Interactive Genetic Algorithms System for Designing 3D Polygonal Tree Models GenTree: An Interactive Genetic Algorithms System for Designing 3D Polygonal Tree Models Clare Bates Congdon 1 and Raymond H. Mazza 2 1 Department of Computer Science, Colby College 5846 Mayflower Hill

More information

Using Genetic Algorithms to Improve the Visual Quality of Fractal Plants Generated with CSG-PL-Systems

Using Genetic Algorithms to Improve the Visual Quality of Fractal Plants Generated with CSG-PL-Systems Using Genetic Algorithms to Improve the Visual Quality of Fractal Plants Generated with CSG-PL-Systems Christoph Traxler and Michael Gervautz Institute of Computer Graphics Vienna University of Technology,

More information

THE VIEWING TRANSFORMATION

THE VIEWING TRANSFORMATION ECS 178 Course Notes THE VIEWING TRANSFORMATION Kenneth I. Joy Institute for Data Analysis and Visualization Department of Computer Science University of California, Davis Overview One of the most important

More information

Knowledge Discovery using PSO and DE Techniques

Knowledge Discovery using PSO and DE Techniques 60 CHAPTER 4 KNOWLEDGE DISCOVERY USING PSO AND DE TECHNIQUES 61 Knowledge Discovery using PSO and DE Techniques 4.1 Introduction In the recent past, there has been an enormous increase in the amount of

More information

Pseudo-code for typical EA

Pseudo-code for typical EA Extra Slides for lectures 1-3: Introduction to Evolutionary algorithms etc. The things in slides were more or less presented during the lectures, combined by TM from: A.E. Eiben and J.E. Smith, Introduction

More information

Automatic Visual Inspection of Bump in Flip Chip using Edge Detection with Genetic Algorithm

Automatic Visual Inspection of Bump in Flip Chip using Edge Detection with Genetic Algorithm Automatic Visual Inspection of Bump in Flip Chip using Edge Detection with Genetic Algorithm M. Fak-aim, A. Seanton, and S. Kaitwanidvilai Abstract This paper presents the development of an automatic visual

More information

Kyrre Glette INF3490 Evolvable Hardware Cartesian Genetic Programming

Kyrre Glette INF3490 Evolvable Hardware Cartesian Genetic Programming Kyrre Glette kyrrehg@ifi INF3490 Evolvable Hardware Cartesian Genetic Programming Overview Introduction to Evolvable Hardware (EHW) Cartesian Genetic Programming Applications of EHW 3 Evolvable Hardware

More information

Preliminary Background Tabu Search Genetic Algorithm

Preliminary Background Tabu Search Genetic Algorithm Preliminary Background Tabu Search Genetic Algorithm Faculty of Information Technology University of Science Vietnam National University of Ho Chi Minh City March 2010 Problem used to illustrate General

More information

Procedural modeling and shadow mapping. Computer Graphics CSE 167 Lecture 15

Procedural modeling and shadow mapping. Computer Graphics CSE 167 Lecture 15 Procedural modeling and shadow mapping Computer Graphics CSE 167 Lecture 15 CSE 167: Computer graphics Procedural modeling Height fields Fractals L systems Shape grammar Shadow mapping Based on slides

More information

2. (a) Explain when the Quick sort is preferred to merge sort and vice-versa.

2. (a) Explain when the Quick sort is preferred to merge sort and vice-versa. Code No: RR210504 Set No. 1 1. (a) Order the following functions according to their order of growth (from the lowest to the highest). (n-2)!, 5 log (n+100) 10,2 2n, 0.001n 4 +3n 3 +1, ln 2 n, n 1/3, 3

More information

Introduction to Artificial Intelligence

Introduction to Artificial Intelligence Introduction to Artificial Intelligence COMP307 Evolutionary Computing 3: Genetic Programming for Regression and Classification Yi Mei yi.mei@ecs.vuw.ac.nz 1 Outline Statistical parameter regression Symbolic

More information

AIRFOIL SHAPE OPTIMIZATION USING EVOLUTIONARY ALGORITHMS

AIRFOIL SHAPE OPTIMIZATION USING EVOLUTIONARY ALGORITHMS AIRFOIL SHAPE OPTIMIZATION USING EVOLUTIONARY ALGORITHMS Emre Alpman Graduate Research Assistant Aerospace Engineering Department Pennstate University University Park, PA, 6802 Abstract A new methodology

More information

QUANTUM BASED PSO TECHNIQUE FOR IMAGE SEGMENTATION

QUANTUM BASED PSO TECHNIQUE FOR IMAGE SEGMENTATION International Journal of Computer Engineering and Applications, Volume VIII, Issue I, Part I, October 14 QUANTUM BASED PSO TECHNIQUE FOR IMAGE SEGMENTATION Shradha Chawla 1, Vivek Panwar 2 1 Department

More information

Modeling Leaf Shapes Using L-systems and Genetic Algorithms

Modeling Leaf Shapes Using L-systems and Genetic Algorithms Modeling Leaf Shapes Using L-systems and Genetic Algorithms Yodthong Rodkaew Intelligent System Lab (ISL), Department of Computer Engineering, Faculty of Engineering, Chulalongkorn University 43718130@student.chula.ac.th

More information

Learning Geometric Concepts with an Evolutionary Algorithm

Learning Geometric Concepts with an Evolutionary Algorithm final version in: Lawrence J. Fogel, Peter J. Angeline and Thomas Bck (Ed.), Evolutionary Programming V, The MIT Press, 1996 Learning Geometric Concepts with an Evolutionary Algorithm Andreas Birk Universität

More information

Lecture

Lecture Lecture.. 7 Constrained problems & optimization Brief introduction differential evolution Brief eample of hybridization of EAs Multiobjective problems & optimization Pareto optimization This slides mainly

More information

Bi-Objective Optimization for Scheduling in Heterogeneous Computing Systems

Bi-Objective Optimization for Scheduling in Heterogeneous Computing Systems Bi-Objective Optimization for Scheduling in Heterogeneous Computing Systems Tony Maciejewski, Kyle Tarplee, Ryan Friese, and Howard Jay Siegel Department of Electrical and Computer Engineering Colorado

More information

Greedy Approach: Intro

Greedy Approach: Intro Greedy Approach: Intro Applies to optimization problems only Problem solving consists of a series of actions/steps Each action must be 1. Feasible 2. Locally optimal 3. Irrevocable Motivation: If always

More information

Evolutionary algorithms in communications

Evolutionary algorithms in communications Telecommunications seminar Evolutionary algorithms in Communications and systems Introduction lecture II: More about EAs Timo Mantere Professor Communications and systems engineering University of Vaasa

More information

Application of shape optimization method to artificial leaf design

Application of shape optimization method to artificial leaf design Design and Nature VI 157 Application of shape optimization method to artificial leaf design M. Shimoda1 & Y. Nakata2 1 Department of Advanced Science and Technology, Toyota Technological Institute, Japan

More information

The Genetic Algorithm for finding the maxima of single-variable functions

The Genetic Algorithm for finding the maxima of single-variable functions Research Inventy: International Journal Of Engineering And Science Vol.4, Issue 3(March 2014), PP 46-54 Issn (e): 2278-4721, Issn (p):2319-6483, www.researchinventy.com The Genetic Algorithm for finding

More information

Selecting the Best Spanning Tree in Metro Ethernet Networks using Genetic Algorithm

Selecting the Best Spanning Tree in Metro Ethernet Networks using Genetic Algorithm 106 Selecting the Best Spanning Tree in Metro Ethernet Networks using Genetic Algorithm Farhad Faghani and Ghasem Mirjalily, faghani_farhad@yahoo.com mirjalily@yazduni.ac.ir Instructor, Electrical Engeering

More information

Spatial Data Management

Spatial Data Management Spatial Data Management [R&G] Chapter 28 CS432 1 Types of Spatial Data Point Data Points in a multidimensional space E.g., Raster data such as satellite imagery, where each pixel stores a measured value

More information

Hybrid Differential Evolution Algorithm for Traveling Salesman Problem

Hybrid Differential Evolution Algorithm for Traveling Salesman Problem Available online at www.sciencedirect.com Procedia Engineering 15 (2011) 2716 2720 Advanced in Control Engineeringand Information Science Hybrid Differential Evolution Algorithm for Traveling Salesman

More information

Correspondence. Object Detection via Feature Synthesis Using MDL-Based Genetic Programming

Correspondence. Object Detection via Feature Synthesis Using MDL-Based Genetic Programming 538 IEEE TRANSACTIONS ON SYSTEMS, MAN, AND CYBERNETICS PART B: CYBERNETICS, VOL. 35, NO. 3, JUNE 2005 Correspondence Object Detection via Feature Synthesis Using MDL-Based Genetic Programming Yingqiang

More information

Scope and Sequence for the New Jersey Core Curriculum Content Standards

Scope and Sequence for the New Jersey Core Curriculum Content Standards Scope and Sequence for the New Jersey Core Curriculum Content Standards The following chart provides an overview of where within Prentice Hall Course 3 Mathematics each of the Cumulative Progress Indicators

More information

Lamarckian Repair and Darwinian Repair in EMO Algorithms for Multiobjective 0/1 Knapsack Problems

Lamarckian Repair and Darwinian Repair in EMO Algorithms for Multiobjective 0/1 Knapsack Problems Repair and Repair in EMO Algorithms for Multiobjective 0/ Knapsack Problems Shiori Kaige, Kaname Narukawa, and Hisao Ishibuchi Department of Industrial Engineering, Osaka Prefecture University, - Gakuen-cho,

More information

A Learning Automata-based Memetic Algorithm

A Learning Automata-based Memetic Algorithm A Learning Automata-based Memetic Algorithm M. Rezapoor Mirsaleh and M. R. Meybodi 2,3 Soft Computing Laboratory, Computer Engineering and Information Technology Department, Amirkabir University of Technology,

More information

NOVEL HYBRID GENETIC ALGORITHM WITH HMM BASED IRIS RECOGNITION

NOVEL HYBRID GENETIC ALGORITHM WITH HMM BASED IRIS RECOGNITION NOVEL HYBRID GENETIC ALGORITHM WITH HMM BASED IRIS RECOGNITION * Prof. Dr. Ban Ahmed Mitras ** Ammar Saad Abdul-Jabbar * Dept. of Operation Research & Intelligent Techniques ** Dept. of Mathematics. College

More information

Meshless Modeling, Animating, and Simulating Point-Based Geometry

Meshless Modeling, Animating, and Simulating Point-Based Geometry Meshless Modeling, Animating, and Simulating Point-Based Geometry Xiaohu Guo SUNY @ Stony Brook Email: xguo@cs.sunysb.edu http://www.cs.sunysb.edu/~xguo Graphics Primitives - Points The emergence of points

More information

The Continuous Genetic Algorithm. Universidad de los Andes-CODENSA

The Continuous Genetic Algorithm. Universidad de los Andes-CODENSA The Continuous Genetic Algorithm Universidad de los Andes-CODENSA 1. Components of a Continuous Genetic Algorithm The flowchart in figure1 provides a big picture overview of a continuous GA.. Figure 1.

More information

4/4/16 Comp 555 Spring

4/4/16 Comp 555 Spring 4/4/16 Comp 555 Spring 2016 1 A clique is a graph where every vertex is connected via an edge to every other vertex A clique graph is a graph where each connected component is a clique The concept of clustering

More information

3D Face Modeling Support System for Avatar by Using Interactive Genetic Algorithm

3D Face Modeling Support System for Avatar by Using Interactive Genetic Algorithm 3D Face Modeling Support System for Avatar by Using Interactive Genetic Algorithm FangWei Huang, Ivan Tanev, Kastunori Shimohara Graduate School of Science and Engineering, Doshisha University, Kyoto,

More information

Computational Financial Modeling

Computational Financial Modeling Computational Financial Modeling Enhancing Technical Analysis With Genetic Algorithm SAIKIRAN DEEPAK SHARMA PRANJAL JAIN 23 RD NOV. 2012 How Genetic Algorithm can be used to improve the performance of

More information

Spatial Data Structures for GIS Visualization. Ed Grundy

Spatial Data Structures for GIS Visualization. Ed Grundy Spatial Data Structures for GIS Visualization Ed Grundy GIS Data Elevation maps Satellite imagery (as texture data) Other data we may wish to visualise, such as temperature, population, etc In GIS terms

More information

Improving the 3D Scan Precision of Laser Triangulation

Improving the 3D Scan Precision of Laser Triangulation Improving the 3D Scan Precision of Laser Triangulation The Principle of Laser Triangulation Triangulation Geometry Example Z Y X Image of Target Object Sensor Image of Laser Line 3D Laser Triangulation

More information

Segmentation and Grouping

Segmentation and Grouping Segmentation and Grouping How and what do we see? Fundamental Problems ' Focus of attention, or grouping ' What subsets of pixels do we consider as possible objects? ' All connected subsets? ' Representation

More information

Robust Gene Expression Programming

Robust Gene Expression Programming Available online at www.sciencedirect.com Procedia Computer Science 6 (2011) 165 170 Complex Adaptive Systems, Volume 1 Cihan H. Dagli, Editor in Chief Conference Organized by Missouri University of Science

More information

Genetic Algorithm For Fingerprint Matching

Genetic Algorithm For Fingerprint Matching Genetic Algorithm For Fingerprint Matching B. POORNA Department Of Computer Applications, Dr.M.G.R.Educational And Research Institute, Maduravoyal, Chennai 600095,TamilNadu INDIA. Abstract:- An efficient

More information

Exploration vs. Exploitation in Differential Evolution

Exploration vs. Exploitation in Differential Evolution Exploration vs. Exploitation in Differential Evolution Ângela A. R. Sá 1, Adriano O. Andrade 1, Alcimar B. Soares 1 and Slawomir J. Nasuto 2 Abstract. Differential Evolution (DE) is a tool for efficient

More information