|
| |
|
|
Genetic Programming for Design of Digital Circuits
Hejtmánek, Michal ; Bidlo, Michal (referee) ; Gajda, Zbyšek (advisor)
The goal of this work was the study of evolutionary algorithms and utilization of them for digital circuit design. Especially, a genetic programming and its different manipulation with building blocks is mentioned in contrast to a genetic algorithm. On the basis of this approach, I created and tested a hybrid method of electronic circuit design. This method uses spread schemes according to the genetic algorithm for the pattern problems witch are solved by the genetic programming. The method is more successful and have faster convergence to a solution in difficult electronic circuits design than a common algorithm of the genetic programming.
|
|
|
Boosting and Evolution
Mrnuštík, Michal ; Juránek, Roman (referee) ; Hradiš, Michal (advisor)
This thesis introduces combination of the AdaBoost and the evolutionary algorithm. The evolutionary algorithm is used to find linear combination of Haar features. This linear combination creates the feature to train weak classifier for AdaBoost. There are described basics of classification, Haar features and the AdaBoost. Next there are basic information about evolutionary algorithms. Theoretical description of combination of the AdaBoost and the evolutionary algorithm is included too. Some implementation details are added too. Implementation is tested on the images as part of the system for face recognition. Results are compared with Haar features.
|
|
|
Comparison of Classification Methods
Dočekal, Martin ; Zendulka, Jaroslav (referee) ; Burgetová, Ivana (advisor)
This thesis deals with a comparison of classification methods. At first, these classification methods based on machine learning are described, then a classifier comparison system is designed and implemented. This thesis also describes some classification tasks and datasets on which the designed system will be tested. The evaluation of classification tasks is done according to standard metrics. In this thesis is presented design and implementation of a classifier that is based on the principle of evolutionary algorithms.
|
|
|
Coevolutionary Algorithms Statistical Analysis Tool
Urban, Daniel ; Zachariášová, Marcela (referee) ; Drahošová, Michaela (advisor)
This bachelor thesis contains a theoretical basis that introduces evolutionary algorithms, genetic programming, coevolutioanary algorithms and methods for statistical evaluation. Furthermore, this work deals with the design and implementation of tool with graphical user interface, which allows the analysis of coevolutioanary algorithm for various parameters and also its statistical evaluation. The functionality of the implemented tool has been tested on data obtained from an external program performing evolutionary design of image filters with the use of the coevolution of tness predictors. The resulting graphs and statistics allow easy comparison of the progress and results for each program run.
|
|
|
Evolution of CoreWar Warriors by Means of Genetic Algorithms
Tříska, Martin ; Beran, Vítězslav (referee) ; Zuzaňák, Jiří (advisor)
Evolutionary algorithms are a progressive and constantly evolving part of computer science. They are used mainly to solve the multidimensional problems with many local maxima, which are impossible to solve analytically. This thesis discusses how to use them for creating programs in Redcode language, which will be able to fight by the rules of game Corewars. Suggests possible representations of programs written in Redcode for evolutionary algorithms, discusses platform for evaluating their fitness and possible implementations of crossover and mutation. This thesis also contains application capable of development of such programs.
|
|
|
Evolutionary Design Using Rewriting Systems
Nétková, Barbora ; Hyrš, Martin (referee) ; Bidlo, Michal (advisor)
This master’s thesis proposes a method for the evolutionary design of rewriting systems. In particular, genetic algorithm will be applied to design rewriting rules for a specific variant of Lindenmayer system. The evolved rules of such grammar will be applied to generate growing sorting networks. Some distinct approaches to the rewriting process and construction of the sorting networks will be investigated. It will be shown that the evolution is able to successfully design rewriting rules for the proposed variants of rewriting processes. The results obtained exhibit abilities to successfully create partially growing sorting networks, which was evolved to grow for fewer inputs and in subsequent iterations grows up to 36 inputs.
|
|
|
Evolution algorithms for ultrasound perfusion analysis
Kolářová, Jana ; Odstrčilík, Jan (referee) ; Mézl, Martin (advisor)
This master´s thesis is focused on the application of evolutionary algorithms for interleaving data obtained by ultrasound scanning of tissue. The interleaved curve serves to estimate perfusion parameters, thus allowing to detect possible pathophysiology in the scanned area. The theoretical introduction is devoted to perfusion and its parameters, contrast agents for ultrasonic application, ultrasonic modality scanning, optimization, evolutionary algorithms in general and two selected evolutionary algorithms - genetic algorithm and bee algorithm. These algorithms were tested on noisy data obtained from clinical images of mice with tumor. The final part summarizes the results of the practical part and provides suggestions and recommendations for further possible development.
|
|
|
Automated Design Methodology for Approximate Low Power Circuits
Mrázek, Vojtěch ; Bosio, Alberto (referee) ; Fišer, Petr (referee) ; Sekanina, Lukáš (advisor)
Rozšiřování moderních vestavěných a mobilních systémů napájených bateriemi zvyšuje požadavky na návrh těchto systémů s ohledem na příkon. Přestože moderní návrhové techniky optimalizují příkon, elektrická spotřeba těchto obvodů stále roste díky jejich složitosti. Nicméně existuje celá řada aplikací, kde nepotřebujeme získat úplně přesný výstup. Díky tomu se objevuje technika zvaná aproximativní (přibližné) počítání, která umožňuje za cenu zanesení malé chyby do výpočtu významně redukovat příkon obvodů. V práci se zaměřujeme na použití evolučních algoritmů v této oblasti. Ačkoliv již tyto algoritmy byly úspěšně použity v syntéze přesných i aproximativních obvodů, objevují se problémy škálovatelnosti - schopnosti aproximovat složité obvody. Cílem této disertační práce je ukázat, že aproximační logická syntéza založená na genetickém programování umožňuje dosáhnout vynikajícího kompromisu mezi spotřebou a chybou. Byla provedena analýza čtyř různých aplikacích na třech úrovních popisu. Pomocí kartézského genetického programování s modifikovanou reprezentací jsme snížili spotřebu malých obvodů popsaných na úrovni tranzistorů použitelných například v technologické knihovně. Dále jsme zavedli novou metodu pro aproximaci aritmetických obvodů, jako jsou sčítačky a násobičky, popsaných na úrovni hradel. S využitím metod formální verifikace navíc celý návrhový proces umožňuje garantovat stanovenou chybu aproximace. Tyto obvody byly využity pro významné snížení příkonu v neuronových sítích pro rozpoznávání obrázků a v diskrétní kosinově transformaci v HEVC kodéru. Pomocí nové chybové metriky nezávislé na rozložení vstupních dat jsme navrhli komplexní aproximativní mediánové filtry vhodné pro zpracování signálů. Disertační práce reprezentuje ucelenou metodiku pro návrh aproximativních obvodů na různých úrovních popisu, která navíc garantuje nepřekročení zadané chyby aproximace.
|
|
|
Implementation of wavelet transform in C++
Valouch, Lukáš ; Hasmanda, Martin (referee) ; Beneš, Radek (advisor)
The aim of this thesis is implementation of wavelet transform algorithm for noise reduction. The noise reduction itself is focused on improving informative capabilities of sonographic (ultrasound) images in medicine. For this purpose, thresholding of detailed coefficients on individual levels of multiresolution analysis was used. Common procedures were not used for searching for the most suitable thresholds of those levels. The alternative concept's design is based on fundamental empirical approach, where the individual thresholds are optimised by evolution algorithms. However, with this algorithmic procedure, more problems manifest regarding the objective evaluation of the success of noise reduction. Because of this, the program uses commonly used parameters such as mean square error of the whole image, linear slope edge approximation, relative contrast of two differently bright and distinct points and the standard deviation of compact surface. Described theoretical knowledge is used in developed application DTWT. It executes multilevel decomposition and reversed reconstruction by discrete time wavelet transform, thresholding of detailed coefficients and final evaluation of performed noise reduction. The developed tool can be used separately to reduce noise. For our purposes, it has been modified in way, that it executed through the component for evolutionary optimization of parameters (Optimize Parameters) in created scenario in RapidMiner program. In the optimization process, this component used evaluation received from DTWT program as fitness function. Optimal thresholds were sought separately for three wavelet families - Daubeschies, Symmlets and Coiflets. The evolution algorithm chose soft threshold for all three wavelet families. In comparison to hard threshold, it is more suitable for noise reduction, but it has tendencies to blur the edges more. The devised method had in most cases greater evaluated success of noise reduction with wavelet transform with threshold search done by evolution algorithms, than commonly used filters. In visual comparison however the wavelet transform introduced some minor depreciating artefacts into the image. It is always about compromise between noise reduction and maximal preservation of image information. Objectively evaluating this dilemma is not easy and is always dependant on subjective viewpoint which in case of sonographic images is that of the attending physician.
|
guest ::
