Fractal compression of digital image processing.

Image compression techniques have become a hot topic due to the increasing growth of multimedia applications. This paper presents a ground-breaking full quadtree range block partition-based search-less fractal encoding algorithm that can efficiently encode range blocks or even individual pixels. This method, which may also be applied to high-quality image compression, solves both issues. Experimental results show that the technique outperforms traditional search-based and search-less fractal algorithms at low and high compression rates, thus improving both compression ratio and reconstructed image quality. Another advantage of the approach is its speedy encoding speed because it does not require a search process. When compared to traditional fractal algorithms, this method encrypts data much faster. [ABSTRACT FROM AUTHOR]