*Partially funded by the Austrian Grid Project (BMBWK GZ 4003/2-VI/4c/2004) Making the Best of Your Data - Offloading Visualization Tasks onto the Grid.

Slides:



Advertisements
Similar presentations
Population-based metaheuristics Nature-inspired Initialize a population A new population of solutions is generated Integrate the new population into the.
Advertisements

1 Genetic Algorithms Contents 1. Basic Concepts 2. Algorithm 3. Practical considerations.
Biologically Inspired Computing: Operators for Evolutionary Algorithms
Using Parallel Genetic Algorithm in a Predictive Job Scheduling
Exact and heuristics algorithms
Genetic Algorithms Contents 1. Basic Concepts 2. Algorithm
Tuesday, May 14 Genetic Algorithms Handouts: Lecture Notes Question: when should there be an additional review session?
Genetic Algorithms Representation of Candidate Solutions GAs on primarily two types of representations: –Binary-Coded –Real-Coded Binary-Coded GAs must.
Non-Linear Problems General approach. Non-linear Optimization Many objective functions, tend to be non-linear. Design problems for which the objective.
Estimation of Distribution Algorithms Let’s review what have done in EC so far: We have studied EP and found that each individual searched via Gaussian.
COMP305. Part II. Genetic Algorithms. Genetic Algorithms.
A new crossover technique in Genetic Programming Janet Clegg Intelligent Systems Group Electronics Department.
Introduction to Genetic Algorithms Yonatan Shichel.
Genetic Algorithms GAs are one of the most powerful and applicable search methods available GA originally developed by John Holland (1975) Inspired by.
Introduction to Volume Visualization Mengxia Zhu Fall 2007.
Intro to AI Genetic Algorithm Ruth Bergman Fall 2002.
Genetic Algorithms Nehaya Tayseer 1.Introduction What is a Genetic algorithm? A search technique used in computer science to find approximate solutions.
Genetic Algorithms Overview Genetic Algorithms: a gentle introduction –What are GAs –How do they work/ Why? –Critical issues Use in Data Mining –GAs.
1 Reasons for parallelization Can we make GA faster? One of the most promising choices is to use parallel implementations. The reasons for parallelization.
Parallel Genetic Algorithms with Distributed-Environment Multiple Population Scheme M.Miki T.Hiroyasu K.Hatanaka Doshisha University,Kyoto,Japan.
Genetic Algorithm.
A Budget Constrained Scheduling of Workflow Applications on Utility Grids using Genetic Algorithms Jia Yu and Rajkumar Buyya Grid Computing and Distributed.
An Approach of Artificial Intelligence Application for Laboratory Tests Evaluation Ş.l.univ.dr.ing. Corina SĂVULESCU University of Piteşti.
Neural and Evolutionary Computing - Lecture 10 1 Parallel and Distributed Models in Evolutionary Computing  Motivation  Parallelization models  Distributed.
1 Paper Review for ENGG6140 Memetic Algorithms By: Jin Zeng Shaun Wang School of Engineering University of Guelph Mar. 18, 2002.
Integrating Neural Network and Genetic Algorithm to Solve Function Approximation Combined with Optimization Problem Term presentation for CSC7333 Machine.
Cristian Urs and Ben Riveira. Introduction The article we chose focuses on improving the performance of Genetic Algorithms by: Use of predictive models.
SOFT COMPUTING (Optimization Techniques using GA) Dr. N.Uma Maheswari Professor/CSE PSNA CET.
1 Local search and optimization Local search= use single current state and move to neighboring states. Advantages: –Use very little memory –Find often.
Hierarchical Distributed Genetic Algorithm for Image Segmentation Hanchuan Peng, Fuhui Long*, Zheru Chi, and Wanshi Siu {fhlong, phc,
Zorica Stanimirović Faculty of Mathematics, University of Belgrade
Genetic Algorithms Michael J. Watts
Researchers: Preet Bola Mike Earnest Kevin Varela-O’Hara Han Zou Advisor: Walter Rusin Data Storage Networks.
What is Genetic Programming? Genetic programming is a model of programming which uses the ideas (and some of the terminology) of biological evolution to.
Genetic algorithms Charles Darwin "A man who dares to waste an hour of life has not discovered the value of life"
Optimization Problems - Optimization: In the real world, there are many problems (e.g. Traveling Salesman Problem, Playing Chess ) that have numerous possible.
GENETIC ALGORITHMS FOR THE UNSUPERVISED CLASSIFICATION OF SATELLITE IMAGES Ankush Khandelwal( ) Vaibhav Kedia( )
Evolving Virtual Creatures & Evolving 3D Morphology and Behavior by Competition Papers by Karl Sims Presented by Sarah Waziruddin.
Chapter 4.1 Beyond “Classic” Search. What were the pieces necessary for “classic” search.
FINAL EXAM SCHEDULER (FES) Department of Computer Engineering Faculty of Engineering & Architecture Yeditepe University By Ersan ERSOY (Engineering Project)
Genetic Algorithms Siddhartha K. Shakya School of Computing. The Robert Gordon University Aberdeen, UK
GENETIC ALGORITHM A biologically inspired model of intelligence and the principles of biological evolution are applied to find solutions to difficult problems.
1 A New Method for Composite System Annualized Reliability Indices Based on Genetic Algorithms Nader Samaan, Student,IEEE Dr. C. Singh, Fellow, IEEE Department.
Why do GAs work? Symbol alphabet : {0, 1, * } * is a wild card symbol that matches both 0 and 1 A schema is a string with fixed and variable symbols 01*1*
METAHEURISTICS Genetic Algorithm Jacques A. Ferland Department of Informatique and Recherche Opérationnelle Université de Montréal
MAE 552 Heuristic Optimization Instructor: John Eddy Lecture #12 2/20/02 Evolutionary Algorithms.
Probabilistic Algorithms Evolutionary Algorithms Simulated Annealing.
Chapter 12 FUSION OF FUZZY SYSTEM AND GENETIC ALGORITHMS Chi-Yuan Yeh.
EE749 I ntroduction to Artificial I ntelligence Genetic Algorithms The Simple GA.
Biologically inspired algorithms BY: Andy Garrett YE Ziyu.
Genetic Algorithms. The Basic Genetic Algorithm 1.[Start] Generate random population of n chromosomes (suitable solutions for the problem) 2.[Fitness]
Parallel Genetic Algorithms By Larry Hale and Trevor McCasland.
Coevolutionary Automated Software Correction Josh Wilkerson PhD Candidate in Computer Science Missouri S&T.
Waqas Haider Bangyal 1. Evolutionary computing algorithms are very common and used by many researchers in their research to solve the optimization problems.
D Nagesh Kumar, IIScOptimization Methods: M8L5 1 Advanced Topics in Optimization Evolutionary Algorithms for Optimization and Search.
1 Contents 1. Basic Concepts 2. Algorithm 3. Practical considerations Genetic Algorithm (GA)
FACTS Placement Optimization For Multi-Line Contignecies Josh Wilkerson November 30, 2005.
Genetic Algorithm Dr. Md. Al-amin Bhuiyan Professor, Dept. of CSE Jahangirnagar University.
Agenda  INTRODUCTION  GENETIC ALGORITHMS  GENETIC ALGORITHMS FOR EXPLORING QUERY SPACE  SYSTEM ARCHITECTURE  THE EFFECT OF DIFFERENT MUTATION RATES.
Artificial Intelligence By Mr. Ejaz CIIT Sahiwal Evolutionary Computation.
1 Comparative Study of two Genetic Algorithms Based Task Allocation Models in Distributed Computing System Oğuzhan TAŞ 2005.
Genetic Algorithms An Evolutionary Approach to Problem Solving.
Grid-Based Genetic Algorithm Approach to Colour Image Segmentation Marco Gallotta Keri Woods Supervised by Audrey Mbogho.
Genetic Algorithm(GA)
Genetic Algorithm. Outline Motivation Genetic algorithms An illustrative example Hypothesis space search.
 Presented By: Abdul Aziz Ghazi  Roll No:  Presented to: Sir Harris.
 Negnevitsky, Pearson Education, Lecture 12 Hybrid intelligent systems: Evolutionary neural networks and fuzzy evolutionary systems n Introduction.
1 Genetic Algorithms Contents 1. Basic Concepts 2. Algorithm 3. Practical considerations.
Artificial Intelligence (CS 370D)
EE368 Soft Computing Genetic Algorithms.
Presentation transcript:

*Partially funded by the Austrian Grid Project (BMBWK GZ 4003/2-VI/4c/2004) Making the Best of Your Data - Offloading Visualization Tasks onto the Grid Semiautomatic Generation of Transfer Functions through Grid-based Parameter Studies* Peter Praxmarer GUP, Joh. Kepler University Linz

Talk at CGW05Peter Praxmarer, GUP, Universität Linz 2 Agenda What are Transfer functions? Goal Approach Characteristics Use of the Grid Conclusion and Future Work

Talk at CGW05Peter Praxmarer, GUP, Universität Linz 3 What are Transfer Functions? Volumetric data represents: –A volume with some scalar property at every point –Properties can be: density, temperature, chemistry, … Rendering methods: –Isosurface: A 3d contour is created at a selected density, the resulting surface shows all the regions that are more (or less) dense than the chosen contour level. –Raytracing/Raycasting: A transfer function provides a mapping of the density values to color and transparency. Thus: D->(R,G,B,A)

Talk at CGW05Peter Praxmarer, GUP, Universität Linz 4 What are Transfer Functions? Example: –Given: Some volume data, a transfer function for transparency only.

Talk at CGW05Peter Praxmarer, GUP, Universität Linz 5 What are Transfer Functions? Example:

Talk at CGW05Peter Praxmarer, GUP, Universität Linz 6 What are Transfer Functions? Example:

Talk at CGW05Peter Praxmarer, GUP, Universität Linz 7 What are Transfer Functions? Example: Adding a color map

Talk at CGW05Peter Praxmarer, GUP, Universität Linz 8 What are Transfer Functions? Example: Adding a color map

Talk at CGW05Peter Praxmarer, GUP, Universität Linz 9 Task Find transfer functions for visualizing volume data Application: Offline-Rendering (Raytracing) of gas distributions in galaxy clusters Given: –Voxel data (density, temperature) Wanted: –Mapping: D->(R,G,B,A)

Talk at CGW05Peter Praxmarer, GUP, Universität Linz 10 Properties of the data Astrophysical volume data generated by N-body SPH simulations Unlike MRI data the astrophysical data is highly amorphic –In MRI data there are sharp boundaries -> we can use the gradient information for detecting boundaries –Galaxies often consist of a lot of gas which gradually gets denser -> the gradient alone is not sufficient to generate good visual representations (especially with isosurface rendering) Finding a transfer function that reveals the ‘interesting’ parts of the simulated data is difficult

Talk at CGW05Peter Praxmarer, GUP, Universität Linz 11 Approach Apply a genetic algorithm: 1.Generate an initial population of transfer functions 2.Evaluate the fitness of each chromosome 3.Select the best chromosomes (transfer functions) for the next population p i+1 4.Recombine the chromosomes 5.Mutate some chromosomes 6.Perform steps 2 to 6 until a good-enough transfer function has been found.

Talk at CGW05Peter Praxmarer, GUP, Universität Linz 12 Encoding (1) A chromosome represents one transfer function Each chromosome has N<50 genes Each gene stores –Density value –Color Thus: Mapping D -> (R,G,B,A)

Talk at CGW05Peter Praxmarer, GUP, Universität Linz 13 Encoding (2) Density value Hue, Saturation, Value Density value Hue, Saturation, Value Density value Hue, Saturation, Value Density value Hue, Saturation, Value … Gene 0Gene 1Gene N-2Gene N-1 Chromosome (transfer function)

Talk at CGW05Peter Praxmarer, GUP, Universität Linz 14 Generating an initial population Collecting statistical measures: –Histogram of the voxel data –Mean, average, mode Used to generate the initial population using a heuristics. Selection based on –Density interval –Frequency

Talk at CGW05Peter Praxmarer, GUP, Universität Linz 15 Evaluation of the fitness 1.Render the population on the grid 2.Present the resulting images to the user 3.The user judges the transfer functions according to a like/don’t like scheme

Talk at CGW05Peter Praxmarer, GUP, Universität Linz 16 Selecting the next population Select transfer functions for pop i+1 proportional to their fitness (the better a transfer function is, the more often it is selected) Introduces a bias towards ‘better’ transfer functions Is not sufficient to generate new transfer functions

Talk at CGW05Peter Praxmarer, GUP, Universität Linz 17 Recombination (1) Allows a transfer function to move towards interesting ‘places’ Applied with a probablity p crossover (usually p crossover = 0.7) Generates two offsprings from two parent chromosomes The parent chromosomes are chosen by random from the previously selected chromosomes

Talk at CGW05Peter Praxmarer, GUP, Universität Linz 18 Recombination (2) For example:

Talk at CGW05Peter Praxmarer, GUP, Universität Linz 19 Mutation Applied with probability p mutation (usually p mutation =0,001) per gene Randomly change the gene (color or density value) Introduces new solutions into the search space Prevents the premature convergence to local optima

Talk at CGW05Peter Praxmarer, GUP, Universität Linz 20 Application characteristics The user directs the search –Only the domain expert knows what he wants to see Allows finding transfer functions for volume data with an amorphous structure (galaxy data vs. MRT data) Requires large computational power to render the images of a population

Talk at CGW05Peter Praxmarer, GUP, Universität Linz 21 Rendering on the Grid Use today’s grid technology to distribute the load on various resources Prerequisites: –POVRay –Grid infrastructure

Talk at CGW05Peter Praxmarer, GUP, Universität Linz 22 Components Consists of –GUI: Presents the rendered images –Master: Server that maintains the connection to clients; Runs on the same machine as the GUI. –Clients: Are running on the Grid. Connect back to the Master and receive and execute commands from the master: Retrieve Density data Retrieve Scene description Execute Rendering Send Output back to GUI

Talk at CGW05Peter Praxmarer, GUP, Universität Linz 23 Parameter study The transfer function is saved as a colormap in the POVray scene description file Clients receive commands to execute the Rendering and transfer back the results Rendering is parallelized across multiple Grid nodes Data transfer using GridFTP

Talk at CGW05Peter Praxmarer, GUP, Universität Linz 24 Results (1)

Talk at CGW05Peter Praxmarer, GUP, Universität Linz 25 Results (2)

Talk at CGW05Peter Praxmarer, GUP, Universität Linz 26 Results (3) Rendering time: ~60 sec / transfer function with POVRay; resolution 600x600 By Parallelizing the POVRay rendering the rendering time can be significantly reduced (depends of number of available nodes) Population size: typically 16, up to 64

Talk at CGW05Peter Praxmarer, GUP, Universität Linz 27 Conclusion Supports astrophysicists in finding useful transfer functions for visualizing their simulated data The astrophysicists directs the search to what he wants to see in his data Due to the use of Grid Technology he is able to explore many different settings at once in a considerably short time Due to ray-tracing he gets high-quality representations of the volume data

Talk at CGW05Peter Praxmarer, GUP, Universität Linz 28 Future Work Improve heuristics for generating the initial population Use good transfer functions from astrophysicists as a starting point Improve the GUI to allow manually changing the presented transfer function. This should be done locally on the workstation to provide interactivity. Reduce the response time …