The Algorithm and Complexity Analyses of Relative Gradient-based Adaptive Image Fractal Compression

摘要

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 an algorithm of relative gradient-based adaptive image fractal compression. And the algorithmic parallel processing is discussed .The algorithmic complexity analyzed indicates that the method raised compression ratio of image fractal compression, compute quantity is little, and the efficiency is higher.