An efficient chain code with Huffman codingLiu, Yong Kui (Avtor) Žalik, Borut (Avtor) computer sciencepattern recognitionchain codeHuffman codeobject representationschain code compressionThis 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.20052012-06-01 10:06:33Neznano27218UDK: 004.93COBISS_ID: 9270294ISSN pri članku: 0031-3203NUK URN: URN:SI:UM:DK:IK0TNCUEsl