A full quadtree searchless IFS fractal image encoding algorithm applicable in both high and low compression rates

Fractal Image Compression is rarely used in high-quality image compression situation because of its long encoding time and inefficiency of encoding book structure. This paper introduces a novel searchless fractal encoding algorithm based on full quadtree range block partition that can efficiently encode 2x2 range blocks or even individual pixels. This approach addresses both problems and thus can be used to perform high-quality image compression. Experimental results show that the algorithm is capable of providing superior performance in achieving better compression ratio and reconstructed image quality compared to traditional search-based and searchless fractal methods in both low and high compression rates. Another advantage of the algorithm is its fast encoding speed since no search process is needed in this approach. The encoding time of this algorithm is only a fraction of traditional fractal algorithms.