改进的广义置信度自适应IFS图象压缩编码算法  

Revised Adaptive Threshold IFS Image Compression Based on Generalized Creditability

作　　者：董云朝[1] 陈贺新[2] 余松煜[1] 

机构地区：[1]上海交通大学图象与通信研究所,上海200030 [2]吉林大学信息科学与工程学院,长春130025

出　　处：《中国图象图形学报（A辑）》2001年第12期1175-1179,共5页Journal of Image and Graphics

基　　金：原机械工业部跨世纪优秀人才资助项目 (972 5 0 40 2 )

摘　　要：通过对分块 IFS图象压缩编码过程中匹配误差的分析 ,提出了广义置信度的概念 ,并据此提出了对输入图象进行四叉树分块的自适应匹配门限 (AT)算法 .根据排列块的相对复杂程度 ,修正了自适应匹配门限的公式 ,提出了改进的自适应门限 (RAT) IFS图象压缩编码算法 .在对输入图象进行四叉树分块编码过程中 ,该方法可以根据当前排列块的统计特征确定匹配门限 ,从而使分块编码过程自动地适应输入图象 .实验结果表明 ,这种新的编码方法可以自适应地对输入图象进行编码 ,且压缩比较高 。In this paper, the MSE in IFS image compression is analyzed. The concept of generalized creditability is presented. Based on that, the algorithm of the adaptive threshold(AT) IFS image compression using quadrature partitioning structure is proposed. To improve the compression ratio of the AT algorithm while still keeping the visual performance of decoded image, the formula of the adaptive threshold is revised according to the relative complexity of each range block, which forms the revised adaptive threshold(RAT) algorithm. The methods proposed in this paper set the threshold of current range block according to its statistics character, that is, variability. Therefore, the encoding process is adaptive to the complexity of the input image. Experiments results of algorithms based on AT, RAT and fixed threshold are given in this paper as comparison. The results show that RAT algorithm can compress the input image adaptively and the compression efficiency is improved considerably. Also time consumption of each algorithm is discussed at the end of this paper.

关 键 词：图象压缩 迭代函数系统 广义置信度 自适应门限 IFS 编码算法 

分 类 号：TN919.81[电子电信—通信与信息系统]