Ultrasonic Beam-forming with the Genetic Algorithm Andrew Fiss, Vassar College Nathan Baxter, Ohio Northern University Jerry Magnan, Florida State University.

Slides:



Advertisements
Similar presentations
High frequency annular arrays can provide very good resolution in ultrasound bio-microscopy Numerical simulation of their imaging patterns is essential.
Advertisements

Genetic Algorithms (Evolutionary Computing) Genetic Algorithms are used to try to “evolve” the solution to a problem Generate prototype solutions called.
Exact and heuristics algorithms
Student : Mateja Saković 3015/2011.  Genetic algorithms are based on evolution and natural selection  Evolution is any change across successive generations.
Genetic Algorithms Contents 1. Basic Concepts 2. Algorithm
Sparse Array Geometry Mr. Ahmed El-makadema Professor A.K Brown.
Test Case Filtering and Prioritization Based on Coverage of Combinations of Program Elements Wes Masri and Marwa El-Ghali American Univ. of Beirut ECE.
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.
COMP305. Part II. Genetic Algorithms. Genetic Algorithms.
Data Mining CS 341, Spring 2007 Genetic Algorithm.
A new crossover technique in Genetic Programming Janet Clegg Intelligent Systems Group Electronics Department.
Introduction to Genetic Algorithms Yonatan Shichel.
Applications of Evolutionary Computation in the Analysis of Factors Influencing the Evolution of Human Language Alex Decker.
COMP305. Part II. Genetic Algorithms. Genetic Algorithms.
Learning to Advertise. Introduction Advertising on the Internet = $$$ –Especially search advertising and web page advertising Problem: –Selecting ads.
COMP305. Part II. Genetic Algorithms. Genetic Algorithms.
Intro to AI Genetic Algorithm Ruth Bergman Fall 2002.
Basic concepts of Data Mining, Clustering and Genetic Algorithms Tsai-Yang Jea Department of Computer Science and Engineering SUNY at Buffalo.
Genetic Algorithms Nehaya Tayseer 1.Introduction What is a Genetic algorithm? A search technique used in computer science to find approximate solutions.
D Nagesh Kumar, IIScOptimization Methods: M1L4 1 Introduction and Basic Concepts Classical and Advanced Techniques for Optimization.
Intro to AI Genetic Algorithm Ruth Bergman Fall 2004.
Chapter 6: Transform and Conquer Genetic Algorithms The Design and Analysis of Algorithms.
Brandon Andrews.  What are genetic algorithms?  3 steps  Applications to Bioinformatics.
Universidad de los Andes-CODENSA The Continuous Genetic Algorithm.
Genetic Algorithms: A Tutorial
Genetic Algorithm.
An Approach of Artificial Intelligence Application for Laboratory Tests Evaluation Ş.l.univ.dr.ing. Corina SĂVULESCU University of Piteşti.
Evolving a Sigma-Pi Network as a Network Simulator by Justin Basilico.
Introduction to Genetic Algorithms and Evolutionary Computation
Optimization in Engineering Design Georgia Institute of Technology Systems Realization Laboratory Mixed Integer Problems Most optimization algorithms deal.
Building Three-Dimensional Images Using a Time-Reversal Chaotic Cavity
Zorica Stanimirović Faculty of Mathematics, University of Belgrade
Genetic Algorithms Michael J. Watts
Optimization Problems - Optimization: In the real world, there are many problems (e.g. Traveling Salesman Problem, Playing Chess ) that have numerous possible.
NSF SURE Program, Summer 2002 / Clemson University, Clemson, SC 1 Broadband Arrays and Switching Antennas Dan Palecek, SD School of Mines and Technology,
1 “Genetic Algorithms are good at taking large, potentially huge search spaces and navigating them, looking for optimal combinations of things, solutions.
GENETIC ALGORITHMS.  Genetic algorithms are a form of local search that use methods based on evolution to make small changes to a popula- tion of chromosomes.
Algorithms and their Applications CS2004 ( ) 13.1 Further Evolutionary Computation.
Immune Genetic Algorithms By Jeremy Moreau. References Licheng Jiao, Senior Member, IEEE, and Lei Wang, “A Novel Genetic Algorithm Based on Immunity,”
 Based on observed functioning of human brain.  (Artificial Neural Networks (ANN)  Our view of neural networks is very simplistic.  We view a neural.
Genetic Algorithms What is a GA Terms and definitions Basic algorithm.
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]
Automated discovery in math Machine learning techniques (GP, ILP, etc.) have been successfully applied in science Machine learning techniques (GP, ILP,
GENETIC ALGORITHM Basic Algorithm begin set time t = 0;
Piezoelectric Effect  Sound waves striking a PZ material produce an electrical signal  Can be used to detect sound (and echoes)!
1 Resolution Enhancement Compression- Synthetic Aperture Focusing Techniques Student: Hans Bethe Advisor: Dr. Jose R. Sanchez Bradley University Department.
1 Contents 1. Basic Concepts 2. Algorithm 3. Practical considerations Genetic Algorithm (GA)
Genetic Algorithms. Underlying Concept  Charles Darwin outlined the principle of natural selection.  Natural Selection is the process by which evolution.
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.
Overview Last two weeks we looked at evolutionary algorithms.
1 Comparative Study of two Genetic Algorithms Based Task Allocation Models in Distributed Computing System Oğuzhan TAŞ 2005.
Genetic Algorithms. Solution Search in Problem Space.
EVOLUTIONARY SYSTEMS AND GENETIC ALGORITHMS NAME: AKSHITKUMAR PATEL STUDENT ID: GRAD POSITION PAPER.
Genetic Algorithms And other approaches for similar applications Optimization Techniques.
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 Algorithm (Knapsack Problem)
Using GA’s to Solve Problems
Chapter 14 Genetic Algorithms.
Genetic Algorithms.
An Evolutionary Approach
Balancing of Parallel Two-Sided Assembly Lines via a GA based Approach
An evolutionary approach to solving complex problems
Methods and Materials (cont.)
Presentation transcript:

Ultrasonic Beam-forming with the Genetic Algorithm Andrew Fiss, Vassar College Nathan Baxter, Ohio Northern University Jerry Magnan, Florida State University

We used Genetic Algorithm optimization of sparse array parameters to produce an ultrasonic beam with a higher, narrower main-lobe and lower side-lobes. The solutions obtained are neither unique nor trivial. Abstract

Ultrasonic Transducers: Piezoelectric elements generate sound waves which are used in a variety of applications—non-destructive testing and evaluation of material structure, sonar, diagnostic and therapeutic medicine, etc… Arrays of transducer elements provide advantages over single elements in forming and controlling the ultrasound beam. We explore the beam-shaping properties of sparse ultrasonic transducers by performing an optimization over the array’s structural parameters using a Genetic Algorithm. Background

Genetic Algorithm:  The Genetic Algorithm mimics natural evolution.  Real number strings called “chromosomes” contain parameters that can vary to produce desired results. Our chromosomes contained 63 parameters—30 positions for the 30 “active” elements, 30 apodizations, x-width of the elements, y-width of the elements, and center frequency.  Random initial “chromosomes” are used to populate the system. These “chromosomes” are assigned a “fitness” value based on their proximity to an optimal solution and produce subsequent child “chromosomes” through mutation or recombination operators, which respectively change or rearrange the number strings. Our fitness function is represented as follows: Background (cont.)

main-lobe height side-lobe height width at –3dB  The Field II program was used to generate the pressure fields. (see Method section)  The children replace the majority of the previous generation, leaving only the best parents.

We wanted to shape the beam to have lower side lobes and a higher, narrower main lobe. This combination produces greater clarity in imaging via improved directivity of the beam. Objective

Field II, developed by Jørgen Jensen, was used in generating the pressure data for the beam-patterns, which were observed along the y-axis at x=0 and a fixed z. These beam-patterns were assigned a “fitness” that rewarded higher main-lobes, narrower main-lobes, and lower side-lobes, and the Genetic Algorithm was used as an optimization technique with regular mutation, creep mutation, uniform list crossover, and average crossover operators. The solutions consisted of 30 active elements in a 30-by-30 array, with width and height constrained to lie between and, a center frequency between 1 MHz and 15MHz, and apodization varying between 0 and 1. Method

After 30 generations, the Genetic Algorithm improved the beam-pattern from a main-lobe height of 3.944× barr to × barr, a main- lobe width at -3 dB of 1.95mm to 1.35mm, and a side-lobe height of × barr to × barr (see figures). However, the algorithm converges quickly for this optimization problem (see figure), so similar results can be obtained after just five generations (see figures). The best configuration of a batch of 5,000 random chromosomes is presented, thus showing that similar beam-patterns could not be obtained through random generation. This is not surprising, since there are ~10 55 possible arrangements of transducer element positions. Also, one might expect a trivial solution to be a dense transducer, such as a large, single element, but that is not the case (see figure). Results

*Equations

*Equations (cont.)

Ultrasonic beams can be effectively shaped through use of the Genetic Algorithm, and the solution is neither trivial nor unique. Conclusion

In future work, we would like to try asymmetric beam forming and apodization reconfiguration with fixed positions in a sparse array. We would also try different optimization techniques and more precise programs for pressure calculations, and we would like to explore further the characteristics of the optimization problems through different Genetic Algorithm structure and operators. Future work

For more information, see Samuel Temkin’s Elements of Acoustics, Jon Mathews and R.L. Walker’s Mathematical Methods of Physics, or J  rgen Arendt Jensen’s “Calculation of Pressure Fields from Arbitrarily Shaped, Apodized, and Excited Ultrasound Transducers” published in the March 1992 edition of the IEEE Transactions on Ultrasonics, Ferroelectrics, and Frequency Control. References