We propose a novel approach for the lossless compression of binary images using logic minimization. The image is divided into windows or blocks of size r/spl times/c pixels and each block is transformed into a Boolean switching function in cubical form, treating the pixel values as output of the function. Compression is performed by minimizing these switching functions using ESPRESSO, a cube-based two-level logic minimizer. To reduce the bits required to encode the minimized cubes (product terms), a code set which satisfies the prefix property is used. If this technique fails to produce compression for a window, the pixels are stored as such. The main motivation of the work has been to investigate the potential of logic minimization as a tool for image data compression. Our technique outperforms UNIX compress in terms of compression ratio on most of the test images. The compression scheme is relatively slower while the decompression time is comparable to that of UNIX compress.
展开▼
机译:我们提出了一种使用逻辑最小化对二进制图像进行无损压缩的新颖方法。图像被划分为大小为r / spl times / c像素的窗口或块,并且每个块被转换为立方形式的布尔开关函数,将像素值视为函数的输出。通过使用基于多维数据集的两级逻辑最小化器ESPRESSO最小化这些切换功能来执行压缩。为了减少对最小化的多维数据集(乘积项)进行编码所需的位,使用了满足prefix属性的代码集。如果此技术无法对窗口产生压缩,则将像素照原样存储。这项工作的主要动机是研究逻辑最小化作为图像数据压缩工具的潜力。在大多数测试映像上,我们的技术在压缩率方面均优于UNIX压缩。压缩方案相对较慢,而解压缩时间与UNIX压缩相当。
展开▼