Improved distance coding of binary images by run length coding of the most probable interval
Improved distance coding of binary images by run length coding of the most probable interval
复制标题
通过最可能区间的游程长度编码改进二值图像的距离编码
DOI：
10.1109/secon.2015.7132957
复制
发表时间：
2015
期刊：
影响因子：
--
通讯作者：
W. David Pan
中科院分区：
文献类型：
--
作者：
A. Liaghati;W. David Pan
我们提出了一种新方法，以改善我们先前的二进制图像距离编码的工作，在该工作中，我们通过在一系列间隔上应用BZIP2无损数据压缩机来压缩二进制图像，该间隔代表相同的源符号之间的距离 - 零或二进制图像的图像。通过观察到大多数间隔往往是一个，我们建议我们与其他间隔独立于此最可能的间隔来运行长度代码。单独的Huffman编码表用于编码最可能的间隔的运行长度与其他间隔。因此，这种混合编码方案允许平均将一位分配给最可能的间隔，而不是每个间隔至少一个位，而无需运行长度编码，从而促进了约17％的改善。一些测试图像。
We proposed a new method to improve our previous work on efficient distance-coding of binary images, where we compressed a binary image by applying the bzip2 lossless data compressor on a sequence of intervals, which represent the distances between identical source symbols - either zeros or ones for binary images. Motivated by the observation that a majority of intervals tends to be one, we propose to run-length code this most probable interval independently from the rest of the intervals. Separate Huffman coding tables were used to code the run-lengths of the most probable interval versus other intervals. Consequently, this hybrid coding scheme allows a fraction of one bit to be assigned to the most probable interval on average, as opposed to at least one bit per interval without run-length coding, thereby contributing to about 17% improvement on the compression ratios on some test images.