.png){kind=icon}
返回
An efficient chain code with Huffman coding
.png){kind=icon}
PRE
AI
DOI：10.1016/j.patcog.2004.08.017.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
pattern recognition
chain code
Huffman code
object representations
chain code compression
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.6
论文数:
1.3W
被引数:
4.5W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏
分享收藏分享收藏
查看更多内容