|
| |
|
|
Music effects
Marko, Matej ; Valla, Tomáš (referee) ; Bálek, Martin (advisor)
Title: Music effects Author: Matej Marko Department: Department of applied mathematics Supervisor: Mgr. Martin Bálek Supervisor's e-mail address: Martin.Balek@mff.cuni.cz Abstract: The effects have crucial position in the proccess of creating music. They enrich song's arrangement and make it all more colorful. Aim of the work is to create application that allows the user to play a sound file and apply chosen effets on it's content in real-time. All changes in effects' settings are imidiatelly transformed into the hearable results. Certain settings can be applied on the whole file and the results afterwards exported to the file. Part of the application is naturally implementation of chosen effects. Main topic of the work's text are methods used to implement the effects. Keywords: effects, music, sound
|
|
|
Planar drawings of graphs
Macošek, Jan ; Pangrác, Ondřej (advisor) ; Bálek, Martin (referee)
This text and the enclosed program focuses on the planar drawings of graphs: It first sums up the basics of this domain, then describes the planarity testing, finding of the planar embedding and the straight-line planar drawing of graph using Schnyder's grid embedding algorithm. It also explores the effect of different triangulation strategies and the impact of the selection of the outer face on the planar drawing in several criteria. It also uses pictures made with the enclosed program to show the planar drawings. Powered by TCPDF (www.tcpdf.org)
|
|
|
Cell shape simulation using cytoskeleton model
Horáček, Jaroslav ; Bílý, Tomáš (referee) ; Bálek, Martin (advisor)
This work is focused on computer modelling of cells' behavior. Emphasis is layed on simulating of cell shaping. The goal is to design theoretical structure, which suitably represents cytoskeleton of cell. Our model is based on Zygotic graph. It defines cell reactions to incoming stimulation from environment. Unlike previous models we newly add Fill graph and Granary graph to the Zygotic graph. In order to modelling of cell shaping we define membrane flexibility. We also define mechanism of Cytoplasmatic pulse. It is necessary for amoeboid movement modelling. We added new structure called Granary, which represents storage ability of cell. We use our model to simulate movement of amoeba cell. Another example shows white blood cell moving through blood vessel wall. We also attempt to simulate growth of cells inside closed environment.
|
|
|
Bioinformatics - phylogenetic trees
Hoferek, Ondřej ; Bálek, Martin (referee) ; Pangrác, Ondřej (advisor)
Presented work deals with one of the main bioinformatics tasks: construction of phylogenetic trees. It focuses on UPGMA and Neighbour-joining methods which are used to create trees based on the matrix containing distances between gene or protein sequences. The result of the work is the implementation of these methods which is used within the application providing comfortable user interface for comparing the results of the methods.
|
|
|
OCR of handwritten structural chemical formulae
Zajíc, Vítězslav ; Pangrác, Ondřej (referee) ; Bálek, Martin (advisor)
This work is concerned with methods and algorithms used in developed program for recognition of the hand-drawn chemical structural formulae. It describes the preprocessing of the input image by using Gauss filter, the recognition of lines in the image by searching adjacent dark pixels. It shows inapplicability of Hough transform for line recognition. It covers searching for the most accurate approximation of the found lines using as few segments as possible. It shows similarity of structural formulae to graphs and describes algorithm of creating vertices and edges from recognized segments by using simple rules, that examine the length and neighbourhood of segments. It contains a chapter about recognition of the letters of heteroatoms and functional groups by comparing to pattern. In the end it shows errors in recognition on inappropriate input image. The program itself is also included in the work.
|
|
|
Pattern recognition by moments method
Staněk, Jan ; Pangrác, Ondřej (referee) ; Bálek, Martin (advisor)
This bachelor thesis and computer program are focused on the moments method which is used in pattern recognition. The text contains basic information about the method, its advantages, constraints, modifications, and extensions. The thesis focuses mainly on the last step in the process of pattern recognition which is the computation of the moments of an image and construction of a decision tree based on a known set of patterns. The accent is put on the variability of the construction of a decision tree and on the subsequent analysis and comparison of results gained by different settings of process conditions. Program is created in Java programming language.
|
|
|
Music manager
Sixta, Martin ; Bálek, Martin (referee) ; Bílý, Tomáš (advisor)
This Bachelor thesis describes a music manager program "Yamp"from the perspective of a software developer. The program Yamp is a graphical user interface application which can play audio files, view and edit metada information stored inside audio files, and enables to view additional information not stored inside audio files. The Yamp application can be categorized as a music player with collection management capabilities. The program is written in C++ programming language (with some parts written in plain C). It uses software libraries from the GNOME Desktop Platform, for audio playback is used the GStreamer library. The graphical user interface uses the gtkmm library. The application was tested by the author of the program. The thesis is split up in 5 chapters. The first chapter explains motivation behind the work along with summary of technologies and libraries used to develop the application. Chapter 2 presents overview of the most important technology used to develop the program. Chapter 3 describes installation process and usage of the application. Chapter 4 describes details of implemention and finally Chapter 5 sumps up experience obtained during development of the programn. The work also containes the software application itself, user's guide and application programming interface documentation...
|
|
|
Computational Complexity of Graph Planarity Testing
Krčál, Marek ; Škovroň, Petr (referee) ; Bálek, Martin (advisor)
In this paper we will show that the problem of planarity testing is in SL (symmetric nondeterministic LOGSPACE). The main part of our proof is a reduction of the problem to planarity of graphs with maximal degree three. Note that usual replacing vertices of degree bigger than three by "little circles" can spoil planarity, we need to be smarter. Planarity of graphs with maximal degree three was already solved in paper "Symmetric complementation" by John Reif. Previously Meena Mahajan and Eric Allender have already proved this in ("Complexity of planarity testing"), but their proof is the pure SL implementation of a parallel algorithm by John Reif and Vijaya Ramachandran ("Planarity testing in parallel"). But it is possibly unnecessarily complex and sophisticated for the purposes of the space complexity. This result together with recent breakthrough by Omer Reingold that SL = L ("Undirected T-connectivity in log-space") completely solves the question of complexity of planarity problem, because planarity is hard for L (it is again shown in "Complexity of planarity testing"). We construct logarithmic-space computable function that converts input graph G into G0 with maximal degree three such that G is planar if and only if G0 is. This together with.
|
|
|
Sociomap Visualization
Höschl, Cyril ; Černý, Jakub (referee) ; Bálek, Martin (advisor)
In this work we study algorithms for visualization of sociomaps. We focus on surface-fitting method which converts bitmap picture into a sequence of closed spline curves. For curve-fitting, we describe tracing algorithm that for a given level of height in a smooth surface finds a contour as a closed Bézier curve. Further we describe algorithm that draws hierarchy of clusters into a 2D plane. We first create a skeleton of the cluster analysis which we then project into a plane using curve-fitting method. We describe methods of interpolation of surface based on inverse distances weights and also we present a linear interpolation based on Delanauy triangulation. We apply these methods on sociomappig analysis. Sociomapping is a data-mining method for visualization of relations among objects as well as analyzing statistical data. The result of sociomapping analysis is an easy-to-read picture - a sociomap. We explain cluster analysis for model of a sociomap and also we describe statistical test based on fuzzy approach.
|
guest ::
RSS feed.