Attractor image compression with a fast non-iterative decoding algorithm
- 1 January 1993
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 5, 337-340 vol.5
- https://doi.org/10.1109/icassp.1993.319816
Abstract
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.Keywords
This publication has 4 references indexed in Scilit:
- Fractal Image Compression Using Iterated TransformsPublished by Springer Nature ,1992
- Image coding based on a fractal theory of iterated contractive image transformationsIEEE Transactions on Image Processing, 1992
- Fractal Image EncodingPublished by Defense Technical Information Center (DTIC) ,1990
- Vector quantiser of video signalsElectronics Letters, 1982