|
|
Algorithms for Detection and Correction of Local Degradations in Digital Audio Signals
Kúdela, Jakub ; Toropila, Daniel (advisor) ; Petříček, Martin (referee)
Title: Algorithms for Detection and Correction of Local Degradations in Digital Audio Signals Author: Jakub K'udela Author's e-mail address: jakub.kudela@gmail.com Department: Department of Theoretical Computer Science and Mathematical Logic Thesis Supervisor: Mgr. Daniel Toropila Supervisor's e-mail address: daniel.toropila@mff.cuni.cz Abstract: Local degradations in audio signal are discontinuities in their wave- forms. They are caused by the nature of the recording process, or by aging of or damage to the recording medium. In many cases these discontinuities are un- wanted while listening, and so there exists a number of methods, whose aim is to restore degraded recordings. In the introduction, this thesis informs the reader about selected algorithms for detection and correction of local degradations in digital audio signals. One of the discussed algorithms is a custom aplication of artificial neural networks to the given problem. The implementation of selected algorithms and experiments are both parts of the thesis. The goal of the exper- iments is to both objectively and subjectively compare the performances of the selected algorithms. The thesis proposes a method for the objective evaluation of the quality of detection and correction, which, as will be shown, largely cor- responds to the subjective...
|
|
|
Erasing of disturbing objects from digital pictures
Duga, Radovan ; Surynek, Pavel (advisor) ; Petříček, Martin (referee)
The aim of this thesis is to study the methods for erasing disturbing objects from digital photography and to design and implement a software for semi-automatic executing of this task (with cooperation of the user). Currently available software tools are not suitable to do this task so we try to o er to the user sufficient tools for simple erasing of selected object. The process of erasement of the object is done by several con gurable tools. Every tool obtains some information from a image and provides it to the following tool. After the right con guring of the tools the user saves the resulting image. The software is implemented in C++ for its performance and platform independency.
|
|
|
GeoGen - Scriptable generator of terrain height maps
Zábský, Matěj ; Petříček, Martin (advisor) ; Krajíček, Václav (referee)
This thesis presents a scriptable terrain height map generator. Its scripts are written in a powerful C-like scripting language. Terrain generation tools available include random noise generators, filters, combiners, masking functions and natural erosion simulators. Graphical script development environment which integrates the generator with modern code editor, interactive 3D height map viewer and other tools is presented. Existing terrain creation tools are analyzed. Various algorithms used in terrain generation are discussed. Example scripts written for this generator are presented.
|
|
|
Origami diagram creator
Pecka, Martin ; Petříček, Martin (advisor) ; Podzimek, Andrej (referee)
The main target of the Origamist application is to aid with creating origami diagram manuals. Recently, the most common methods for creating those manuals are drawing the steps in an image editor, or taking photographs of the folded steps and composing them together (again in an image editor). What Origamist brings is a new alternative to these methods. The manual's author gets the possibility to transfer the sequence of paper folds the manual consists of to the Origamist application, which is able to export several types of output - the most favourite (among origami folders) PDF manuals, but also image manuals (as PNG or SVG), and even as an animation of the folding process. There is also the added value to translate the descriptions of the steps to several languages.
|
|
|
Artificial intelligence algorithms for chess
Ivanová, Marika ; Petříček, Martin (advisor) ; Iša, Jiří (referee)
The primary objective of this thesis is to study and summarize the current algorithms used in computer chess and their subsequent implementation. The thesis includes a program that in addition to regular single-player game of chess against the computer leaves the user the option of used algorithms and setting their parameters. The theoretical part focuses on chess programming procedures and their illustrative explanation. Several experiments were performed with artificial intelligence algorithms and their results are presented here.
|
|
|
Sledování tělních trubic
Petříček, Martin ; Pelikán, Josef (advisor) ; Maršálek, Lukáš (referee)
X-rays and later Computer tomography allows doctors to see inside patients without using any invasive methods and is becoming more common part of examinations. Processing and examining the three-dimensional image data still poses unsolved challenges and currently requires considerable time and expertise. Goal of this work is to provide an algorithm and program to perform duct tracking in 3d data, which should shorten time needed for some medical examinations. Finding the ducts and performing measurements, such as length, volume or circumference is desired, as is viewing the results in some more comprehensible way. Deformable models are used in the algorithm. The resulting program is cross-platform and can run on any Windows or Unix-like system.
|
|
|
Algorithms for solving the Sokoban game
Galajda, Martin ; Surynek, Pavel (advisor) ; Petříček, Martin (referee)
The task of this work is to bring a complete guide for solving a SOKOBAN game problem. The work follow subsequently issues of studies of problem complexity, its definition, selection of appropriate algorithms, as well as their implementation and testing. The study demonstratethe manifest, that problem belongs to a NP-hard set of problems as well as PSPACE-complete set of problems. Fundamental and also advanced techniques of state space searching are studied as means for solving defined problem, memory and time characteristics of these techniques are presented and derived. In order to gain statistical information about efficiency of demonstrated algorithms and heuristics, an aplication SokobanSolver was built. This program can solve many SOKOBAN problems automatically. We described principles of functional parts and main data structures of this program and also we discuss program SokobanGenerator, aplication that was built to supply SokobanSolver with many random built SOKOBAN problems. Techniques explained are tested by lately named programs, and results are discussed at the very end of the paper.
|
|
|
GeoGen - Scriptable generator of terrain height maps
Zábský, Matěj ; Petříček, Martin (advisor) ; Krajíček, Václav (referee)
This thesis presents a scriptable terrain height map generator. Its scripts are written in a powerful C-like scripting language. Terrain generation tools available include random noise generators, filters, combiners, masking functions and natural erosion simulators. Graphical script development environment which integrates the generator with modern code editor, interactive 3D height map viewer and other tools is presented. Existing terrain creation tools are analyzed. Various algorithms used in terrain generation are discussed. Example scripts written for this generator are presented.
|
|
|
Artificial intelligence algorithms for chess
Ivanová, Marika ; Petříček, Martin (advisor) ; Iša, Jiří (referee)
The primary objective of this thesis is to study and summarize the current algorithms used in computer chess and their subsequent implementation. The thesis includes a program that in addition to regular single-player game of chess against the computer leaves the user the option of used algorithms and setting their parameters. The theoretical part focuses on chess programming procedures and their illustrative explanation. Several experiments were performed with artificial intelligence algorithms and their results are presented here.
|
|
|
Feature selection for text classification with Naive Bayes
Lux, Erik ; Petříčková, Zuzana (advisor) ; Petříček, Martin (referee)
The work presents the field of document classification. It describes existing techniques with emphasis on the Naive Bayes' classifier. Several existing feature selection methods suitable for the Naive Bayes' classifier are discussed. This theoretical background is the basis for the implementation of a classification library based on the Naive Bayes' method. Besides the classification program, the library provides a range of document preprocessing tools. They allow to work with different types of documents and, more importantly, they significantly reduce redundant document dimensions. Eventually, we tested the library on two different datasets and compared implemented feature selection methods. The functionality of the whole library is practically verified by including it into the open-source email client Mailpuccino.
|
guest ::
