magistrsko delo
Luka KOvačič (Author), Borut Žalik (Mentor), Štefan Kohek (Co-mentor)

Abstract

V magistrskem delu najprej predstavimo Haarovo transformacijo. Nato razložimo pojme in podatkovne strukture, potrebne za razumevanje algoritma SPIHT. Predstavimo psevdokod implementacije kodiranja in dekodiranja. Delovanje pokažemo na primeru. Algoritem implementiramo in ga testiramo na različnih slikah. Učinkovitost stiskanja primerjamo s formati PNG, JPEG in JPEG 2000, ki se izkaže kot najučinkovitejši.

Keywords

SPIHT;drevesa prostorske orientacije;Haarova transformacija;rastrske slike;napredujoče stiskanje;magistrske naloge;

Data

Language: Slovenian
Year of publishing:
Typology: 2.09 - Master's Thesis
Organization: UM FERI - Faculty of Electrical Engineering and Computer Science
Publisher: [L. Kovačič]
UDC: 004.353.244:004.422.63(043.2)
COBISS: 194024963 Link will open in a new window
Views: 96
Downloads: 20
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: SPIHT implementation
Secondary abstract: In this thesis, first, the Haar transform is presented. Then, the basic concepts and data structures necessary for understanding the SPIHT algorithm are explained. Pseudocode implementations of encoding and decoding are presented. Their functioning is illustrated with an example. The algorithm is implemented and tested on different images. Compres- sion efficiency is compared with the PNG, JPEG, and JPEG 2000 formats. The most efficient was JPEG 2000.
Secondary keywords: SPIHT;spatial orientation trees;Haar transform;raster images;progressive coding;
Type (COBISS): Master's thesis/paper
Thesis comment: Univ. v Mariboru, Fak. za elektrotehniko, računalništvo in informatiko, Računalništvo in informacijske tehnologije
Pages: 1 spletni vir (1 datoteka PDF (XI, 48 f.))
ID: 22884122
Recommended works:
, magistrsko delo
, diplomska naloga univerzitetnega študijskega programa
, diplomsko delo