Signal compression is necessary part for ECG scanning, because of relatively big amount of data, which must be transmitted primarily wirelessly for analysis. Because of the wireless sending it is necessary to minimize the amount of data as much as possible. To minimize the amount of data, lossless or lossy compression algorithms are used. This work describes an algorithm SPITH and newly created experimental method, based on PNG, and their testing. This master’s thesis there is also a bank of ECG signals with parallel sensed accelerometer data. In the last part, modification of SPIHT algorithm, which uses accelerometer data, is described and realized.

The thesis deals with function and structure of web applications, describes the individual technologies used in these applications. It also explains how to create for the purpose of high efficiency and easy development. The main part presents technologies to speed up the applications, explain their settings and properties. Finally, the technologies are thoroughly tested, evaluated benefits of use and recommended the application for future development.

Title: Suffix Graphs and Lossless Data Compression Author: Martin Senft Department: Department of Software and Computer Science Education Supervisor of the doctoral thesis: doc. RNDr. Tomáš Dvorˇák, CSc., Depart- ment of Software and Computer Science Education Abstract: Suffix tree and its variants are widely studied data structures that enable an efficient solution to a number of string problems, but also serve for implementation of data compression algorithms. This work explores the opposite approach: design of compression methods, based entirely on prop- erties of suffix graphs. We describe a unified construction algorithm for suf- fix trie, suffix tree, DAWG and CDAWG, accompanied by analysis of implicit suffix link simulation that yields two practical alternatives. Since the com- pression applications require maintaining text in the sliding window, an in- depth discussionof slidingsuffixgraphsisneeded. Fillinggapsin previously published proofs, we verify that suffix tree is capable of perfect sliding in amortised constant time. On the other hand, we show that this is not the case with CDAWG, thus resolving a problem of Inenaga et al. Building on these investigations,we describea family of data compression methods,based on a description of suffix tree construction for the string to be compressed. While some of...

This document describes image compression using different types of neural networks. Features of neural networks like convolutional and recurrent networks are also discussed here. The document contains detailed description of various neural network architectures and their inner workings. In addition, experiments are carried out on various neural network structures and parameters in order to find the most appropriate properties for image compression. Also, there are proposed new concepts for image compression using neural networks that are also immediately tested. Finally, a network of the best concepts and parts discovered during experimentation is designed.

Diploma thesis is focused on real-time 4K video encoding using NVENC technology. First chapter describes the most used video codecs H.264 and HEVC. There is an explanation of the principle of graphic cards and their programmable units. Analysis of the solution of open source Video Codec SDK is also part of the thesis. The main focus of the thesis is an implementation of an application which can handle 4K video encoding from multiple cameras in real time. Performance and qualitative tests were performed for application. Results of these tests were analyzed and discussed.

The diploma thesis is focused on possibilities of spline approximation and interpolation of CAD imported by CAD Reader to control system. First chapter describes mathematical meaning of curves, the second chapter shows possibilities of approximation and interpolation in control system Sinumerik 840D and the third chapter applies these possibilities on practical example.

This diploma thesis focuses on current possibilities concerning the employment of wavelet transformation for video signal compression. One part of the work is devoted to the necessary execution of this task in practise. This deals with video signal and its features description, wavelet transformation and compression methods. The second part concentrates on description of selected compression method. It is the SPIHT (Set Partitioning In Hierarchical Trees) algorithm which is intended for compression of static image data. The algorithm is modified for usage with video signal compression which is specific for its time redundancy. The algorithm is called 3D SPIHT as it works in the spatial and time domain. The algorithm is implemented in the MATLAB programming environment which provides a sophisticated support for wavelet transformation (Wavelet Toolbox). To provide a simple and intuitive encoder control there has been developed an application delivering graphical user interface (GUI). On displayed image previews and measured graphs the user can change encoder parameters and monitor performed changes. There are four image test-sequential modes containing various scenes with different features. The final part of the work is focused on testing of the proposed encoding scheme, various image test-sequential modes and encoder settings. Measured values are graphically displayed and analyzed.

Modern classification of organisms is performed on molecular data. These methods rely on multiple alignment of sequences of characters which make them computationally demanding. Only small parts of genomes can be compared in reasonable time. In this paper, the novel algorithm based on conversion of the whole genome sequences to cumulative phase signals is presented. Dyadic wavelet transform is used for lossy compression of signals by redundant frequency bands elimination. Signal classification is then performed as a cluster analysis using Euclidian metrics where multiple alignment is replaced by dynamic time warping.

This master’s thesis is dealing with problems of XML data compression. It describes a characterization and important concepts of XML language as well as AIXM as XML data format. It documents contemporary compression methods of XML and divides them into appropriate groups. Thereinafter a testing of XML data compression using mentioned methods and evaluation of results is implemented. With a consideration of processed data there is created and presented an application which enables lossy and lossless compression of AIXM with the help of particular elements data analysis. All of it with user selection options of AIXM objects and way of resultant compression.

This thesis deals with the management of digital photos by metadata contained in the photos. The thesis describes the structure of the formats JFIF, TIFF, RAW and EXIF format for storing metadata into photos. In the next part of this thesis is described the design and implementation of a simple photo management application. The main functionality of the application is focused on bulk editing EXIF metadata in the photos. In the conclusion of this thesis there's a proof of results and discussion about further extension options.