.png){kind=icon}
.png){kind=icon}
Return
Chain code compression with modified interpolative coding
.png){kind=icon}
PRE
AI
DOI：10.1016/j.compeleceng.2019.05.001.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
Algorithm
Chain codes
Lossless compression
Golomb coding
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
C
IF:
4.9
Papers:
6.7K
Citations:
1.3W