.png){kind=icon}
返回
Efficiency of chain codes to represent binary objects
.png){kind=icon}
PRE
AI
DOI：10.1016/j.patcog.2006.10.013.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We present a study of compression efficiency for binary objects or bi-level images for different chain-code schemes. Chain-code techniques are used for compression of bi-level images because they preserve information and allow a considerable data reduction. Furthermore, chain codes are the standard input format for numerous shape-analysis algorithms. In this work we apply chain codes to represent object with holes and we compare their compression efficiency for seven chain codes. We have also compared all these chain codes with the JBIG standard for bi-level images. (c) 2006 Pattern Recognition Society. Published by Elsevier Ltd. All rights reserved.
Keyword:
chain coding
shapes
bi-level images
Huffman algorithm
entropy
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.6
论文数:
1.3W
被引数:
4.5W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏Resonance Raman studies of the p-benzosemiquinone and p, p′-biphenylsemiquinone free-radical anions
PREAI
分享收藏
查看更多内容