diplomsko delo
Abstract
V diplomskem delu opišemo postopek in implementacijo novega algoritma za stiskanje risanih slik. Algoritem deluje tako, da sliko najprej razbije na povezana območja, za vsako območje izračuna verižno kodo obrobe, nato pa nize teh verižnih kod pretvori in stisne s transformacijami BWT, MTF in RLE. Na koncu nad tako stisnjenimi podatki poženemo aritmetično kodiranje. Algoritem zelo dobro deluje nad visoko kakovostnimi slikami manjše velikosti. V primerjavi s formatom PNG smo dobili tudi do 98 % boljše rezultate.
Keywords
stiskanje slik;verižne kode;transformacije nizov;aritmetično kodiranje;diplomske naloge;
Data
Language: |
Slovenian |
Year of publishing: |
2017 |
Typology: |
2.11 - Undergraduate Thesis |
Organization: |
UM FERI - Faculty of Electrical Engineering and Computer Science |
Publisher: |
A. Jeromel |
UDC: |
004.932(043.2) |
COBISS: |
20886294
|
Views: |
1194 |
Downloads: |
247 |
Average score: |
0 (0 votes) |
Metadata: |
|
Other data
Secondary language: |
English |
Secondary title: |
Cartoon image compression |
Secondary abstract: |
In this thesis, a procedure and implementation of a new cartoon image compression algorithm are presented. First, the image is segmented and a chain code for each of the segments is calculated. The resulting chain code strings are transformed and compressed with BWT, MTF and RLE. Then, arithmetic encoding is used to further compress the data. The performance of the algorithm is best with smaller images of higher quality. Compared to the lossless PNG algorithm, the compressed files of corresponding images were up to 98 % smaller. |
Secondary keywords: |
image compression;chain codes;string transformations;arithmetic encoding; |
URN: |
URN:SI:UM: |
Type (COBISS): |
Bachelor thesis/paper |
Thesis comment: |
Univ. v Mariboru, Fak. za elektrotehniko, računalništvo in informatiko, Računalništvo in informacijske tehnologije |
Pages: |
IX, 22 f. |
ID: |
10850404 |