Fractals everywhere
Optimization by Vector Space Methods
Optimization by Vector Space Methods
Hi-index | 0.00 |
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. We show how this problem may be sidestepped by introducing a modification providing an iteration-free decoder. The coding results are not inflicted by this modification. The new decoding algorithm requires only 1 multiplication and 3 additions per pixel.