Dai Vito, Zakhor Avideh
Advanced Micro Devices, Sunnyvale, CA 94088-3453, USA.
IEEE Trans Image Process. 2006 Sep;15(9):2522-30. doi: 10.1109/tip.2006.877414.
We present a novel lossless compression algorithm called Context Copy Combinatorial Code (C4), which integrates the advantages of two very disparate compression techniques: context-based modeling and Lempel-Ziv (LZ) style copying. While the algorithm can be applied to many lossless compression applications, such as document image compression, our primary target application has been lossless compression of integrated circuit layout image data. These images contain a heterogeneous mix of data: dense repetitive data better suited to LZ-style coding, and less dense structured data, better suited to context-based encoding. As part of C4, we have developed a novel binary entropy coding technique called combinatorial coding which is simultaneously as efficient as arithmetic coding, and as fast as Huffman coding. Compression results show C4 outperforms JBIG, ZIP, BZIP2, and two-dimensional LZ, and achieves lossless compression ratios greater than 22 for binary layout image data, and greater than 14 for gray-pixel image data.
我们提出了一种名为上下文复制组合码(C4)的新型无损压缩算法,它融合了两种截然不同的压缩技术的优点:基于上下文的建模和莱姆佩尔-齐夫(LZ)风格的复制。虽然该算法可应用于许多无损压缩应用,如文档图像压缩,但我们的主要目标应用一直是集成电路布局图像数据的无损压缩。这些图像包含异质混合的数据:更适合LZ风格编码的密集重复数据,以及更适合基于上下文编码的密度较低的结构化数据。作为C4的一部分,我们开发了一种名为组合编码的新型二进制熵编码技术,它既像算术编码一样高效,又像哈夫曼编码一样快速。压缩结果表明,C4优于JBIG、ZIP、BZIP2和二维LZ,对于二进制布局图像数据,其无损压缩比大于22,对于灰度像素图像数据,其无损压缩比大于14。