The fractal compression of images allows to receive the greatest factor of compression, high image quality and resolution, which is not depending from initial image resolution. However, encoding process by this method has characterised by low speed that lay in the long search time for domain blocks. In this work question of increasing the speed of fractal compression of photo realistic images are considering.Keywords: fractal image compression, affine transform, IFS, image encoding, table method of search. FRACTAL ENCODING-DECODING ALGORITHMThe one ofpossible fractal image encoding circuit has offered by Jacquin [2,3], and is containing follow steps. Image is partitioned by non-overlapping square range blocks of size nxn. Next, for every range block, a similar but larger domain block is found. The domain blocks usually size 2nx2n and are located anywhere on the image. On the way eight mapping variants with attracting affine transforming used. It is turns of the image on corners 90, 180, 270 (-90) degrees concerning its centre and symmetry translation about orthogonal axis.Approximation accuracy has concluded by mean square error:Selected

No abstract