3 March 1995 Fractal-based method for textured-image compression
Author Affiliations +
Abstract
Textured images are generally difficult to compress because they contain a large number of high frequency components which are difficult to capture with traditional compression schemes such as transform coding, especially at high compression ratios. Since many textures possess a high degree of self-similarity at different scales, the fractal compression technique can be applied to effectively encode such textured images by exploiting this self-similar property. The main drawback of fractal compression is that the fractal encoding procedure is very time consuming. In this research, we focus on the speed up of this procedure by introducing three schemes: dimensionality reduction, energy-based classification, and tree search. We have developed an algorithm that combines these three schemes together and achieves a speed-up factor of 177 at the expense of only 0.4 dB degradation in PSNR relative to the unmodified exhaustive search for a typical textured image encoded with 0.44 bpp.
© (1995) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Pere Obrador, Pere Obrador, Gregory Caso, Gregory Caso, C.-C. Jay Kuo, C.-C. Jay Kuo, } "Fractal-based method for textured-image compression", Proc. SPIE 2418, Still-Image Compression, (3 March 1995); doi: 10.1117/12.204137; https://doi.org/10.1117/12.204137
PROCEEDINGS
12 PAGES


SHARE
RELATED CONTENT

Fast methods for fractal image encoding
Proceedings of SPIE (April 21 1995)
Geometric methods for wavelet-based image compression
Proceedings of SPIE (November 13 2003)
Space-frequency methods in image compression
Proceedings of SPIE (November 14 1996)
Two-step matching approach for fractal image encoding
Proceedings of SPIE (December 21 1998)

Back to Top