IMPROVEMENT OF METHODS AND ALGORITHM OF FRACTAL COMPRESSION OF A GRAPHIC IMAGE

Abstract

During the intensive development of information systems, the volumes of data necessary for storing and processing information, in particular graphic images, grow. One of the reasons for this phenomenon is the desire to continually improve the quality of the content we receive. The ever-growing demand for image quality requires the development of new and improvement of existing approaches to information compression. Compression algorithms use the presence of so-called surplus in the data, which can be eliminated during data storage and restored during playback. Currently in demand methods are based on storing only low-frequency components. Such methods are used in JPEG, MPEG compression algorithms. The disadvantage of such algorithms is not a large compression ratio. In this regard, methods have emerged based on fractal data compression. The main idea of ​​the method is to store the image as affine transformations, which leads to its compression.
 The paper proposes preliminary processing of graphic data for storing them in the form of a file with the * .json extension. The application of a further fractal compression algorithm to the already obtained file allows to reduce the processing time of data, computational calculations. The resulting file will have the advantages of fractal compression such as decompression speed, better compression ratio and higher resolution compared to * .jpeg and * .bmp.
 Despite all the advantages, fractal compression of graphic information is used quite rarely. This is due to the complexity of the algorithm, the lack of a sufficient number of specialists on this issue and the estimate of the licensed software. The improvement is aimed at simplifying the algorithm and its implementation will avoid these drawbacks and expand the scope of fractal compression.