A new method for encoding a sequence of integers, named Binary Adaptive Sequential Coding with Return to Bias, is proposed in this paper. It extends the compressing pipeline for chain codes’ compression consisting of Burrows Wheeler Transform, Move-To-Front Transform, and Adaptive Arithmetic Coding. We also explain when to include the Zero-Run Transform into the above-mentioned pipeline. The Zero-Run Transform generates a sequence of integers corresponding to the number of zero-runs. This sequence is encoded by Golomb coding, Binary Adaptive Sequential Coding, and the new Binary Adaptive Sequential Coding with Return to Bias. Finally, a comparison is performed with the two state-of-the-art methods. The proposed method achieved similar compression efficiency for the Freeman chain code in eight directions. However, for the chain codes with shorter alphabets (Freeman chain code in four directions, Vertex Chain Code, and Three-OrThogonal chain code), the introduced method outperforms the referenced ones.

一种用于编码整数序列的新方法，称为具有返回偏差的二进制自适应顺序编码本文提出。它扩展了用于链码压缩的压缩流水线，包括Burrows Wheeler变换，Move-To-Front变换和自适应算术编码。我们还说明了何时将零游变换包含在上述管道中。零游程转换生成与零游程数相对应的整数序列。该序列通过Golomb编码，二进制自适应顺序编码和带有“返回到偏移”的新二进制自适应顺序编码进行编码。最后，使用两种最先进的方法进行比较。所提出的方法在八个方向上对Freeman链码实现了相似的压缩效率。但是，对于字母较短的链码（四个方向的Freeman链码，Vertex链码和Three-OrThogonal链码），