INVESTIGATING THE POSSIBILITY OF IMPROVING TEMPORAL PERFORMANCE OF FRACTAL IMAGE COMPRESSION

Abstract

Basic principles of fractal algorithm of compression of images are presented in this article. The prospects of him are certain further development, perfection and programmatic realization. Among the various methods of code he allows to get most aspect ratios, but requires considerable calculable expenses, the fast-acting of him is not high accordingly. It is needed to mark, that decoding of images does not require such high-powered and resources of the system. Basic efforts were sent to the study, analysis and further development of approaches which are used for the compression of images and allow to decrease the amount of surplus data. The need for research is due to the high practical value and insufficient processing of the problem of the use of fractal image coding algorithms in information technologies and computer graphics. An overview and brief analysis of fractal image encoding optimization methods is performed. Options for significantly increasing the compression rate of the fractal algorithm are offered. The characteristics of the most promising options for practical use are given. The process of fractal transformation is asymmetric. That is, image playback is much faster than compression. The iterative decoding process is not a simple inversion of compression procedures and requires much less time to execute it, making it now possible to use this method to compactly store images on different storage media. The variant of algorithm, which will allow substantially to promote the fast-acting of fractal code, is offered. The sequence of steps, necessary for decoding of image is described. Classification of modern methods of fractal compression which is based on the topology of blocks is pointed. Thus, the task of storage and graphic information transfer in the most compact kind is actual enough.