王丽娜, 刘晓东, 贺兴华, 沈灿岭. 基于子域对角和的快速分形图像编码算法[J]. 微电子学与计算机, 2011, 28(5): 82-86.
引用本文: 王丽娜, 刘晓东, 贺兴华, 沈灿岭. 基于子域对角和的快速分形图像编码算法[J]. 微电子学与计算机, 2011, 28(5): 82-86.
WANG Li-na, LIU Xiao-dong, HE Xing-hua, SHEN Can-ling. Fast Fractal Image Coding Algorithm Based on Subregion Diagonal Sum[J]. Microelectronics & Computer, 2011, 28(5): 82-86.
Citation: WANG Li-na, LIU Xiao-dong, HE Xing-hua, SHEN Can-ling. Fast Fractal Image Coding Algorithm Based on Subregion Diagonal Sum[J]. Microelectronics & Computer, 2011, 28(5): 82-86.

基于子域对角和的快速分形图像编码算法

Fast Fractal Image Coding Algorithm Based on Subregion Diagonal Sum

  • 摘要: 为了改进分形图像压缩编码过程耗时过长而影响实用的问题, 新定义了子域对角和来描述图像块的特征.算法把码本按照子域对角和特征的大小排序, 对每个待编码的Range块, 仅在赋序码本中找到与Range块的子域对角和的数值最接近的Domain块, 并在此Domain块的邻域内搜索最佳匹配块.实验结果表明, 在保证解码图像质量的前提下, 该算法较快地提高了编码速度.

     

    Abstract: To reduce the long encoding time in fractal compression process which limits its various practical applications, the paper proposes a newly-defined subregion diagonal sum of normalized image block.After sorting the blocks in the codebook according to their subregion diagonal sum, the encoder finds out the nearest domain block in sorted codebook to each range block being encoded in the sense of subregion diagonal sum, then the encoder visits the codebook blocks in the vicinity of this nearest domain block to search out the best-matched block.Experimental results show that the proposed algorithm can significantly improve coding speed with the gurantee of decoded image′s quality.

     

/

返回文章
返回