| |
|
Test Application Methodology Based On the Identification of Testable blocks
Herrman, Tomáš ; Plíva, Zdeněk (referee) ; Racek, Stanislav (referee) ; Kotásek, Zdeněk (advisor)
The PhD thesis deals with the analysis of digital systems described on RT level. The methodology of data paths analysis is decribed, the data path controller analysis is not solved in the thesis. The methodology is built on the concept of Testable Block (TB) which allows to divide digital component to such segments which can be tested through their inputs/outputs, border registers and primary inputs/outputs are used for this purpose. As a result, lower number of registers is needed to be included into scan chain - border registers are the only ones which are scanned. The segmentation allows also to reduce the volume of test vectors, tests are generated for segments, not for the complete component. To identify TBs, two evolutionary algorithms are used, they operate on TB formal model which is also defined in the thesis.
|
|
Image registration using evolutionary algorithms
Kubalová, Eva ; Kozumplík, Jiří (referee) ; Mézl, Martin (advisor)
The diploma thesis deals with the image registration using evolutionary algorithms from metaheuristic optimization techniques which are considered recent and widely used. The frst part of the thesis contains theoretical description of components in image registration and later focuses on the ultrasound images. In that part, the thesis explains chosen evolutionary algorithms. Three optimization methods have been implemented, in particular genetic algorithm, particle swarm optimization and frey algorithm. Chosen similarity metrics for optimization are sum of squared dierences, cosine similarity and correlation coefcient. The main part of thesis includes testing of proposed methods with the evaluation of obtained results. These parameters are later used for optimization of real ultrasound sequences obtained by the contrast imaging.
|
| |
|
The GPU-Based Acceleration of the Genetic Algorithm
Pospíchal, Petr ; Šimek, Václav (referee) ; Jaroš, Jiří (advisor)
This thesis represents master's thesis focused on acceleration of Genetic algorithms using GPU. First chapter deeply analyses Genetic algorithms and corresponding topics like population, chromosome, crossover, mutation and selection. Next part of the thesis shows GPU abilities for unified computing using both DirectX/OpenGL with Cg and specialized GPGPU libraries like CUDA. The fourth chapter focuses on design of GPU implementation using CUDA, coarse-grained and fine-grained GAs are discussed, and completed by sorting and random number generation task accelerated by GPU. Next chapter covers implementation details -- migration, crossover and selection schemes mapped on CUDA software model. All GA elements and quality of GPU results are described in the last chapter.
|
|
Segmentation of optic disc in retinal image data
Juráček, Radek ; Mézl, Martin (referee) ; Odstrčilík, Jan (advisor)
This bachelor thesis is focused on the algorithm of automatic detection of the optical disk in retinal images. It briefly describes the anatomy of the human eye and the principles of scanning the ocular background. The following describes the optical disk segmentation methods. Selected methods are implemented in MATLAB and optimized using a genetic algorithm. A total of five methods were introduced and optimized on the HRF dataset and two experimental datasets.
|
| |
|
Lubricant Gap Shape Optimization of the Hydrodynamic Thrust Bearing
Ochulo, Ikechi ; Vacula, Jiří (referee) ; Novotný, Pavel (advisor)
Cílem této diplomové práce je najít optimální profil mezery mazání pro turbodmychadlo. Cílem je minimalizovat tření, udržovat nosnost a nezvyšovat průtok maziva. Tato multiobjektivní optimalizace se provádí pomocí genetického algoritmu (GA) v MATLABu. Minimalizace třecí síly snižuje ztráty třecího výkonu turbodmychadla. Řešení Reynoldsovy rovnice je počítáno numericky pomocí MATLABu. Je zjištěna minimální tloušťka mazací mezery pro počáteční problém. Funkce spline se používá ke generování obecného profilu mazací mezery. Tento profil je poté optimalizován pomocí GA v MATLABu.
|
|
Linear crane trajectory design and control
Krakovský, Jozef ; Appel, Martin (referee) ; Bastl, Michal (advisor)
This thesis deals with control of linear bridge cranes using three selected methods. In theoretical part, it gives information about basic structure of each selected algorithm and basic mathematical relations. In the middle, control of algorithms is simulated using created simulation programs in MATLAB. After that, the algorithms are applied on laboratory model of linear crane and in the end all of them are evaluated according to achieved results.
|
|
Evolutionary Design of Ultrasound Treatment Plans
Masárová, Mária ; Sekanina, Lukáš (referee) ; Jaroš, Jiří (advisor)
Použitie zameraného ultrazvuku pomáha zachraňovať a uľahčovať ľudské životy, nakoľko práve jeho využitím môžeme liečiť epilepsiu, ničiť rakovinové bunky a zastavovať vnútorné krvácanie neinvazívnou cestou, ktorá predstavuje pre človeka prijateľnejšie a bezpečnejšie riešenie. Vzhľadom na to, že bezpečnosť a zdravie človeka je prioritou pri liečení závažných ochorení, sa táto práca zaoberá porovnaním rôznych evolučných algoritmov a ich použitím pri návrhu evolučných ultrazvukových operačných plánov. V práci sa využívajú dva typy médií, a to homogénne médium a heterogénne médium. Pri vyhodnocovaní algoritmov sa zameriavame na efektivitu s ohľadom na veľkosť populácie, počet evaluácií fitness funkcie a výpočetný čas. V homogénnom médiu sa ako najlepší algoritmus ukázal CMA-ES, ktorý v priebehu 20 sekúnd dokázal nájsť optimálne riešenie so 100% pokrytím cieľovej oblasti pre rotované zrnko ryže. Heterogénne médium je ale oveľa zložitejší problém, predovšetkým kvôli lebke, ktorá odráža a pohlcuje veľkú časť ultrazvuku. Tu sa ako najlepší preukázal algoritmus SA, ktorý našiel výsledok s 23% pokrytím cieľovej oblasti v prvom testovacom scenári. Doba výpočtu trvala približne 1 hodinu a 18 minút, čo značí že je čas veľmi znemožňujúci ("drahý") faktor.
|