An effective fractal image compression algorithm

Fractal coding is a novel method to compress images, which was proposed by Barnsley, and implemented by Jacquin. It offers many advantages. This paper proposes a new method using best polynomial approximation to decide whether a domain block is similar enough to a given range block. Also the paper gives a kind of domain pool. It is found that the probability distribution of 8 isometries in the fractal code is not average. And consequently it is proposed to use only 2 or 4 isometries to speed up compression. At last some testing results on Lena and Peppers are given.