1 Listen to the next generation of Beethoven’s compositions: Digital music generator using fractal and genetic crossover concepts FractalsGeneMatrixResultsConclusions.

Slides:



Advertisements
Similar presentations
© Negnevitsky, Pearson Education, Lecture 12 Hybrid intelligent systems: Evolutionary neural networks and fuzzy evolutionary systems Introduction.
Advertisements

Crew Pairing Optimization with Genetic Algorithms
Intelligent Control Methods Lecture 12: Genetic Algorithms Slovak University of Technology Faculty of Material Science and Technology in Trnava.
1 Transportation problem The transportation problem seeks the determination of a minimum cost transportation plan for a single commodity from a number.
Tetris and Genetic Algorithms Math Club 5/30/2011.
Genetic Algorithms Contents 1. Basic Concepts 2. Algorithm
1 Wendy Williams Metaheuristic Algorithms Genetic Algorithms: A Tutorial “Genetic Algorithms are good at taking large, potentially huge search spaces and.
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.
Iterative Improvement Algorithms
COMP305. Part II. Genetic Algorithms. Genetic Algorithms.
Genetic Algorithms Learning Machines for knowledge discovery.
COMP305. Part II. Genetic Algorithms. Genetic Algorithms.
Intro to AI Genetic Algorithm Ruth Bergman Fall 2002.
Genetic Art. Network Record Using Network Information Chicago Evanston ParisMoscow.
Intro to AI Genetic Algorithm Ruth Bergman Fall 2004.
Brandon Andrews.  What are genetic algorithms?  3 steps  Applications to Bioinformatics.
Genetic Programming.
Genetic Algorithms: A Tutorial
Evolutionary Intelligence
Home entertainment. The hardware, software and techniques used for sound MP3 players: play music files stored digitally in MP3 file format are small and.
Slides are based on Negnevitsky, Pearson Education, Lecture 12 Hybrid intelligent systems: Evolutionary neural networks and fuzzy evolutionary systems.
C. Benatti, 3/15/2012, Slide 1 GA/ICA Workshop Carla Benatti 3/15/2012.
Soft Computing Lecture 18 Foundations of genetic algorithms (GA). Using of GA.
Schemata Theory Chapter 11. A.E. Eiben and J.E. Smith, Introduction to Evolutionary Computing Theory Why Bother with Theory? Might provide performance.
1 The Euclidean Non-uniform Steiner Tree Problem by Ian Frommer Bruce Golden Guruprasad Pundoor INFORMS Annual Meeting Denver, Colorado October 2004.
CS 484 – Artificial Intelligence1 Announcements Lab 3 due Tuesday, November 6 Homework 6 due Tuesday, November 6 Lab 4 due Thursday, November 8 Current.
By Prafulla S. Kota Raghavan Vangipuram
Boltzmann Machine (BM) (§6.4) Hopfield model + hidden nodes + simulated annealing BM Architecture –a set of visible nodes: nodes can be accessed from outside.
Genetic algorithms Charles Darwin "A man who dares to waste an hour of life has not discovered the value of life"
RoBach A Case Study in the Use of Genetic Algorithms for Automatic Music Composition.
Genetic Algorithms Genetic algorithms imitate a natural optimization process: natural selection in evolution. Developed by John Holland at the University.
ART – Artificial Reasoning Toolkit Evolving a complex system Marco Lamieri
Genetic Algorithms Introduction Advanced. Simple Genetic Algorithms: Introduction What is it? In a Nutshell References The Pseudo Code Illustrations Applications.
1 “Genetic Algorithms are good at taking large, potentially huge search spaces and navigating them, looking for optimal combinations of things, solutions.
Soft Computing A Gentle introduction Richard P. Simpson.
Derivative Free Optimization G.Anuradha. Contents Genetic Algorithm Simulated Annealing Random search method Downhill simplex method.
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.
© Negnevitsky, Pearson Education, Lecture 9 Evolutionary Computation: Genetic algorithms Introduction, or can evolution be intelligent? Introduction,
Exact and heuristics algorithms
A n = c 1 a n-1 + c2an-2 + … + c d a n-d d= degree and t= the number of training data (notes) The assumption is that the notes in the piece are generated.
Introduction to Genetic Algorithms. Genetic Algorithms We’ve covered enough material that we can write programs that use genetic algorithms! –More advanced.
Evolutionary Algorithms K. Ganesh Research Scholar, Ph.D., Industrial Management Division, Humanities and Social Sciences Department, Indian Institute.
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;
Signatures and Earmarks: Computer Recognition of Patterns in Music By David Cope Presented by Andy Lee.
N- Queens Solution with Genetic Algorithm By Mohammad A. Ismael.
GAIA (Genetic Algorithm Interface Architecture) Requirements Analysis Document (RAD) Version 1.0 Created By: Charles Hall Héctor Aybar William Grim Simone.
Neural Networks And Its Applications By Dr. Surya Chitra.
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.
Unit 01 - Set up and operate a digital audio workstation.
Artificial Intelligence By Mr. Ejaz CIIT Sahiwal Evolutionary Computation.
Genetic Algorithms. Solution Search in Problem Space.
Genetic Algorithm. Outline Motivation Genetic algorithms An illustrative example Hypothesis space search.
 Presented By: Abdul Aziz Ghazi  Roll No:  Presented to: Sir Harris.
Presented By: Farid, Alidoust Vahid, Akbari 18 th May IAUT University – Faculty.
Hirophysics.com The Genetic Algorithm vs. Simulated Annealing Charles Barnes PHY 327.
 Negnevitsky, Pearson Education, Lecture 12 Hybrid intelligent systems: Evolutionary neural networks and fuzzy evolutionary systems n Introduction.
Genetic (Evolutionary) Algorithms CEE 6410 David Rosenberg “Natural Selection or the Survival of the Fittest.” -- Charles Darwin.
Computer-Generated Sound Final Project
Sound and music.
An Evolutionary Approach
CSC 380: Design and Analysis of Algorithms
Boltzmann Machine (BM) (§6.4)
A Gentle introduction Richard P. Simpson
Stephen Andersen, Aaron Schuman, Lee Ingram Jonathan Peard
CSC 380: Design and Analysis of Algorithms
Presentation transcript:

1 Listen to the next generation of Beethoven’s compositions: Digital music generator using fractal and genetic crossover concepts FractalsGeneMatrixResultsConclusions

2 What Are Fractals ? FractalsGeneMatrixConclusionsResults Fractals have the property of similarity within diversified changes. They are similar in any section and direction.

3 Sierpinski Gasket FractalsGeneMatrixConclusionsResults

4 Sierpinski Carpet FractalsGeneMatrixConclusionsResults

5 Sierpinski Gasket FractalsGeneMatrixConclusionsResults

6 Sierpinski GasketSierpinski CarpetSierpinski Pentagon Sierpinski HexagonCantor SquareBox Fractal FractalsGeneMatrixConclusionsResults

7 Fractal Music - Melody FractalsGeneMatrixConclusionsResults

8 The Genetic Crossover Method was proposed by John H. Holland, a professor from the University of Michigan, in 1975 [6]. It was based on the concept of “Survival of the fittest”, he created an environment that allows chromosomes to crossover and produce genes of the best possible recombination. What are Genetic Crossover Concepts (GCC) ? FractalsGeneMatrixConclusionsResults

9 Fractal Music - Beats FractalsGeneMatrixConclusionsResults

10 Fractal Music - Beats FractalsGeneMatrixConclusionsResults

11 This study selected parent music that is “pleasant to ears” such that “the music similarity with parent music” is used as the basis of judgment, offspring generation music similar with the characteristics of parent music, will be generated (“music similarity” here refers to the relative note length position) to eliminate “different” offspring. It is thought that more pleasant music will then be composed. Imitated Parent Judgment (IPJ) FractalsGeneMatrixConclusionsResults

12 Definitions of “Imitated Parent Judgment Function” A is the assembly of note pitch sequence of initial notes ; A = { a 1, a 2, a a n } B is the assembly of note pitch sequence of next generation; B= { b 1, b 2, b b n } Flag i refers to the determinant Boolean constant of Rule i ; V t is the total vote V i is the vote provided by each rule MAX( A ) is the maximum value of the sequence; min(A) is the minimum value of the sequence; and Mid(A) is the average of the sequence. FractalsGeneMatrixConclusionsResults

13 The position of the maximum note length of the immediate offspring generation corresponds to that of the parent note. If a M = MAX( A ) And b M = MAX( B ) Then Flag 1 = True V t =V t +V 1 FractalsGeneMatrixConclusionsResults

14 The position of the minimum note length of the immediate offspring generation corresponds to that of the parent note. If a m = min( A ) And b m = min( B ) Then Flag 2 = True V t =V t +V 2 FractalsGeneMatrixConclusionsResults

15 The position of the second maximum note length of the immediate offspring generation corresponds to that of the parent note. If a M = MAX( A ), a S = MAX( A – { a M }) And b M = MAX( B ), b S = MAX( B – {b M }) Then Flag 3 = True V t =V t +V 3 FractalsGeneMatrixConclusionsResults

16 The position of the medium note length of the immediate offspring generation corresponds to that of the parent note. If a k = Mid( A ) And b k = Mid( B ) Then Flag 4 = True V t =V t +V 4 FractalsGeneMatrixConclusionsResults

17 The sum of the relative deviance value of the immediate offspring generation note and parent note is smaller than the first critical value. If ∑ | a i - b i | < T 1 Then Flag 5 = True V t =V t +V 5 Where T 1 is the first threshold value. FractalsGeneMatrixConclusionsResults

18 The sum of deviance value of relative fluctuation of the immediate offspring generation note and the parent note is smaller than the second critical value. Let c t = a t - a t -1 d t = b t - b t-1 ( 2  t  n) If ∑ | c i - d i | < T 2 Then Flag 6 = True V t =V t +V 6 Where T 2 is the second threshold value. FractalsGeneMatrixConclusionsResults

19 Production procedure for the generation of fractal music FractalsGeneMatrixConclusionsResults

20 Screen Window of fractals and program used for the creation of digital music FractalsGeneMatrixConclusionsResults

21 Test listening result of digital music of this study ResultsNot GoodGood Melody143.9%56.1% Melody 227.2%72.8 % Melody 336.7%63.3 % FractalsGeneMatrixConclusionsResults

22 Ratio of Poor Response to Melodies Generated by Different Methods MethodPoor Response Ratio Random Selection92.2% Fractal Iterated Function Systems and Genetic Algorithm Method 61.8% Fractal Iterated Function Systems, Genetic Algorithm Method, and Imitated Parent Method 14.6% FractalsGeneMatrixConclusionsResults

23 Think of it! If we enter a piece of music, for example Mozart’s Concerto No. 24 into a type of function system, will it become possible for us to generate the output of Concerto No. 25 or might we end up having another music style such as that of Beethoven? Although this may sound weird, it is undeniably, a very interesting thought. Conclusions FractalsGeneMatrixConclusionsResults

24 In the future, it is quite possible that with the assistance of computer aided interface, composers can more easily finish their digital music. Furthermore, it is also the hope of this study that we are able to determine the direct relationship between “great music” and mathematics. Conclusions FractalsGeneMatrixConclusionsResults

25 Future Improvement FractalsGeneMatrixConclusionsResults A. Processing for any MIDI format; B. Automatic generation of Track 2 and Track 3 for vocal harmony and music accompaniment; C. Determinant mechanism extends “imitated parent. D. The possibility to add “mutation” in genetic crossover. E. Adding “crossover between beats” in crossover method. F. Connecting to external input equipment such as note input from keyboard and human voice input from microphone.

26 1.Rob Eastanway (Translated by Tsai Cheng-chi), How Long is a Piece of String: More Hidden Mathematics of Everyday Life, Trafalgar Square Publishing Ltd, Stewart, Ian. Four Encounters with Sierpinski's Gasket, The Mathematical Intelligencer, 17, No. 1, 1995, p Wu Wen-chen, Fractal, complex/ fractals/index.html 4.Chao Peng-chen, Theory and Application of Genetic Algorithm, CHWA Publishing, Goldberg, D, E., Genetic Function systems in Search, Optimization, and Machine Learning, Addison-Wesley, New York, Lin Chern-sheng, Digital Signal-Image and Sound Processing, CHWA Publishing, 1997 References

27