Abstract: Because binary images can be regarded as mapping of Boolean functions, this paper proposes an encoding scheme based on minimization of Boolean function for representing binary images. The bigger storage compression is achieved compared to quadtrees and other tree-type representations. The result shows that the number of codes required to represent a binary image by the proposed scheme is about half of that by the quadtrees.

Key words: Binary image, Boolean function, Quadtree, Transformation

摘要： 由于二值图像可以认作一幅布尔函数的映射，因此该文提出了基于布尔函数最小化表示的布尔值图像的编码方法。它与4叉树等树型表示比较，获得了更好的存储压缩。结果表明，所提出的方法表示一幅二值图像所需求的代码数目大约仅是4叉树的一半左右。

关键词: 二值图像, 布尔函数, 4叉树, 变换

CLC Number: 

• TP37