The searching computation of the best matched domain block is most heavy in the fractal encoding process.

We further propose a possible fast hybrid fractal encoding algorithm which combines existing fast search methods, statistical normalization and frequency domain comparison.

Thus, encoding an image by fractal techniques consists of finding an appropriate contractive transformation whose fixed point is the best possible approximation of the original image.