Attractor image compression with a fast non-iterative decoding algorithm

The problem of decoder convergence speed in an attractor (fractal-based) image compression system is considered. The general principles of such a system are described in the context of discrete linear spaces. A problem with previous implementations is that the decoding rests on an iterative procedure whose complexity is image-dependent. It is shown how this problem can be sidestepped by introducing a modification providing an iteration-free decoder. The coding results are not affected by this modification. The new decoding algorithm requires only one multiplication and three additions per pixel. The algorithm is suitable for applications where fast display of images is essential, such as retrieval of images from compressed databases.<>