Fractal Image Compression Based on Matching Error Threshold

This paper proposes a fractal image encoding algorithm based on matching error threshold: first the authors set up two kick-out conditions to reduce the capacity of the codebook, and then set up a matching threshold when searching the best matching blocks, which can shorten its runtime greatly. Meanwhile, the authors discard the isometric transformations that are mentioned in most literatures, because the usage of the isometric transformations only increase the computational complexity, the same or even better reconstructed image can achieve through reducing the sliding step of producing domain blocks. Experimental results indicate that the proposed algorithm can both shorten the encoding time greatly and achieve the same or better reconstructed image quality as compared with the basic fractal encoding algorithm with full search.