20.500.12556/DKUM-27218 An efficient chain code with Huffman coding 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. computer science pattern recognition chain code Huffman code object representations chain code compression računalništvo razpoznavanje vzorcev verižna koda Huffmanova koda predstavitev objektov stiskanje verižne kode true false false Angleški jezik Angleški jezik Neznano 2012-06-01 10:06:33 2012-06-01 10:06:33 2022-04-15 03:43:41 2019-07-10 12:13:08 2005 0 0 0000-00-00 NiDoloceno NiDoloceno NiDoloceno 0000-00-00 0000-00-00 0000-00-00 004.93 9270294 0031-3203 URN:SI:UM:DK:IK0TNCUE http://dx.doi.org/10.1016/j.patcog.2004.08.017 1 https://dk.um.si/Dokument.php?lang=slv&id=36473 Fakulteta za elektrotehniko, računalništvo in informatiko 0 0 0