摘要
给出分形压缩编码的改进算法,直接将原图像分成较大的块Di,再将原图分成较小的块或同大小的Ri,将Ri按照规定的方法分成较小的分类,然后直接在其中一个相对应的分类中去简单搜索Ri,如果找不到需要的Ri,就自己构造一个虚拟的Ri并存储构造过程中需要的修正值,而不用每次都从巨大的分类库中去搜索Ri,从而可以省去大量的搜索时间,使编码速度大大地提高.
This article gives an improved algorithm. The original image is directly divided into larger blocks Di,and also divided into smaller blocks or the same size of Ri which are divided into smaller categories by the defined standard. And then it searches the attractor in the corresponding classes,if it does not find out the right Ri,it will construct the fictitious Ri and save the correctional value instead of searching Ri from the huge database. In this way,it will save most time and greatly improved the speed of the coding.
出处
《微电子学与计算机》
CSCD
北大核心
2010年第5期103-105,共3页
Microelectronics & Computer
基金
重庆邮电大学青年基金项目(A2006-58)
关键词
图像压缩
分形
四叉树
编码
image compression
fractal
quadtree
coding
