作　　者： ; ;

机构地区： 华中科技大学计算机科学与技术学院

出　　处： 《小型微型计算机系统》 2007年第8期1465-1469,共5页

摘　　要： 现有的快速分形编码算法多数是在没有考虑人眼视觉系统(HVS)的前提下实现的,针对这个问题,利用HVS的特性,提出了一种基于新型四叉树的快速分形图像压缩算法.在算法中,一幅方形图像先被分成四个大小相等的方块,然后测试每一方块是否满足一致性标准.如果满足标准则不再细分,否则将其分为大小相等的四块,再对每一块实施一致性检验.重复此过程直到每一块都满足一致性标准为止.理论分析和试验结果表明,相对于经典分形压缩方法,本文算法在获得相近重建图像质量的同时,压缩比和编码速度都有了显著的提高,是一种有效的分形图像压缩编码方法. Most of existing fast fractal encoding algorithms don't take the HVS (Human Visual System) into consideration. Therefore, according to the feature of HVS, a novel quadtree-based algorithm for fast fractal image compression is presented. In our algorithm a square image is divided into four equal-sized square blocks, and then each block is tested to see if it meets some criterion of homogeneity. If a block meets the criterion, it is not divided any further. If it does not meet the criterion, it is subdivided again into four blocks, and the test criterion is applied to those blocks. This process is repeated iteratively until each block meets the criterion. Theoretical and experimental results show that the proposed algorithm can almost achieve the same reconstructed image quality as the traditional Jacquin's algorithm, and can greatly reduce the encoding time and improve the compression ratio. Therefore, this algorithm is an effective encoding method for fractal image compression.

关 键 词： 四叉树 分形图像压缩 人眼视觉系统

领　　域： [自动化与计算机技术] [自动化与计算机技术]