Algoritmi verižnih kod

diplomsko delo univerzitetnega študijskega programa

David Lebeničnik (Author), Borut Žalik (Mentor), Bojan Rupnik (Co-mentor)

Abstract

Algoritmi verižnih kod so algoritmi stiskanja brez izgube obrisov črnobelih rastrskih objektov. Pri verižnih kodah zakodiramo smer premika iz trenutnega v naslednji piksel. S premikanjem nadaljujemo, dokler ne pridemo do začetne točke. Implementirali smo štiri algoritme verižnih kod: 4-smerno Freemanovo kodo, 8-smerno Freemanovo kodo, ogliščno verižno kodo in stisnjeno verižno kodo. Najboljše rezultate glede števila bitov, potrebnih za kodiranje premika, da stisnjena verižna koda. Sledita ji 4-smerna Freemanova verižna koda in ogliščna verižna koda, ki v povprečju porabita približno enako število bitov. Najmanj učinkovita je 8-smerna Freemanova koda.

Keywords

verižne kode;4-smerna Freemanova verižna koda;8-smerna Freemanova verižna koda;ogliščna verižna koda;stisnjena verižna koda;

Data

Language:	Slovenian
Year of publishing:	2011
Source:	Maribor
Typology:	2.11 - Undergraduate Thesis
Organization:	UM FERI - Faculty of Electrical Engineering and Computer Science
Publisher:	[D. Lebeničnik]
UDC:	004.94(043.2)
COBISS:	15875862
Views:	1557
Downloads:	134
Average score:	0 (0 votes)
Metadata:

Other data

Secondary language:	English
Secondary title:	Chain code algorithms
Secondary abstract:	Chain code algorithms are lossless compression algorithms for compressing borders of black and white raster objects. The chain codes code the direction of the movement from the considered to the next pixel. This movement is executed until the initial point is reached. We have implemented four chain code algorithms: Freeman chain code of four directions, Freeman chain code of eight directions, vertex chain code, and compressed vertex chain code. Considering the number of the bits needed for the code, the best results are obtained by the compressed vertex chain code. It is followed by Freeman chain code of four directions and vertex chain code, which both use approximately equal number of bits. Freeman chain code of eight directions uses the highest number of bits.
Secondary keywords:	chain code;Freeman chain code of four directions;Freeman chain code of eight directions;vertex chain code;compressed vertex chain code;
URN:	URN:SI:UM:
Type (COBISS):	Bachelor thesis/paper
Thesis comment:	Univ. v Mariboru, Fak. za elektrotehniko, računalništvo in informatiko
Pages:	VI, 18 f.
Keywords (UDC):	science and knowledge;organization;computer science;information;documentation;librarianship;institutions;publications;znanost in znanje;organizacije;informacije;dokumentacija;bibliotekarstvo;institucije;publikacije;prolegomena;fundamentals of knowledge and culture;propaedeutics;prolegomena;splošne osnove znanosti in kulture;computer science and technology;computing;data processing;računalniška znanost in tehnologija;računalništvo;obdelava podatkov;application-oriented computer-based techniques;računalniške tehnike za namensko rabo;aplikativno usmerjene računalniško podprte tehnike;simulation;simulacija;
ID:	1015905