摘要
利用四叉树结构对二值图像的分割进行描述,提出既可保存数据又包含定位信息的字节分位存储方法,通过由下至上的分层递归算法实现:(1)同一算法既可以实现有损压缩又可以实现无损压缩,(2)只需要对时域中的所有象素数据一次读取,(3)分层数据可以渐进传输。在时域空间对二值图像进行分层处理后,四叉树结构的描述使压缩后的数据既带有整体特性又能实现渐进传输,同时保持了较高的压缩与图像视觉质量,算法的时间复杂性为0(n√),表明它适合用于大幅面二值图像的实时传输,或用来构造与其它结构的关系。
With a byte_dividing_to_bit method to store data,a bottom_to_top recurrence scheme ,a quadtree structure to represent the spatial layers,the proposed algorithm has the characteristics:loss compress and loss_less compress in one program,reading all pixel data only one time ,and gradually transporting the layer data.After processing a binary image into a tree,the tree has not only an integrity property,but also a good vision quality when compress rate is high.As the time complexity of the program is0(n√),the algorithm is suitable for large binary image transporting,or can be used to construct a relationship with other architectures.
出处
《计算机工程与应用》
CSCD
北大核心
2002年第9期69-71,共3页
Computer Engineering and Applications
基金
国家高性能计算基金
