高蕴健, 李介谷. 四叉树与数据压缩[J]. 机器人, 1987, 9(4): 38-42.
引用本文: 高蕴健, 李介谷. 四叉树与数据压缩[J]. 机器人, 1987, 9(4): 38-42.
CAO Yunjian, LI Jiegu. Quadtree and Data Compression[J]. ROBOT, 1987, 9(4): 38-42.
Citation: CAO Yunjian, LI Jiegu. Quadtree and Data Compression[J]. ROBOT, 1987, 9(4): 38-42.

四叉树与数据压缩

Quadtree and Data Compression

  • 摘要: 本文所讨论的是四叉树表示多值图的数据压缩问题.我们用四叉树表示最大灰度范围为256级的一般性图象.围绕四叉树结构,首先从其存储结构考虑,提出了按树的广度周游顺序存储的方法,从而节省了存储空间.其次用类型码的方法,对四叉树内部存在的冗余信息进一步予以压缩.我们选了一些典型的图象在PC-1000和PDP-11组成的图象系统上进行了实验.

     

    Abstract: This article deals with data compression in quadtree representation of multi-valuegray images.Quadtree is used to represent general images which have 256 values atmaximum gray range.Focusing on the structure of quadtree,first,by taking storageinto consideration,we present a method which,store the tree according to the orderof its traversal in width,so that the storage space is reduced.Second,we use typecode to make further compression of redundant information in quadtree.Severaltypical images have been selected to do experiments on the image system which iscomposed of PC-1000 and PDP-11.

     

/

返回文章
返回