Fast hybrid fractal image compression algorithm for color images

One of the biggest problems in the IFS-based image compression is very long encoding time. In this paper we present a new improved algorithm for IFS-compression (also called fractal compression) of color images. The algorithm we propose allows us to reduce significantly the time in building the fractal code and enhance some other characteristics of existing fractal image compression algorithms. Along with “standard” fractal encoding in our algorithm we use also vector quantization and an original method of restoration of smooth blocks. This hybrid method keeps the resolution-independence of the usual fractal encoders. The influence of isometries on the quality of IFS-code is studied