A method for block coding of images based on a least squares fractal approximation by a self-affine system (SAS) is presented. The computational cost of the approximation is linear in the number of pixels in the image. The approximation to a rectangularly tiled block involves evaluating various low-order moments over the block, and solving a system of four linear equations for each tile. The method is applied to a standard test image and the effects of various optimizations are shown. A quantitative comparison with the adaptive discrete cosine transform at 8:1 compression is made. The fidelity of the fractal method shows promise and its greater speed and simplicity compared to other fractal transforms suggest immediate applications such as interactive browsing of remote image archives or image representation in multimedia systems.<<ETX>>
[1]
Deterministic rendering of self-affine fractals
,
1990
.
[2]
Arnaud E. Jacquin,et al.
A novel fractal block-coding technique for digital images
,
1990,
International Conference on Acoustics, Speech, and Signal Processing.
[3]
Gregory K. Wallace,et al.
The JPEG still picture compression standard
,
1991,
CACM.
[4]
M. Barnsley,et al.
Iterated function systems and the global construction of fractals
,
1985,
Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences.
[5]
Michael F. Barnsley,et al.
Fractal functions and interpolation
,
1986
.
[6]
M. Barnsley,et al.
Solution of an inverse problem for fractals and other sets.
,
1986,
Proceedings of the National Academy of Sciences of the United States of America.