【作者】 蒋海波； 尹立新； 宋秀敏；

【Author】 Jiang Haibo Yin Lixin Song Xiumin (School of Information Science and Engineering,Shandong University,Jinan 250100)

【机构】 山东大学信息科学与工程学院；

【摘要】 二值图像矩形划分编码利用了矩形顶点位置的冗余来减少编码点数,提高了图像压缩率。但是对于黑白像素变化频繁的图像,矩形划分编码还不能有效的减少编码点数,提高压缩率。本文针对矩形划分编码的这一局限性提出了边缘匹配矩形划分编码算法,该算法利用对边缘点的填0或填1来扩大矩形面积,减少编码点数。实验证明,边缘匹配矩形划分算法在划分矩形时能进一步减少矩形数量,提高图像的压缩率。更多还原

【Abstract】 Rectangular Partition Coding of binary image uses redundancy of rectangular vertex to reduce coding points and improve compression ratio of the image.But for some images which black and white pixels change frequently,rectangular partition coding can not effectively reduce the coding points,so it also can not effectively improve compression ratio of the image.In this paper,a better method called Edge Matching Rectangular Partition Coding is proposed for this limitation.This method uses filling 0 or 1 to the points which on the edge of the image to expand rectangular area and reduce coding points.Experiments show that we can get less numbers of rectangular when partitioning images and improve the compression ratio with Edge Matching Rectangular Partition Coding.更多还原