|
Knowledge Discovery in Multimedia Databases
Málik, Peter ; Bartík, Vladimír (referee) ; Chmelař, Petr (advisor)
This master"s thesis deals with the knowledge discovery in multimedia databases. It contains general principles of knowledge discovery in databases, especially methods of cluster analysis used for data mining in large and multidimensional databases are described here. The next chapter contains introduction to multimedia databases, focusing on the extraction of low level features from images and video data. The practical part is then an implementation of the methods BIRCH, DBSCAN and k-means for cluster analysis. Final part is dedicated to experiments above TRECVid 2008 dataset and description of achievements.
|
|
Detection of Network Anomalies Based on NetFlow Data
Czudek, Marek ; Bartoš, Václav (referee) ; Kořenek, Jan (advisor)
This thesis describes the use of NetFlow data in the systems for detection of disruptions or anomalies in computer network traffic. Various methods for network data collection are described, focusing especially on the NetFlow protocol. Further, various methods for anomaly detection in network traffic are discussed and evaluated, and their advantages as well as disadvantages are listed. Based on this analysis one method is chosen. Further, test data set is analyzed using the method. Algorithm for real-time network traffic anomaly detection is designed based on the analysis outcomes. This method was chosen mainly because it enables detection of anomalies even in an unlabelled network traffic. The last part of the thesis describes implementation of the algorithm, as well as experiments performed using the resulting application on real NetFlow data.
|
|
Image Database Query by Example
Dobrotka, Matúš ; Hradiš, Michal (referee) ; Veľas, Martin (advisor)
This thesis deals with content-based image retrieval. The objective of the thesis is to develop an application, which will compare different approaches of image retrieval. First basic approach consists of keypoints detection, local features extraction and creating a visual vocabulary by clustering algorithm - k-means. Using this visual vocabulary is computed histogram of occurrence count of visual words - Bag of Words (BoW), which globally represents an image. After applying an appropriate metrics, it follows finding similar images. Second approach uses deep convolutional neural networks (DCNN) to extract feature vectors. These vectors are used to create a visual vocabulary, which is used to calculate BoW. Next procedure is then similar to the first approach. Third approach uses extracted vectors from DCNN as BoW vectors. It is followed by applying an appropriate metrics and finding similar images. The conclusion describes mentioned approaches, experiments and the final evaluation.
|
|
Automatic Content-Based Image Categorization
Němec, Ladislav ; Španěl, Michal (referee) ; Veľas, Martin (advisor)
This thesis deals with automatic content-based image classification. The main goal of this work is implementation of application which is able to perform this task automatically. The solution consists of variable system using local image features extraction and visual vocabulary built by k-means method. Bag Of Words representation is used as a global feature describing each image. Support Vector Machines - the final component of this system - perform the classification based on this representation. In the last chapter, the results of this experimental system are presented.
|
|
Multiparametric segmentation of MR images
Chovanec, Ján ; Šmirg, Ondřej (referee) ; Dvořák, Pavel (advisor)
The aim of the thesis was familiarity of segmentation methods for automatic segmentation of MR images, using multiparametrical display. The theoretical part focuses on the description of methods of segmentation techniques. In the practical part are implemented K-means and level-set method. The methods are tested on the images of the brain obtained by different sequences (T1, T1c, T2, FLAIR). Segmentation methods are implemented in the program MATLAB. Implemented segmentation accuracy is demonstrated on data which there are reports reference results. Evaluation methods is performed using different classifiers decision. The K-means method is tested different metrics and different combinations of the input image. Finally, both methods are compared with one another and visually evaluated against the reference image.
|
|
Advanced picture segmentation for 3D view
Baletka, Tomáš ; Fliegel, Karel (referee) ; Boleček, Libor (advisor)
The thesis advanced image segmentation for 3D image deals with segmentation and anaglyph 3D views. In the theoretical part of the thesis describes the different approaches were used to image segmentation and closely related methods of image processing. In the following practical part was the implementation of selected methods and created user-friendly applications. The main objective of the program is to identify significant objects in the image. For the purpose of segmentation methods have been implemented based on k-means method, the method of contour and the growth of seeds. The program is created in Visual Studio 2008 and written in C + +. The input and output is the image in various formats (JPG, BMP, TIFF).
|
|
Systems for remote measurement in power engineering
Hudec, Lukáš ; Mlýnek, Petr (referee) ; Mišurec, Jiří (advisor)
The work deals with the measurement and management in power. Provides an introduction to the problems of remote meter reading, management, and describes the current situation in the field of modern technologies Smart metering and Smart grids. It also analyzed the issue of collection of networks and data collection from a large number of meters over a wide area. For the purpose of data transmission are described GPRS, PLC, DSL, ... Further, there are given options to streamline communication. This area is used hierarchical aggregation. Using k-means algorithm is a program designed to calculate the number of concentrators and their location in the group of meters. The finished program is written in Java. It has a graphical interface and shows how the calculation is conducted. To verify the results of the optimization program is given simulation model in OPNET Modeler tool. Audited results are described in the conclusion and can deduce that using the optimization program is to streamline communications.
|
|
A Classification Methods for Retinal Nerve Fibre Layer Analysis
Zapletal, Petr ; Kolář, Radim (referee) ; Odstrčilík, Jan (advisor)
This thesis is deal with classification for retinal nerve fibre layer. Texture features from six texture analysis methods are used for classification. All methods calculate feature vector from inputs images. This feature vector is characterized for every cluster (class). Classification is realized by three supervised learning algorithms and one unsupervised learning algorithm. The first testing algorithm is called Ho-Kashyap. The next is Bayess classifier NDDF (Normal Density Discriminant Function). The third is the Nearest Neighbor algorithm k-NN and the last tested classifier is algorithm K-means, which belongs to clustering. For better compactness of this thesis, three methods for selection of training patterns in supervised learning algorithms are implemented. The methods are based on Repeated Random Subsampling Cross Validation, K-Fold Cross Validation and Leave One Out Cross Validation algorithms. All algorithms are quantitatively compared in the sense of classication error evaluation.
|
|
Internet coordinating systems
Krajčír, Martin ; Komosný, Dan (referee) ; Burget, Radim (advisor)
Network coordinates (NC) system is an efficient mechanism for prediction of Internet distance with limited number of measurement. This work focus on distributed coordinates system which is evaluated by relative error. According to experimental results from simulated application, was created own algorithm to compute network coordinates. Algorithm was tested by using simulated network as well as RTT values from network PlanetLab. Experiments show that clustered nodes achieve positive results of synthetic coordinates with limited connection between nodes. This work propose implementation of own NC system in network with hierarchical aggregation. Created application was placed on research projects web page of the Department of Telecommunications.
|
|
Using data mining to manage an enterprise.
Prášil, Zdeněk ; Pour, Jan (advisor) ; Novotný, Ota (referee)
The thesis is focused on data mining and its use in management of an enterprise. The thesis is structured into theoretical and practical part. Aim of the theoretical part was to find out: 1/ the most used methods of the data mining, 2/ typical application areas, 3/ typical problems solved in the application areas. Aim of the practical part was: 1/ to demonstrate use of the data mining in small Czech e-shop for understanding of the structure of the sale data, 2/ to demonstrate, how the data mining analysis can help to increase marketing results. In my analyses of the literature data I found decision trees, linear and logistic regression, neural network, segmentation methods and association rules are the most used methods of the data mining analysis. CRM and marketing, financial institutions, insurance and telecommunication companies, retail trade and production are the application areas using the data mining the most. The specific tasks of the data mining focus on relationships between marketing sales and customers to make better business. In the analysis of the e-shop data I revealed the types of goods which are buying together. Based on this fact I proposed that the strategy supporting this type of shopping is crucial for the business success. As a conclusion I proved the data mining is methods appropriate also for the small e-shop and have capacity to improve its marketing strategy.
|