|
|
Automatic Photography Categorization
Veľas, Martin ; Beran, Vítězslav (referee) ; Španěl, Michal (advisor)
This thesis deals with content based automatic photo categorization. The aim of the work is to create an application, which is would be able to achieve sufficient precision and computation speed of categorization. Basic solution involves detection of interesting points, extraction of feature vectors, creation of visual codebook by clustering, using k-means algorithm and representing visual codebook by k-dimensional tree. Photography is represented by bag of words - histogram of presence of visual words in a particular photo. Support vector machines (SVM) was used in role of classifier. Afterwards the basic solution is enhanced by dividing picture into cells, which are processed separately, computing color correlograms for advanced image description, extraction of feature vectors in opponent color space and soft assignment of visual words to extracted feature vectors. The end of this thesis concerns to experiments of of above mentioned techniques and evaluation of the results of image categorization on their usage.
|
|
|
Network Traffic Analysis Based on Clustering
Černý, Tomáš ; Drahošová, Michaela (referee) ; Bartoš, Václav (advisor)
This thesis focuses on anomaly detection in network traffic using clustering methods. First, basic anomaly detection methods are introduced. The next part describes hierarchical and k-means clustering in detail. Also there are described selected normalization techniques. Part is given to the procedure for detecting anomalies in the context of data mining. Furthermore a few words about implementation of single methods. Finally, clustering methods and normalization techniques are tested and compared.
|
|
| |
|
|
Neural Network Based Image Segmentation
Vrábelová, Pavla ; Žák, Pavel (referee) ; Švub, Miroslav (advisor)
This paper deals with application of neural networks in image segmentation. First part is an introduction to image processing and neural networks, second part describes an implementation of segmentation system and presents results of experiments. The segmentation system enables to use different types of classifiers, various image features extraction and also to evaluate the success of segmentation. Two classifiers were created - a neural network (self-organizing map) and an algorithm K-means. Colour (RGB and HSV) and texture features and their combinations were used for classification. Texture features were extracted using a set of Gabor filters. Experiments with designed classifiers and feature extractors were carried out and results were compared.
|
|
|
Human Recognition by Finger Veins
Lisák, Peter ; Drahanský, Martin (referee) ; Dvořák, Radim (advisor)
The master's thesis deals with biometric systems, especially these based on human recognition by finger veins. It describes some development principles of the new biometric system. It proposes some new approaches to the comparison of finger vein patterns and their fast identification in sizable databases. Verification is based on templates comparison by similarity and distance measures with proposed alignment approaches. The proposed method of identification is based on the combination of clustering and genetic algorithm. The second option is using the indexing tree structure and searching by range query.
|
|
|
Clustering of Protein Sequences Based on Primary Structure of Proteins
Jurásek, Petr ; Stryka, Lukáš (referee) ; Burgetová, Ivana (advisor)
This master's thesis consider clustering of protein sequences based on primary structure of proteins. Studies the protein sequences from they primary structure. Describes methods for similarities in the amino acid sequences of proteins, cluster analysis and clustering algorithms. This thesis presents concept of distance function based on similarity of protein sequences and implements clustering algorithms ANGES, k-means, k-medoids in Python programming language.
|
|
|
Object Detection and Tracking Using Interest Points
Bílý, Vojtěch ; Hradiš, Michal (referee) ; Juránek, Roman (advisor)
This paper deals with object detection and tracking using iterest points. Existing approaches are described here. Inovated method based on Generalized Hough transform and iterative Hough-space searching is proposed in this paper. Generality of proposed detector is shown in various types of objects. Object tracking is designed as frame by frame detection.
|
|
|
Automatic Photography Categorization
Veľas, Martin ; Řezníček, Ivo (referee) ; Španěl, Michal (advisor)
This thesis deals with content based automatic photo categorization. The aim of the work is to experiment with advanced techniques of image represenatation and to create a classifier which is able to process large image dataset with sufficient accuracy and computation speed. A traditional solution based on using visual codebooks is enhanced by computing color features, soft assignment of visual words to extracted feature vectors, usage of image segmentation in process of visual codebook creation and dividing picture into cells. These cells are processed separately. Linear SVM classifier with explicit data embeding is used for its efficiency. Finally, results of experiments with above mentioned techniques of the image categorization are discussed.
|
|
|
Web Mining - Clustering
Rychnovský, Martin ; Burget, Radek (referee) ; Bartík, Vladimír (advisor)
This work presents the topic of data mining on the web. It is focused on clustering. The aim of this project was to study the field of clustering and to implement clustering through the k-means algorithm. Then, the algorithm was tested on a dataset of text documents and on data extracted from web. This clustering method was implemented by means of Java technologies.
|
|
|
Hierarchical Image Segmentation
Staněk, Stanislav ; Švub, Miroslav (referee) ; Španěl, Michal (advisor)
In many vision applications image segmentation is one of the most critical steps of analysis,which has the objective of extracting information from an image. In this work a segmentation method based upon fuzzy c-means and k-means clustering is presented. A hierarchical data structure together with clustering algorithms for the segmentation in each level of the pyramid is used.The results show that the computation time is much less then that of a classical clustering.
|
guest ::
