|
|
Machine learning for analysis of MR images of brain
Král, Jakub ; Říha, Ivo (referee) ; Provazník, Ivo (advisor)
The thesis is focused on methods of machine learning used for recognising the first stage of schizophrenia in images from nuclear-magnetic resonance. The introduction of this paper is focused primarily on physical principles. Further in this work, the attention is given to registration methods, reduction of data set and machine learning. In the classification part, simmilarity rates, support vectors´ method, K-nearest neighbour classification and K-means are described. The last stage of theoretical part is focused on evaluation of the clasification. In practical part the results of reduction data set by methods PCA, CRLS-PCA and subjects PCA are described. Furthermore, the practical part is focused on pattern recognition by methods K-NN, K-means and test K-NN method on real data. Abnormalities which are recognised by some classification methods can distinguish patients with schizophrenia from healthy controls.
|
|
|
Pattern Recognition in Temporal Data
Hovanec, Stanislav ; Hynčica, Ondřej (referee) ; Honzík, Petr (advisor)
This diploma work initially conduct research in the area of descriptions and analysis of time series. The thesis then proceed to introduce the problems of technical analysis of price charts as well as indicators, price patterns and method of Pure Price Action. The method Pure Price Action is demonstrated in this work in two practical examples of its application to real businesses with a view to discovering and analyzing price patterns, as well as analysis and prediction of future price and financial evolution. This analysis is an introduction to the processes of successful business, following on from this we discuss the theme of Pattern Recognition and the Instance Based Learning method. The practical aspect of this work is carried out with the aid of a MATLAB applied algorithm for the analysis of the price pattern Correction for sale and purchase in dynamic time segments, specifically in trading price graphs, like those used for commodities or stock trading. For the analysis of time series we use the Pure Price Action method. The Instance Based Learning method is used by the algorithm to recognize price patterns. The created algorithm is verified on real data of a 5 minute time series of the US Dow Jones price charts for the years 2006, 2007, 2008. The achieved accuracy is evaluated with the aid of Equity Curves.
|
|
|
Pattern Finding in Dymanical Data
Budík, Jan ; Hynčica, Ondřej (referee) ; Honzík, Petr (advisor)
First chapter is about basic information pattern learning. Second chapter is about solutions of pattern recognition and about using artificial inteligence and there are basic informations about statistics and theory of chaos. Third chapter is focused on time series, types of time series and preprocessing. There are informations about time series in financial sector. Fourth charter discuss about pattern recognition problems and about prediction. Last charter is about software, which I did and there are informations about part sof program.
|
|
|
Detection of Logopaedic Defects in Speech
Pešek, Milan ; Smékal, Zdeněk (referee) ; Atassi, Hicham (advisor)
The thesis deals with a design and an implementation of software for a detection of logopaedia defects of speech. Due to the need of early logopaedia defects detecting, this software is aimed at a child’s age speaker. The introductory part describes the theory of speech realization, simulation of speech realization for numerical processing, phonetics, logopaedia and basic logopaedia defects of speech. There are also described used methods for feature extraction, for segmentation of words to speech sounds and for features classification into either correct or incorrect pronunciation class. In the next part of the thesis there are results of testing of selected methods presented. For logopaedia speech defects recognition algorithms are used in order to extract the features MFCC and PLP. The segmentation of words to speech sounds is performed on the base of Differential Function method. The extracted features of a sound are classified into either a correct or an incorrect pronunciation class with one of tested methods of pattern recognition. To classify the features, the k-NN, SVN, ANN, and GMM methods are tested.
|
|
|
Objects Classification in Images
Gabriel, Petr ; Petyovský, Petr (referee) ; Janáková, Ilona (advisor)
This master's thesis deal with problems of classification objects on the basis of atributes get from images. This thesis pertain to a branch of computer vision. Describe possible instruments of classification (e.g. neural networks, decision tree, etc.). Essential part is description objects by means of atributes. They are imputs to classifier. Practical part of this thesis deal with classification of object collection, which can be usually found at home (e.g. scissors, compact disc, sticky, etc.). Analyzed image is preprocessed , segmented by thresholding in HSV color map. Then defects caused by a segmentation are reconstructed by morfological operations. After are determined atribute values, which are imputs to classifier. Classifier has form of decision tree.
|
|
|
Approximating Probability Densities by Mixtures of Gaussian Dependence Trees
Grim, Jiří
Considering the probabilistic approach to practical problems we are increasingly confronted with the need to estimate unknown multivariate probability density functions from large high-dimensional databases produced by electronic devices. The underlying densities are usually strongly multimodal and therefore mixtures of unimodal density functions suggest themselves as a suitable approximation tool. In this respect the product mixture models are preferable because they can be efficiently estimated from data by means of EM algorithm and have some advantageous properties. However, in some cases the simplicity of product components could appear too restrictive and a natural idea is to use a more complex mixture of dependence-tree densities. The dependence tree densities can explicitly describe the statistical relationships between pairs of variables at the level of individual components and therefore the approximation power of the resulting mixture may essentially increase.
|
|
|
Utilization of advanced statistical methods for processing of florescence emission of plants affected by local biotic stress
MATOUŠ, Karel
Chlorophyll fluorescence imaging is noninvasive technique often used in plant physiology, molecular biology and precision farming. Captured sequences of images record the dynamic of chlorophyll fluorescence emission which contain the information about spatial and time changes of photosynthetic activity of plant. The goal of this Ph.D. thesis is to contribute to the development of chlorophyll fluorescence imaging by application of advanced statistical techniques. Methods of statistical pattern recognition allow to identify images in the captured sequence that are reach for information about observed biotic stress and to find small subsets of fluorescence images suitable for following analysis. I utilized only methods for identification of small sets of images providing high performance with realistic time consumptions.
|
|
|
Fast Dependency-Aware Feature Selection in Very-High-Dimensional Pattern Recognition Problems
Somol, Petr ; Grim, Jiří
The paper addresses the problem of making dependency-aware feature selection feasible in pattern recognition problems of very high dimensionality. The idea of individually best ranking is generalized to evaluate the contextual quality of each feature in a series of randomly generated feature subsets. Each random subset is evaluated by a criterion function of arbitrary choice (permitting functions of high complexity). Eventually, the novel dependency-aware feature rank is computed, expressing the average benefit of including a feature into feature subsets. The method is efficient and generalizes well especially in very-high-dimensional problems, where traditional context-aware feature selection methods fail due to prohibitive computational complexity or to over-fitting. The method is shown well capable of over-performing the commonly applied individual ranking which ignores important contextual information contained in data.
|
|
|
Introduction to Feature Selection Toolbox 3 – The C++ Library for Subset Search, Data Modeling and Classification
Somol, Petr ; Vácha, Pavel ; Mikeš, Stanislav ; Hora, Jan ; Pudil, Pavel ; Žid, Pavel
We introduce a new standalone widely applicable software library for feature selection (also known as attribute or variable selection), capable of reducing problem dimensionality to maximize the accuracy of data models, performance of automatic decision rules as well as to reduce data acquisition cost. The library can be exploited by users in research as well as in industry. Less experienced users can experiment with different provided methods and their application to real-life problems, experts can implement their own criteria or search schemes taking advantage of the toolbox framework. In this paper we first provide a concise survey of a variety of existing feature selection approaches. Then we focus on a selected group of methods of good general performance as well as on tools surpassing the limits of existing libraries. We build a feature selection framework around them and design an object-based generic software library. We describe the key design points and properties of the library.
|
|
|
Sequential Retreating Search Methods in Feature Selection
Somol, Petr ; Pudil, Pavel
Inspired by Floating Search, our new pair of methods, the Sequential Forward Retreating Search (SFRS) and Sequential Backward Retreating Search (SBRS) is exceptionally suitable for Wrapper based feature selection. (Conversely, it cannot be used with monotonic criteria.) Unlike most of other known sub-optimal search methods, both the SFRS and SBRS are parameter-free deterministic sequential procedures that incorporate in the optimization process both the search for the best subset and the determination of the best subset size. The subset yielded by either of the two new methods is to be expected closer to optimum than the best of all subsets yielded in one run of the Floating Search. Retreating Search time complexity is to be expected slightly worse but in the same order of magnitude as that of the Floating Search. In addition to introducing the new methods we provide a testing framework to evaluate them with respect to other existing tools.
|
guest ::
