Increasing the Speed of Fractal Image Compression Using Two-Dimensional Approximating Transformations
Maydaniuk, V. P.
Arseniuk, I. R.
Lishchuk, O. O
MetadataShow full item record
- Наукові роботи каф. ПЗ 
Fractal image compression algorithm is known for allowing very high compression rates (the best examples – up to 1 000 times with acceptable visual quality) for real photos of natural objects, which is not possible for other lossy compression methods. The main disadvantage of the fractal method is the low rate of encoding, which is due to the fact that in order to obtain high image quality for each rank block, it is necessary to perform a search of all domain blocks, and for each domain block, at least eight affine transformations must be performed. Despite the large number of works devoted to increasing the speed of fractal images compression, it is worth noting that this problem remains very relevant. The aim of the work is to find methods for increasing the speed of fractal image compression. Based on the analysis of known approaches of increasing the fractal compression rate, a proposed method is based on the representation of rank and domain blocks in the form of coefficients of two-dimensional linear approximation, which allows for each rank block to perform a rapid pre-selection of blocks by three approximation coefficients. With the selected blocks, the transformations that are characteristic for fractal compression are performed. Since the quantity of the selected blocks is considerably less than the total number of domain blocks, one should expect a significant gain in the sealing speed. The simulation done in the Python programming language showed that the proposed method can increase the fractal image compression rate by on average of 10 times compared to Arnaud Jacquin’s method without significant loss of image visual quality.
Please use this identifier to cite or link to this item: