|
|
Educational Application of Compression Algorithms
Kaše, David ; Tříska, Vít (referee) ; Košař, Vlastimil (advisor)
This bachelor thesis studies the basic principles and methods of compression algorithms. After identification of these basic methods, a few algorithms are selected to represent these methods. For the selected algorithms is designed an aplication, which is then implemented for education with emphasis on visualization of algorithms steps. Application development takes into account the addition of additional algorithms.
|
|
|
Implementation of Statistical Compression Methods
Beněk, Tomáš ; Polok, Lukáš (referee) ; Bařina, David (advisor)
This thesis deals with the statistical compression methods. This work describes basic theoretical introduction to the data compression and the most important representatives of statistical methods. There is also described compression process based on the Burrows-Wheeler algorithm, which is implemented in the form of portable library in C++ programming language. This work compares effectiveness of each method on suitable data corpus, which contains various data types and according to achieved results discusses suitability of usage of methods and possible improvements.
|
|
|
Implementation of Statistical Compression Method
Šreibr, Jakub ; Polok, Lukáš (referee) ; Bařina, David (advisor)
In this thesis statistical methods for data compression are presented. It deals with projecting of compression process and with it's implementation in a form of program library, which is created in language C++. Description and analysis of compression methods are discussed. The results of tests, which were performed with different compression methods are demonstrated.
|
|
|
Visualization of lossless compression algorithms
Madeja, Jiří ; Číž, Radim (referee) ; Šilhavý, Pavel (advisor)
This thesis focuses mainly on the development of visualization software for some of the most used lossless data compression algorithms. The first part of the thesis is devoted to the theoretical findings from the lossless data compression field. The second part of the thesis deals with the description of practical development of the software using Matlab. The draft is mainly focused on creating such environment to input data which will be encoded using most common lossless data compression algorithms, the comparison based on efficiency of those algorithms and visualization of the algorithm characteristics while in the process of encoding. Last part of the thesis is focused on presenting the final result of the software development.
|
|
|
Comparison of Modern Lossy Image Compression Formats
Kalabza, Marek ; Klíma, Ondřej (referee) ; Bařina, David (advisor)
This thesis compares modern compression methods of digital images on given datasets in terms of quality. First part describes the principle of lossy compression and then compression of JPEG, Lepton, JPEG 2000, JPEG XR, WebP, BPG, HEIF, H.265 intra frame, H.264 intra frame and AV1. Second part focuses on testing, comparison of results and evaluation. It also describes quality metrics (PSNR, PSNR-YUV, SSIM), deals with possible artefacts created during compression and points out the behavior of formats after data corruption. Based on testing and measurement, it was found that the best compression format from the tested lossy image formats is the AV1 format, specifically on the high resolution dataset, the scanned document dataset, and the map dataset.
|
|
|
Algoritmy bezeztrátové komprese a jejich vizualizace
Košvica, David
This work introduces the area of lossless compression algorithms and aims to create a visualization of an algorithm that belongs to this category. The algorithm that was chosen for visualization purposes was an algorithm named Arithmetic coding and its visualization was implemented as a web application running inside a web browser.
|
|
|
Arithmetic coding on GPU
Buneev, Leonid ; Horáček, Jan (advisor) ; Kruliš, Martin (referee)
The aim of this thesis is to investigate possibilities for creating parallel arithmetic coding implementation and measure performance improvements. In the first part, short overview of Arithmetic coding with its serial implementation (FastAC by Amir Said) is presented. The thesis then describes principles of work with GPUs and identifies possibilities of algorithm improvement and parallelization. Several parallel implementations are given, with varying performance improvements and occasional drawbacks. In conclusion, thesis provides results of performance tests of our implementation, as well as discussion about feasibility of applying GPU-oriented version of algorithm instead of serial one in real-world applications. Powered by TCPDF (www.tcpdf.org)
|
|
|
Implementation of Statistical Compression Methods
Štys, Jiří ; Polok, Lukáš (referee) ; Bařina, David (advisor)
This thesis describes Burrow-Wheeler compression algorithm. It focuses on each part of Burrow-Wheeler algorithm, most of all on and entropic coders. In section are described methods like move to front, inverse frequences, interval coding, etc. Among the described entropy coders are Huffman, arithmetic and Rice-Golomg coders. In conclusion there is testing of described methods of global structure transformation and entropic coders. Best combinations are compared with the most common compress algorithm.
|
|
|
Comparison of Modern Lossy Image Compression Formats
Kalabza, Marek ; Klíma, Ondřej (referee) ; Bařina, David (advisor)
This thesis compares modern compression methods of digital images on given datasets in terms of quality. First part describes the principle of lossy compression and then compression of JPEG, Lepton, JPEG 2000, JPEG XR, WebP, BPG, HEIF, H.265 intra frame, H.264 intra frame and AV1. Second part focuses on testing, comparison of results and evaluation. It also describes quality metrics (PSNR, PSNR-YUV, SSIM), deals with possible artefacts created during compression and points out the behavior of formats after data corruption. Based on testing and measurement, it was found that the best compression format from the tested lossy image formats is the AV1 format, specifically on the high resolution dataset, the scanned document dataset, and the map dataset.
|
|
|
Arithmetic coding on GPU
Buneev, Leonid ; Horáček, Jan (advisor) ; Kruliš, Martin (referee)
The aim of this thesis is to investigate possibilities for creating parallel arithmetic coding implementation and measure performance improvements. In the first part, short overview of Arithmetic coding with its serial implementation (FastAC by Amir Said) is presented. The thesis then describes principles of work with GPUs and identifies possibilities of algorithm improvement and parallelization. Several parallel implementations are given, with varying performance improvements and occasional drawbacks. In conclusion, thesis provides results of performance tests of our implementation, as well as discussion about feasibility of applying GPU-oriented version of algorithm instead of serial one in real-world applications. Powered by TCPDF (www.tcpdf.org)
|
guest ::
