计算机应用 ›› 2010, Vol. 30 ›› Issue (2): 337-340.

• 图形图像处理 • 上一篇    下一篇

基于像素分布与三角形分割的快速分形图像压缩算法

朱志良1,赵玉丽2,于海1   

  1. 1. 东北大学
    2. 辽宁省沈阳市东北大学
  • 收稿日期:2009-08-30 修回日期:2009-10-02 发布日期:2010-02-10 出版日期:2010-02-01
  • 通讯作者: 赵玉丽
  • 基金资助:
    国家自然科学基金资助项目;辽宁省自然科学基金

Efficient fractal image compression based on pixels distribution and triangular segmentation

  • Received:2009-08-30 Revised:2009-10-02 Online:2010-02-10 Published:2010-02-01

摘要: 为解决传统分形图像压缩算法中编码速度慢的问题,提出了一种基于像素分布和等腰直角三角形分割的快速分形图像压缩方法。利用离散质点系质心的唯一性以及质心位置不变的特点,实现了定义域块与值域块的匹配。对原始图像采用等腰直角三角形的划分方式,减少了定义域块的数量和搜索匹配块的运算次数,提高了编码效率。实验结果表明,该方法在保证图像解码质量的前提下,编码速度是传统分形图像压缩编码方法的3倍。

关键词: 数字媒体, 分形压缩, 像素分布, 质心, 三角形分割

Abstract: The baseline fractal image compression algorithm requires a great deal of time to complete the encoding process. In order to solve this problem, an efficient fractal image compression based on pixels distribution and triangular segmentation was proposed in this paper. Exploiting the characteristics of centroid uniqueness and centriod position invariance in discrete particulate system, the matching between range blocks and domain blocks was implemented. In addition, dividing original image into isosceles right triangles segmentation could reduce the number of domain blocks, and raise the efficiency of fractal coding. Experimental results show that the proposed algorithm can produce reconstructed images with good quality and require one third time of the baseline encoding algorithm.

Key words: digital media, fractal compression, pixels distribution, centroid, triangular segmentation