Non-search fractal image compression algorithm research

In order to solve the problem of long time of fractal image compression, a kind of adaptive non-search fractal image compression coding is put forward. This algorithm assigns specific domain block as matching block, thus search is required and coding is accelerated. Besides, this algorithm adopts the method of range block adaptive decomposition and combination, and can solve problems like part of range blocks incapable of matching and low compression ratio of non-search method. Experiments indicate that this algorithm is better than search fractal image compression algorithm and JPEG algorithm.