| Title: | An efficient chain code with Huffman coding |
|---|
| Authors: | ID Liu, Yong Kui (Author)
ID Žalik, Borut (Author) |
|---|
| Files: |  http://dx.doi.org/10.1016/j.patcog.2004.08.017
|
|---|
| Language: | English |
|---|
| Work type: | Unknown |
|---|
| Typology: | 1.01 - Original Scientific Article |
|---|
| Organization: | FERI - Faculty of Electrical Engineering and Computer Science
|
|---|
| 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: | computer science, pattern recognition, chain code, Huffman code, object representations, chain code compression |
|---|
| Year of publishing: | 2005 |
|---|
| PID: | 20.500.12556/DKUM-27218  |
|---|
| UDC: | 004.93 |
|---|
| ISSN on article: | 0031-3203 |
|---|
| COBISS.SI-ID: | 9270294 |
|---|
| NUK URN: | URN:SI:UM:DK:IK0TNCUE |
|---|
| Publication date in DKUM: | 01.06.2012 |
|---|
| Views: | 2051 |
|---|
| Downloads: | 122 |
|---|
| Metadata: |    |
|---|
| Categories: | Misc.
|
|---|
|
:
|
Copy citation |
|---|
| | | | Average score: | (0 votes) |
|---|
| Your score: | Voting is allowed only for logged in users. |
|---|
| Share: |  |
|---|
Hover the mouse pointer over a document title to show the abstract or click
on the title to get all document metadata. |
