摘要
分形方块编码(FBC)作为一种具有高压缩比潜力的图像编码方法,正受到越来越多的关注.余域中的分形方块编码(FBCRD)是对基本FBC的一种改进,它使得在编码效率及恢复图像质量基本不变的情况下,解码的迭代次数和计算时间大为减少.本文针对FBCRD又提出一种快速解码迭代结构,使得解码迭代过程进一步优化.实验表明,总的解码计算时间比基本的FBC和非快速解码结构的FBCRD都大大地减少了.这为分形图像编码应用于实际系统提供了一种有效的算法.
The interest in Fractal Block Boding (FBC)has been steadily growing for its high compressionpotential. Fractal Block Coding in Residue Domain (FBCRD)is a modification of basic FBC which leads to feweriterations and less decoding bine at the decoder while maintaining almost the same coding efficiency and imagequality. This paper further presents a fast decoding structure for FBCRD. Experiments show that the total decoding bine is lugly reduced in comparison with basic FBC and FBCRD without fast decoding structure. This improvement provides us with an effective algorithm for real applications of fractal image compression.
出处
《电子学报》
EI
CAS
CSCD
北大核心
1997年第10期95-98,共4页
Acta Electronica Sinica
基金
攀登计划
国防科工委预研基金
广东省自然科学基金
关键词
分形
图像编码
分形方块编码
解码算法
Fractal
Image coding
Fractal block coding
Decoding algorithm