.png){kind=icon}
Return
An efficient chain code with Huffman coding
.png){kind=icon}
PRE
AI
DOI：10.1016/j.patcog.2004.08.017.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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. (C) 2004 Pattern Recognition Society. Published by Elsevier Ltd. All rights reserved.
Keywords:
pattern recognition
chain code
Huffman code
object representations
chain code compression
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.6
Papers:
1.3W
Citations:
4.5W
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSave
ShareSaveShareSaveShareSaveShareSaveShareSaveShareSave
View more