.png){kind=icon}
返回
Chain code compression with modified interpolative coding
.png){kind=icon}
PRE
AI
DOI：10.1016/j.compeleceng.2019.05.001.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
A lossless chain code compression algorithm consisting of Burrows-Wheeler Transform, Move-To-Front Transform, and a modified interpolative coding is presented in this paper. The interpolative coding divides a strictly increasing array of integers and encodes the middle element recursively, where the required number of bits is obtained from the difference of the array's border values. In this paper, it is shown that, for some intervals, Golomb coding is more efficient than the interpolative coding. This fact was used to construct a hybrid approach that yields slightly better compression results than the state-of-the-art while compressing Three OrThogonal chain code, Freeman chain code in four and eight directions, and Vertex Chain Code. (C) 2019 Elsevier Ltd. All rights reserved.
Keyword:
Algorithm
Chain codes
Lossless compression
Golomb coding
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.9
论文数:
6.7K
被引数:
1.3W
机构
引用论文
.png){kind=icon}
分享收藏
分享收藏
分享收藏
查看更多内容