An efficient chain code with Huffman coding |
| |
| Authors: | Yong Kui Liu |
| |
| Affiliation: | a Dalian Nationalities University, Computer Science Department, Dalian 116600, China
b University of Maribor, Faculty of Electrical Engineering and Computer Science, Smetanova ulica 17, SI-2000 Maribor, Slovenia |
| |
| 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 chain length is short, it allows the representation of non-closed patterns, and it is rotationally independent. |
| |
| Keywords: | Pattern recognition Chain code Huffman code Object representations Chain code compression |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
