首页 | 本学科首页   官方微博 | 高级检索  
     

基于变异系数的分形图像压缩稀疏编码算法
引用本文:庞慧慧,张爱华.基于变异系数的分形图像压缩稀疏编码算法[J].计算机应用研究,2021,38(8):2485-2489.
作者姓名:庞慧慧  张爱华
作者单位:南京邮电大学 理学院,南京210023
基金项目:江苏省自然科学基金资助项目(BK20160880)
摘    要:针对分形图像编码算法复杂度高、编码时间冗长的问题,提出正交稀疏编码和纹理特征提取表示图像块的方法.首先,灰度级的正交稀疏变换提高了图像的重建质量和解码时间.其次,相关系数矩阵度量范围块和域块之间的变异系数特征降低了冗余度和编码时间.仿真实验结果显示,该方法与传统的分形图像编码算法相比,图像重建质量更好,编码速度更快.

关 键 词:正交稀疏编码  变异系数  曼哈顿距离  分形图像压缩  多项式拟合  核密度估计
收稿时间:2020/8/1 0:00:00
修稿时间:2021/7/9 0:00:00

Sparse coding algorithm for fractal image compression based on coefficient of variation
Pang Huihui and Zhang Aihua.Sparse coding algorithm for fractal image compression based on coefficient of variation[J].Application Research of Computers,2021,38(8):2485-2489.
Authors:Pang Huihui and Zhang Aihua
Affiliation:Nanjing University of Posts and Telecommunications,
Abstract:Aiming at the problem of high complexity and long coding time of fractal image coding algorithm, the paper proposes orthogonal sparse coding and texture feature extraction to represent image blocks. Firstly, the orthogonal sparse transformation of gray level improved the image reconstruction quality and decoding time. Secondly, the correlation coefficient matrix measured the coefficient of variation characteristics between the range block and the domain block to reduce redundancy and coding time. The simulation results show that the proposed method has better image reconstruction quality and faster coding speed than the traditional fractal image coding algorithm.
Keywords:orthogonal sparse coding  coefficient of variation  Manhattan distance  fractal image compression(FIC)  polynomial fitting  kernel density estimation
本文献已被 万方数据 等数据库收录!
点击此处可从《计算机应用研究》浏览原始摘要信息
点击此处可从《计算机应用研究》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号