diplomsko delo
Boštjan Eferl (Author), Peter Planinšič (Mentor)

Abstract

Delo obravnava brezizgubno kompresijo podatkov, temeljna obravnavana metoda je lastno razvita metoda, ki za komprimiranje uporablja celoštevilske ostanke pri deljenju števila n, ki predstavlja podatke z nekim številom m, ki je lahko naključno generirano. Komprimirane podatke predstavlja ostanek r, za zapis katerega je potrebno manj bitov, kot za zapis števila n. Dekomprimiranje se vrši tako, da se najde tisto število k, ki zadovolji enačbo n_domnevni =km + r na ta način, da dobljen nd prestane teste s kriteriji, ki jih pričakujemo, da jih bo izpolnjeval komprimiran tip podatkov. Števila n, nd, k, m in r so cela števila. Če stopnja kompresije ni prevelika, skoraj zagotovo obstaja samo en poizkus iz velike množice poizkusov, ki ta test prestane. Lažno pozitivnih rezultatov dekomprimiranja ni, ker se podatki po tem ko so komprimirani preizkusno dekomprimirajo, če obstaja samo en poizkus dekodiranja, ki prestane teste in so ti dekomprimirani podatki enaki izvornim, bodo tudi vsa nadaljnja dekomprimiranja pravilna, če se le uporabi enaka metoda dekomprimiranja.

Keywords

stiskanje podatkov;Python;merilni podatki;diplomske naloge;

Data

Language: Slovenian
Year of publishing:
Typology: 2.11 - Undergraduate Thesis
Organization: UM FERI - Faculty of Electrical Engineering and Computer Science
Publisher: [B. Eferl]
UDC: 004.627(043.2)
COBISS: 19937046 Link will open in a new window
Views: 749
Downloads: 75
Average score: 0 (0 votes)
Metadata: JSON JSON-RDF JSON-LD TURTLE N-TRIPLES XML RDFA MICRODATA DC-XML DC-RDF RDF

Other data

Secondary language: English
Secondary title: LOSSLESS COMPRESSION OF MEASUREMENT DATA
Secondary abstract: Work treats lossless data compression, the main method treated is the method of own development, which uses whole number reminders obtained by division of number n by some number m, which can be randomly generated. Number r represents compressed data, for whose representation less bits are needed than for the representation of the number n. Decompression is done by finding such number k which satisfies the equation n_domnevni = km + r in such a way that obtained nd passes the tests with criteria which are expected for the compressed type of data to satisfy. Numbers n, nd, k, m and r are whole numbers. If the level of compression is not to high, then almost certainly exists only one test from the large set of tests, which passes this test. There are no false positive attempts of decompression, because right after the compression the attempt of decompression is performed, if there exists only one attempt of decompression, which passes the tests and these decompressed data are the same as the source data, then all the subsequent decompressions will be correct, if the same decompression method is used.
Secondary keywords: data compression;measurement data;
URN: URN:SI:UM:
Type (COBISS): Undergraduate thesis
Thesis comment: Univ. v Mariboru, Fak. za elektrotehniko, računalništvo in informatiko, Elektrotehnika
Pages: [VI], 45, [1] f.
ID: 9165447