摘要
针对分形编码压缩时间太长、以至于该算法很难达到实用的缺点 ,提出了对图像进行分级预处理 ,即根据被压缩图像的实际情况建立一个数据压缩字典 ,使得被压缩图像的匹配块仅在数据压缩字典指定的块中进行 ,从而大大减少图像压缩过程中的搜索范围和压缩时间·此外 ,给出了建立数据压缩字典的理论基础 ,并根据此思想给出了一个新的实现分形编码算法·实验表明 ,在提高压缩比的同时 。
The compression time of fractal coding algorithm is so long that the algorithm is hardly useful in reality. The idea to preprocess the image by means of many grey levels was presented. It constructs a data compression dictionary based on compressed image, so that the compression block matched in the image is only searched in the data compression dictionary. As a result, this algorithm greatly shortens the compression time and the searching scope in the compression procedure,compared with other algorithms of the fractal block coding. In addition, the theoretical basis of constructing the data compression dictionary was obtained. Based on the new compression idea, a concrete algorithm of realizing fractal image coding was designed. The new algorithm can improve compression ratio while reducing encoding time.
出处
《东北大学学报（自然科学版）》
EI
CAS
CSCD
北大核心
2000年第2期147-150,共4页
Journal of Northeastern University(Natural Science)
基金
教育部博士点学科专项科研基金! ( 970 145 10 )
辽宁省自然科学基金! ( 962 177)
关键词
分形
数据压缩
图像编码
压缩字典
算法
fractal
data compression
image coding
compression dictionary
