分形插值图像压缩的一种快速解码算法  

A Fast Decode Algorithm of Fractal Interpolation Image Compression

作　　者：俞璐[1,2] 吴乐南[1] 

机构地区：[1]东南大学无线电工程系 [2]解放军理工大学通信工程学院,江苏南京210007

出　　处：《信号处理》2005年第5期465-469,共5页Journal of Signal Processing

摘　　要：一维分形插值图像编码是用插值点数据构造分形曲线来拟合数字图像的灰度曲线从而实现压缩。其解码过程就是求用插值点数据构造的迭代函数系统(IFS)的吸引子,由于图像数据以及分形插值迭代规律的特殊性,使得随机迭代算法和通常的固定迭代算法并不适用。本文设计了快速且节省内存的解码算法,并进行了复杂度分析。同时,本文的算法作为分形插值方法的一部分,同样可以用在分形插值法的其他应用领域。One dimensioned fractal interpolation image encoding is to approach grey curve of the digital image with a fractal curve built on some interpolation data. The decode process is to find the attractor of the IFS which is constructed with interpolation data. Because of particularity of the image data and fractal interpolation, neither stochastic iteration nor general fixed iteration is suitable to use. A fast decode algorithm which takes up much less memory is brought up in this paper and the complexity analysis is also made. As a part of the fractal interpolation method, the algorithm in the paper can also be used in other applied fields of fractal interpolation.

关 键 词：分形插值 迭代函数系统 吸引子 分形插值方法 解码算法 图像压缩 迭代函数系统(IFS) 随机迭代算法 分形曲线 数据构造 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构] TD325[自动化与计算机技术—计算机科学与技术]