ǂAn ǂefficient chain code with Huffman coding

Yong Kui Liu (Author), Borut Žalik (Author)

Abstract

This paper presents a new chain code based on the eight-direction Freeman code. Each element in the chain is coded as a relative angle difference between it and the previous element. Statistical analysis showed that the probabilities of the Freeman codes differ importantly. Therefore, the Huffman coding was applied. The proposed chain code requires 1.97 bits/code, its chainlength is small, it allows representation of non-closed patterns and is rotationally independent.

Keywords

računalništvo;razpoznavanje vzorcev;verižna koda;Huffmanova koda;predstavitev objektov;stiskanje verižne kode;computer science;pattern recognition;chain code;Huffman code;object representations;chain code compression;

Data

Language:	English
Year of publishing:	2005
Typology:	1.01 - Original Scientific Article
Organization:	UM FERI - Faculty of Electrical Engineering and Computer Science
UDC:	004.93
COBISS:	9270294
ISSN:	0031-3203
Views:	1416
Downloads:	95
Average score:	0 (0 votes)
Metadata:

Other data

Secondary language:	English
Secondary keywords:	računalništvo;razpoznavanje vzorcev;verižna koda;Huffmanova koda;predstavitev objektov;stiskanje verižne kode;
URN:	URN:SI:UM:
Pages:	str. 553-557
Volume:	ǂVol. ǂ38
Issue:	ǂiss. ǂ4
Chronology:	2005
ID:	8718465