Automatic Synthesizer Preset Generation with PresetGen

Slides:



Advertisements
Similar presentations
Dependability analysis and evolutionary design optimisation with HiP-HOPS Dr Yiannis Papadopoulos Department of Computer Science University of Hull, U.K.
Advertisements

ADBIS 2007 Aggregating Multiple Instances in Relational Database Using Semi-Supervised Genetic Algorithm-based Clustering Technique Rayner Alfred Dimitar.
Topic Outline ? Black-Box Optimization Optimization Algorithm: only allowed to evaluate f (direct search) decision vector x objective vector f(x) objective.
Non-dominated Sorting Genetic Algorithm (NSGA-II)
MOEAs University of Missouri - Rolla Dr. T’s Course in Evolutionary Computation Matt D. Johnson November 6, 2006.
Angers, 10 June 2010 Multi-Objective Optimisation (II) Matthieu Basseur.
Using Parallel Genetic Algorithm in a Predictive Job Scheduling
Constructing Complex NPC Behavior via Multi- Objective Neuroevolution Jacob Schrum – Risto Miikkulainen –
Synthesis. What is synthesis? Broad definition: the combining of separate elements or substances to form a coherent whole. (
MassConf: Automatic Configuration Tuning By Leveraging User Community Information Computer Science Wei Zheng, Ricardo Bianchini, Thu Nguyen Rutgers University.
EMBIO – Cambridge Particle Swarm Optimization applied to Automated Docking Automated docking of a ligand to a macromolecule Particle Swarm Optimization.
Design of Autonomous Navigation Controllers for Unmanned Aerial Vehicles using Multi-objective Genetic Programming Gregory J. Barlow March 19, 2004.
Solar Car Strategy An evolutionary algorithm using the Strength Pareto approach Srinivas ‘jack’ Jakkidi.
Resource Allocation Problem Reporter: Wang Ching Yu Date: 2005/04/07.
PH 105 Dr. Cecilia Vogel Lecture 12. OUTLINE  Timbre review  Spectrum  Fourier Synthesis  harmonics and periodicity  Fourier Analysis  Timbre and.
A New Algorithm for Solving Many-objective Optimization Problem Md. Shihabul Islam ( ) and Bashiul Alam Sabab ( ) Department of Computer Science.
Optimal Arrangement of Ceiling Cameras for Home Service Robots Using Genetic Algorithms Stefanos Nikolaidis*, ** and Tamio Arai** *R&D Division, Square.
SINGLE CHANNEL SPEECH MUSIC SEPARATION USING NONNEGATIVE MATRIXFACTORIZATION AND SPECTRAL MASKS Jain-De,Lee Emad M. GraisHakan Erdogan 17 th International.
Evolutionary Multi-objective Optimization – A Big Picture Karthik Sindhya, PhD Postdoctoral Researcher Industrial Optimization Group Department of Mathematical.
Music Tech Away Day 2012 Jonathan P Wakefield Overview of current research supervisions: Mark Mynett – PhD p/t - Music Production for Contemporary Metal.
SYNTHESIS BY EXAMPLE Creation of sound synthesis algorithms using evolutionary methods By: Ricardo A. García MIT - Media Lab Machine.
Example II: Linear truss structure
Community Evolution in Dynamic Multi-Mode Networks Lei Tang, Huan Liu Jianping Zhang Zohreh Nazeri Danesh Zandi & Afshin Rahmany Spring 12SRBIAU, Kurdistan.
Copyright 2004 Ken Greenebaum Introduction to Interactive Sound Synthesis Lecture 11: Modulation Ken Greenebaum.
Optimization of the ESRF upgrade lattice lifetime and dynamic aperture using genetic algorithms Nicola Carmignani 11/03/2015.
Robin McDougall Scott Nokleby Mechatronic and Robotic Systems Laboratory 1.
Fuzzy Genetic Algorithm
The Fundamentals: Algorithms, the Integers & Matrices.
Audio Tempo Extraction Presenter: Simon de Leon Date: February 9, 2006 Course: MUMT611.
DIVERSITY PRESERVING EVOLUTIONARY MULTI-OBJECTIVE SEARCH Brian Piper1, Hana Chmielewski2, Ranji Ranjithan1,2 1Operations Research 2Civil Engineering.
Sampling BTEC Level 3 Extended Diploma in Music Technology Year 1 Sound Creation & Manipulation Modulation – LFOs & Envelopes.
Top-K Generation of Integrated Schemas Based on Directed and Weighted Correspondences by Ahmed Radwan, Lucian Popa, Ioana R. Stanoi, Akmal Younis Presented.
Evolutionary Computing Chapter 12. / 26 Chapter 12: Multiobjective Evolutionary Algorithms Multiobjective optimisation problems (MOP) -Pareto optimality.
12-3 Harmonics.
Multi-cellular paradigm The molecular level can support self- replication (and self- repair). But we also need cells that can be designed to fit the specific.
Evolutionary Computation Evolving Neural Network Topologies.
ZEIT4700 – S1, 2016 Mathematical Modeling and Optimization School of Engineering and Information Technology.
Evolutionary Computation: Advanced Algorithms and Operators
Alan P. Reynolds*, David W. Corne and Michael J. Chantler
Memory Segmentation to Exploit Sleep Mode Operation
Department of Computer Science
USING MICROBIAL GENETIC ALGORITHM TO SOLVE CARD SPLITTING PROBLEM.
The Design and Analysis of Algorithms
Seung-won Hwang, Kevin Chen-Chuan Chang
MultiRefactor: Automated Refactoring To Improve Software Quality
Pitch.
OPTIMAL DESIGN OF CLUTCH FRICTION PAD
Reading Assignments Principles of Traditional Animation Applied to 3D Computer Animation, by J. Lasseter, Proc. of ACM SIGGRAPH 1987 Computer Animation:
Heuristic-based Recommendation for Metamodel–OCL Coevolution
Plan Introduction to multilevel heuristics Rich partitioning problems
Objective of This Course
Modifiable Attribute Cell Problem and a Method of Solution for Population Synthesis in Land-Use Microsimulation Noriko Otani (Tokyo City University)
Combatant Design and Fleet Mix Assessment and Optimisation using BAEFASIP Dstl/CP Chris Brett, Dstl, UK Dr Malcolm Courts, BAE Systems Maritime,
A New multi-objective algorithm: Pareto archived dds
Multi-Objective Optimization
Genetic Algorithms CSCI-2300 Introduction to Algorithms
Unit-4: Dynamic Programming
Doshisha Univ., Kyoto Japan
“Hard” Optimization Problems
Efficient Approaches to Scheduling
Chen-Yu Lee, Jia-Fong Yeh, and Tsung-Che Chiang
Lecture 16: Register Allocation
Presenter: Simon de Leon Date: March 2, 2006 Course: MUMT611
Multi-Objective Optimization for Finite Element Analysis
RM-MEDA: A Regularity Model-Based Multiobjective Estimation of Distribution Algorithm BISCuit EDA Seminar
MOEA Testing and Analysis
Artificial Intelligence CIS 342
Evolutionary Ensembles with Negative Correlation Learning
Emad M. Grais Hakan Erdogan
CS639: Data Management for Data Science
Presentation transcript:

Automatic Synthesizer Preset Generation with PresetGen Kıvanç Tatar, Matthieu Macret, Philippe Pasquier ENGAGING THE WORLD

The preset generation problem Modern synthesizers are very powerful and have many parameters resulting in a vast and complex search space. The possibilities of a given synthesizer are unknowns and the search space is beyond human grasp. Preset search is time-consuming and tedious. Musicians and sound designers spend time tuning parameters instead of making music. The solution found might not be optimal OP-1 : several synthesis engines FX LFO We want to automate preset generation: Given a target sound, and a synthesizer, give me a preset for that sound.

Example synthesizer: the OP-1 The OP-1 is a commercial synthesizer that has a very large presets search space: 7 synthesis engines 3 types of LFO (Low frequency oscillators) 4 types of special effects 120 keys The total number of distinct presets is of the order of 1076 Added challenges: The space is highly discontinuous and the synthesis engines are non-deterministic (adding warmth to the sound). Each with 4 parameters with 32767 possible values each Number of particles in the universe is estimated between 10^72 and 10^87 .

Our solution: PresetGen We use evolutionary algorithms to locate multiple distinct OP-1 presets to replicate a given target sound We minimize the 3 objectives distances (Envelope, FFT, STFT) using a multi-objective genetic algorithm: the Non- dominated Sorting Genetic Algorithm-II (NSGA-II) NSGA-II Target sound ... OP-1 presets

1st Objective: Temporal envelope distance Target sound Euclidian distance OP-1 generated sound

2nd objective: FFT distance for spectral signature Spectral analysis of the sound. Compute on the entire sound

3rd objective: STFT distance for spectral content dynamic FFT on some time frames of the sounds. Each horizontal line in this graph represent the FFT at a given time t.

Results 3. We cluster the Pareto front 1. We analyse the target sound 2. We evolve presets 4. We return a variety of presets that approximate the target sound using various synthesis methods!

Examples Target sound Engine FX LFO Key Octave Cluster Inactive 12 Engine FX LFO Key Octave Cluster Punch Inactive 1 Engine FX LFO Key Octave FM Grid Element 1

Examples of instruments Piano Engine FX LFO Key Octave String Delay Tremolo 44 1 Clarinet Add number of presets Engine FX LFO Key Octave Digital Delay Tremolo 9 1

Empirical Evaluation PresetGen compared to human sound designers. 8 target sounds: 3 human sound designer 14 auditors judge similarity across dimensions. Results: PresetGen sounds rated more similar to target (avg 17%) PresetGen outperform humans at the task both in competency and efficiency.

In Conclusion: PresetGen automates a creative task to human competitive levels and would fit well at a computer-assisted creativity tools in many synthesizers. DEAP NSERC logo Teenage engineering logo Westgrid logo DEAP logo