1. FLoCIC: A Few Lines of Code for Raster Image CompressionBorut Žalik, Damjan Strnad, Štefan Kohek, Ivana Kolingerová, Andrej Nerat, Niko Lukač, Bogdan Lipuš, Mitja Žalik, David Podgorelec, 2023, izvirni znanstveni članek Ključne besede: computer science, algorithm, prediction, interpolative coding, PNG, JPEG LS, JPEG 2000 lossless
Objavljeno v DKUM: 22.05.2024; Ogledov: 165; Prenosov: 29
 Celotno besedilo (10,78 MB)
Gradivo ima več datotek! Več... |
2. Lossless Compression of High-frequency Intervals in Digital Audio : bachelor's thesisIvan Benc, 2022, diplomsko delo Opis: In this Thesis, an algorithm for lossless audio compression in a time domain is developed and implemented. The algorithm is designed to estimate the signal frequency based on the number of local extremes, and adapts the encoding to the estimated high or low- frequency intervals. As possible adaptations, fitting line segments, quadratic Bézier curves to the signal, and dictionary compression are examined. Residuals are encoded with delta encoding and compressed with binary adaptive sequential coding. The difference in the proportions of line segments and curves used in the high and low-frequency intervals have been detected, but this is not significant enough for this kind of interval discrimination to be meaningful in the current design of the algorithm.
Ključne besede: lossless audio compression, delta encoding, binary adaptive sequential coding, greedy method
Objavljeno v DKUM: 07.11.2022; Ogledov: 672; Prenosov: 54
Celotno besedilo (1,90 MB) |
3. Lossless geometry compression through changing 3D coordinates into 1DYongkui Liu, Lijun He, Peng-jie Wang, Linghua Li, Borut Žalik, 2013, izvirni znanstveni članek Opis: A method of lossless geometry compression on the coordinates of the vertexes for grid model is presented. First, the 3D coordinates are pre-processed to be transformed into a specific form. Then these 3D coordinates are changed into 1D data by making the three coordinates of a vertex represented by only a position number, which is made of a large integer. To minimize the integers, they are sorted and the differences between two adjacent vertexes are stored in a vertex table. In addition to the technique of geometry compression on coordinates, an improved method for storing the compressed topological data in a facet table is proposed to make the method more complete and efficient. The experimental results show that the proposed method has a better compression rate than the latest method of lossless geometry compression, the Isenburg-Lindstrom-Snoeyink method. The theoretical analysis and the experiment results also show that the important decompression time of the new method is short. Though the new method is explained in the case of a triangular grid, it can also be used in other forms of grid model.
Ključne besede: triangular mesh, model, lossless, compression
Objavljeno v DKUM: 12.07.2017; Ogledov: 1955; Prenosov: 399
Celotno besedilo (332,44 KB)
Gradivo ima več datotek! Več... |
