|
| |
|
|
Recognition and Filtration of Unwanted Video-Sequences
Vlček, Jakub ; Surynek, Pavel (advisor) ; Kolomazník, Jan (referee)
The thesis deals with the possibilities of recognition video sequences and possibility of machine learning based on previous knowledge. I use neural networks which I learn on characteristics generated from images. Images are characterized using image functions like histogram and statistical functions such as mean and correlations to detect scenes in video-sequence. I used all of these findings to implement the demonstration program. The program can play video, display statistical information about the sequence or frame by frame and detect sequences similar to advertisements on the basis of statistical properties and respond to it by defined events.
|
|
|
Generic algorithms for polygonal mesh manipulation
Hmíra, Peter ; Kolomazník, Jan (advisor) ; Dupej, Ján (referee)
This bachelor thesis analyses algorithms working with the volume data, especially the triangle or polygon mesh. The results of the analysis are applied in the design of the generic library which can be templated with any implementa- tion of mesh satisfying requirements of the library. The library is written in C++ using the norm C++11 with assistance of the boost library. The choice of the programming language is supported by the strong emphasis on the run-time per- formance as well as the capabilities of C++ to analyze a templated code during the compile-time. Later in thesis is described the implemenation of the library, usage of the algorithms and their concepts, the purpose of the adapters - tools that allow to run algorithms over such an implementation of the mesh that is not properly designed for the algorithm. The technique used in the development of this library can be later applied in the library developement, thus adding new algorithms to the library.
|
|
|
Volume data editor
Kavalík, Jiří ; Krajíček, Václav (advisor) ; Kolomazník, Jan (referee)
In the present work we want to design and implement simple tool for basic editing of volume data like resizing, rotating, tresholding retouching, which could be extended as needed. Currently, there are tools for volume data visualisation and simple editors for modding computer games with voxel-based graphics. There is not an editor with basic set of tools for editing volumes in resolution of medical scanners available to common user. The designed and implemented editor can run on common hardware and oth ers set of simple brushes and filters to the user and means to implement diferent tools as plugins for C# programmer.
|
|
| |
|
|
Vessel segmentation
Dupej, Ján ; Pelikán, Josef (advisor) ; Kolomazník, Jan (referee)
Title: Vessel segmentation Author: Ján Dupej Department / Institute: Department of Software and Computer Science Education Supervisor of the master thesis: RNDr. Josef Pelikán, KSVI Abstract: In this thesis we researched some of the blood vessed segmentation and visualization techniques currently available for angiography on CT data. We then designed, implemented and tested a system that allows both semi-automatic and automatic vessel segmentation and visualization. For vessel segmantation and tracking we used a region-growing algorithm that we overhauled with several heuristics and combined with centerline detection. We then automated this algorithm by automatic seed generation. The visualization part is accomplished with an adaptation of the well-known straightened CPR method that we enhanced so that it visualizes the whole cross-section of the blood vessel, instead of just one line of it. Furthermore, we used the Bishop frame to maintain minimal twist of the curve-local coordinate system along the whole vessel. Keywords: vessel segmentation, medical data analysis, volume data
|
|
| |
|
|
Interactive Processing of Volumetric Data
Kolomazník, Jan ; Pelikán, Josef (advisor) ; Ďurikovič, Roman (referee) ; Dokládal, Petr (referee)
Title: Interactive Processing of Volumetric Data Author: Jan Kolomazník Department: Department of Software and Computer Science Education Supervisor: RNDr. Josef Pelikán, Department of Software and Computer Science Education Abstract: Interactive visualization and segmentation of volumetric data are quite lim- ited due to the increased complexity of the task and size of the input data in comparison to two-dimensional processing. A special interactive segmentation workflow is presented, based on minimal graph-cut search. The overall execution time was lowered by implementing all the computational steps on GPU, which required a design of massively parallel algorithms (using thousands of threads). To lower the computational burden even further the graph is constructed over the image subregions com- puted by parallel watershed transformation. As a suitable formalism for a range of massively parallel algorithms was chosen cellular automata. A set of cellular automata extensions was defined, which allows efficient mapping and computation on GPU. Several variants of parallel watershed transformation are then defined in the form of cellular automaton. A novel form of 2D transfer function was presented, to improve direct volume visualization of the input data, suited for discriminating image features by their shape and...
|
|
|
Optical Character Recognition at Camera Captured Images
Kindermann, Hubert ; Blažek, Jan (advisor) ; Kolomazník, Jan (referee)
We present solution of steps necessary for binarization and text lines detection contained in printed documents digitized by the camera. We introduce a normalization of non-uniform illumination method for text photographs. We propose input bitmap binarization algorithm based on two-dimensional probability pixel model which also considers its surrounding. We continue with description of robust text lines orientation detector based on optimization of risk function using first order derivatives of image function. In the end we present text lines detection and segmentation algorithm. Final shape of segmented lines is optimized with usage of graph algorithm. Powered by TCPDF (www.tcpdf.org)
|
|
|
Generování vlasů interpolací
Šik, Martin ; Křivánek, Jaroslav (advisor) ; Kolomazník, Jan (referee)
This thesis describes a procedural hair generator that is able to generate hair from just a few hairs, called hair guides, which are directly modeled by a 3d artist. The procedural hair generator is a part of Stubble project -- a tool for hair modeling in Autodesk Maya. The procedural hair generator can generate hair during rendering, thus avoiding storage of hair geometry in a scene file, which makes the rendering process very efficient. Furthermore, hair can be generated interactively and displayed by OpenGL during modeling in Maya. Generated hair geometry is mainly defined by interpolation from the mentioned hair guides; however it is also influenced by many hair properties. These properties can change hair geometry using noise functions, define hair color, width and more. To determine hair root positions on a given triangular mesh I use my own mesh sampling algorithm that generates random samples on a triangular mesh according to a density defined by a 2-dimensional texture. My sampling algorithm uses an innovative way of sampling from a discrete probability distribution, which can be used in other applications than mesh sampling.
|
guest ::
RSS feed.