|
|
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.
|
|
|
Computer Poker
Kýpeť, Jakub ; Surynek, Pavel (advisor) ; Toropila, Daniel (referee)
The present work describes a design and an implementation of environment for playing Texas Hold'em poker, including design and implementation of a system that simulates a player of this game. This system consists of three developed strategies, using all resources described in the work. The various strategies that we have developed, we have tested on a few games. The results obtained from the tests are analyzed and then compared with our assumptions and expectations. This work also consists a description of existing programs that are about same topic and then comparation with our application.
|
|
|
Filtering Algorithms for Tabular Constraints
Molnár, Martin ; Barták, Roman (advisor) ; Surynek, Pavel (referee)
The thesis studies an implementation of arc-consistency filtering algorithms for constraints defined in extension. We propose a new concept of binarization for decomposing high-arity ad-hoc constraints into networks of binary constraints. A theory proving correctness of the binarization is developed. We study the existing algorithms from the perspective of our binarization concept and propose possible binarization schemes for ad-hoc constraints defined in some of the common forms. In the thesis we also propose the filtering algorithms for the elementary constraints. A compound propagator then uses the elementary constraint filtering algorithms to propagate over the high-arity constraint. Finally, we experimentally evaluate the proposed approaches on constraints generated when solving the planning problems.
|
|
|
Content-based Image Search
Talaš, Josef ; Surynek, Pavel (advisor) ; Děchtěrenko, Filip (referee)
This work aims at content-based image search. Different approaches to this type of search are investigated. The main focus of the thesis is special category of content-based image search called sketch-based image search. The most important descriptor types used for image feature extraction in image search are analyzed. Main contribution of the thesis to this research area is a new feature extraction method based on sketch-based image search. This method is implemented together with search interface. The method was evaluated by three test persons. The testing results show promising properties of new method and suggest further possible improve-ments. Powered by TCPDF (www.tcpdf.org)
|
|
|
Interactive scheduling and visualisation
Skalický, Tomáš ; Barták, Roman (advisor) ; Surynek, Pavel (referee)
The goal of this thesis was to design and implement a graphical tool for visualization and editing of schedules which would provide a function for automatic repairing of violated constraints in the schedule. The resulting application called a Gantt Viewer is integrated to the FlowOpt project that represents a complex solution for modeling workflows, creation of schedules from them and analysis of these schedules. The application has been developed with the focus on intuitiveness of the user interface and performance during the management of large schedules. It enables the user to visualize extended manufacturing schedules thanks to the cooperation with other modules of the FlowOpt project. Moreover, the Gantt Viewer incorporates a repair tool exploiting a new Repair-DTP algorithm which is both introduced and demonstrated in this work.
|
|
|
Automated prediction of results of tennis matches
Ščavnický, Martin ; Surynek, Pavel (advisor) ; Žemlička, Michal (referee)
In the present work we study predicting results of men's tennis matches using a multilayer perceptron. We propose a variety of input and output parameters andc also existing techniques for their preprocessing for the neural network. Speci cally, noise ltering and principal component analysis (PCA). We also try to adjust the former chess rating to the need of tennis. In the experimental part we try to nd an optimal model for the prediction and study the in fluence of the preprocessing on the model's efficiency. For this purpose we have developed a software that facilitates testing and consequent prediction.
|
|
| |
|
|
Computer-aided Teaching of Spherical Geometry
Bémová, Kristýna ; Surynek, Pavel (advisor) ; Voráčová, Šárka (referee)
Basically we distinguish two types of geometry: Euclidean and Non-Euclidean. Everyone meets Euclidean geometry at basic school, but hardly ever a student hear about Non-Euclidean geometry. In this thesis, we are dealing with spherical geometry, which is a special part of Non-Euclidean geometry. We introduce basic concepts of spherical geometry in the thesis. A more detailed description is devoted to spherical trigonometry, which studies characteristics of spherical triangle and solves the corresponding problems. We also discuss differences between Euclidean and Non-Euclidean geometry. As a part of the thesis we developed an educational software for drawing on the spherical surface. The software is intended as an educational instrument for teaching spherical geometry. The program allows a student to draw shapes like a point, an abscissa, a circle and triangle. Further, the student can measure a length or an angle, which characterizes the differences between Euclidean and Non-Euclidean geometry in the best way. Our educational program improves user's stereometric imagination since the drawn shapes can be displayed from different visual angles.
|
|
|
Matrix calculator
Krč-Jediný, Ondrej ; Chrpa, Lukáš (advisor) ; Surynek, Pavel (referee)
The aim of this project is creating an environment which would allow the user to work with chosen matrix algorithms, with the emphasis on understanding their principles. Using a simple programming language, the user will be able to perform computations and display their results. Moreover, the environment is able to show a characterisation, and a description of the course of computation of each algorithm, thus providing information about the means of its operation. The project implements several basic and several advanced algorithms for handling matrices.
|
|
|
Detection of 2D features in MARSIS ionogram pictures
Pecka, Martin ; Štanclová, Jana (advisor) ; Surynek, Pavel (referee)
The work focuses on techniques for finding significant features in ionograms captured by the MARSIS instrument onboard the Mars Express spacecraft. Identification of these features helps in studying the ionosphere, magnetosphere and plasma surrounding Mars. Ionograms are 2D images with values represented in color. The goal of this work is to propose techniques to detect interesting curves (parametrically defined) in such images and to measure some more parameters of the found objects (like the repetition period of lines). During the research we managed to propose two methods very suitable for ionogram studies and we explored several other methods.
|
guest ::
