基于相对梯度的自适应图像分形压缩并行算法  

The Parallel Algorithm of Relative Gradient-Based Adaptive Image Fractal Compression

作　　者：李文敬[1] 黄容伟[1] 廖伟志[1] 

机构地区：[1]广西师范学院信息技术系,广西南宁530001

出　　处：《微电子学与计算机》2007年第10期115-117,共3页Microelectronics & Computer

基　　金：广西教育厅基金项目(0626120);广西师范学院基金项目(0604A005)

摘　　要：介绍了基于IFS(Iterated Function System)的图像分形压缩技术的基本理论,利用原图像及其相对梯度图自相似的特点,采用自适应四叉树分割方法,提出了基于相对梯度的自适应图像分形压缩并行算法。算法复杂性分析表明该方法提高了图像分形的压缩比,计算量少,效率较高。This paper introduced the image fractal compression technical basic theories based on Iterated function system. It makes use of self-similarity feature from an original image and its relative gradient image. The method of adaptive quad-tree partitioning is adopted. We give a parallel algorithm of relative gradient-based adaptive image fractal compression.The algorithmic complexity analyzed indicates that the method raised compression ratio of image fractal compression, compute quantity is little, and the efficiency is higher.

关 键 词：迭代函数系统 相对梯度 自适应 分形压缩 并行算法 

分 类 号：TP31[自动化与计算机技术—计算机软件与理论]