A parallel decoding algorithm for IFS codes without transient behavior

Iterated function systems (IFSs) have received great attention in encoding and decoding fractal images. Barnsley (1988) has shown that IFSs for image compression can achieve a very high compression ratio for a single image. However, the major drawback of such a technique is the large computation load required to both encode and decode a fractal image. We provide a novel algorithm to decode IFS codes. The main features of this algorithm are that it is very suitable for parallel implementation and has no transient behavior. Also, from the decoding process of this method we can understand the encoding procedure explicitly. One example is illustrated to demonstrate the quality of its performance.

[1]  G. Zorpette.  Fractals: not just another pretty picture , 1988, IEEE Spectrum.

[2]  H. A. Cohen.  Deterministic scanning and hybrid algorithms for fast decoding of IFS (iterated function system) encoded image sets , 1992, [Proceedings] ICASSP-92: 1992 IEEE International Conference on Acoustics, Speech, and Signal Processing.

[3]  Horst Bischof,et al.  Combining pyramidal and fractal image coding , 1992, Proceedings., 11th IAPR International Conference on Pattern Recognition. Vol. III. Conference C: Image, Speech and Signal Analysis,.

[4]  Jaroslav Stark.  Iterated Function Systems as neural networks , 1991, Neural Networks.

[5]  E. Kreyszig.  Introductory Functional Analysis With Applications , 1978 .

[6]  Heinz-Otto Peitgen,et al.  The science of fractal images , 2011 .

[7]  THE HAGUE-THE NETHERLANDS , 2022 .

[8]  Jorge Herbert de Lira,et al.  Two-Dimensional Signal and Image Processing , 1989 .

[9]  Arnaud E. Jacquin,et al.  Image coding based on a fractal theory of iterated contractive image transformations , 1992, IEEE Trans. Image Process..

[10]  Michael F. Barnsley,et al.  A better way to compress images , 1988 .

[11]  C. Sparrow.  The Fractal Geometry of Nature , 1984 .