一种改进的BSP二值图像压缩算法研究  

An improved BSP binary image compression algorithm

作　　者：余志超[1] 张瑞红[1] 

机构地区：[1]黄冈师范学院计算机科学与技术学院,湖北黄州438000

出　　处：《黄冈师范学院学报》2006年第3期54-57,共4页Journal of Huanggang Normal University

摘　　要：针对二值图像矩形划分编码在划分时存在的问题,本文提出一种改进的BSP二值图像的压缩算法.该算法以二叉树为数据结构,以达到减小中间结点的开销;同时该算法的时间复杂度和空间复杂度均低于采用四叉树结构来压缩二值图像.其压缩比可提高17%;同时适用于复杂图像.Considering the problem of binary image code based on rectangular partitioning, an improved BSP binary image compression algorithm is provided. The algorithm uses binary tree as data structure so as to reduce the consumption of inter-node. Compared with the quadtree structure, the algorithm has the easier time complexity and space complexity. It has a C/R increase of 17%, and can be applied to complex image.

关 键 词：二值图像 无损压缩 有损压缩 二叉树 

分 类 号：TP311.12[自动化与计算机技术—计算机软件与理论]