|
|
Searching in Speech Data
Fapšo, Michal ; Černocký, Jan (referee) ; Szőke, Igor (advisor)
This thesis describes a designed and implemented system for efficient storage, indexing and search in collections of spoken documents that takes advantage of automatic speech recognition. As the quality of current speech recognizers is not sufficient for a great deal of applications, it is necessary to index the ambiguous output of the recognition, i.\,e. the acyclic graphs of word hypotheses -- recognition lattices. Then, it is not possible to directly apply the standard methods known from text--based systems. This paper discusses an optimized indexing system for efficient search in the complex and large data structures which are the output of the recognizer.
|
|
|
Computer analysis of medical image data
Krajčír, Róbert ; Šmirg, Ondřej (referee) ; Uher, Václav (advisor)
This work deals with medical image analysis, using variety of statisic and numeric methods implemented in Eclipse and Rapidminer environments in Java programming language. Sets of images (slices), which are used here, are the results of magnetic resonance brain examination of several subejcts. Segments in this 3D image are analyzed and some local features are computed, based on which data sets for use in training algorythms are generated. The ability of successful identification of healthy or unhealthy tissues is then practically tested using available data.
|
|
|
Searching algorithms
Ďuriš, Martin ; Šeda, Miloš (referee) ; Dvořák, Jiří (advisor)
The thesis describes and analyzes selected searching algorithms for single dimensional array. Algorithms are analyzed mathematically and graphically. Mathematical analysis is based on analysis of average amount of performed comparisons required for the final result and literature review. Graphical analysis is based on multiple examinations of selected searching methods with randomly generated single dimensional arrays. The graphs show dependency of elapsed searching time of successful and unsuccessful searching trial on the size of single dimensional array. The results establish the binary searching algorithm as the fastest one of the selected searching algorithms.
|
guest ::
