Rate/distortion in fractal compression: order of transform and block symmetries
- 17 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
The authors have evaluated two complexity options in fractal image coding, namely the order of the fractal approximation and the benefits of searching over block symmetries. This was done in terms of the the entropy and distortion for a range of quantizations of the fractal coefficients. The results question the current wisdom in this field. Most fractal block coding systems use a low order approximation, while the present results suggest that where the distortion and compression are similar, a higher order approximation gives a noticeably sharper image. Virtually all reported fractal coding algorithms search for the best block reflections and rotations, but the present authors demonstrate that extra bits required to code the symmetry options are not compensated for by the modest fidelity gained.Keywords
This publication has 7 references indexed in Scilit:
- Generalized fractal transforms: complexity issuesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A novel fractal block-coding technique for digital imagesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A hybrid fractal transformPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1993
- Image coding based on a fractal theory of iterated contractive image transformationsIEEE Transactions on Image Processing, 1992
- Fractal approximation of image blocksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1992
- Solution of an inverse problem for fractals and other setsProceedings of the National Academy of Sciences, 1986
- Least squares quantization in PCMIEEE Transactions on Information Theory, 1982