一种基于去均值的加速收敛的分形压缩算法

张颖; 余英林

doi:10.11834/jig.19980486

论文与报告 | 浏览量 : 0 下载量: 123 CSCD: 0

PDF
导出
分享
收藏
专辑

一种基于去均值的加速收敛的分形压缩算法
A New Mean Residual Fractal Image Coding With Fast Decoding
1998年3卷第4期页码：285
纸质出版：1998
DOI： 10.11834/jig.19980486
稿件说明：

移动端阅览

张颖, 余英林. 一种基于去均值的加速收敛的分形压缩算法[J]. 中国图象图形学报, 1998,3(4):285. DOI： 10.11834/jig.19980486.

A New Mean Residual Fractal Image Coding With Fast Decoding[J]. Journal of Image and Graphics, 1998, 3(4): 285. DOI： 10.11834/jig.19980486.

摘要

通过研究传统分形压缩算法中解码迭代过程的收敛性问题，提出了一种新的基于去均值的加速收敛的分形压缩算法，理论分析和实验证明新算法的解码迭代次数要大大少于传统分形压缩算法，并且具有运算复杂度相对降低，恢复图象的PSNR提高等优点。进一步地，我们将新算法结合到自适应四叉树分割的结构中，在压缩比和图象质量之间取得较好的折衷，实验结果优于相同条件下的传统分形压缩算法。

Abstract

A new mean residual fractal image coding algorithm with fast decoding is proposed in this paper. Theoretical analysis and experimental tests have shown that the iteration times in decoding process are reduced significantly with an improved PSNR value. In addition

the proposed new method is further combined with adaptive quadtree partition to obtain a good trade off between compression ratio and image quality. Superior coding perfermance is confirmed by simulation tests as compared to the conventional fractal coding.