Abstract
This paper presents a new adaptive search approach to reduce the computational complexity of fractal encoding. A simple but very efficient adaptive necessary condition is introduced to exclude a large number of unqualified domain blocks so as to speed-up fractal image compression. Furthermore, we analyzed an unconventional affine parameter that has better properties than the conventional luminance offset. Specifically, we formulated an optimal bit allocation scheme for the simultaneous quantizations of the usual scaling and the aforementioned unconventional affine parameter. Experiments on standard images showed that our adaptive search method yields superior performance over conventional fractal encoding.
Original language | English |
---|---|
Pages (from-to) | 1269-1277 |
Number of pages | 9 |
Journal | IEEE Transactions on Image Processing |
Volume | 10 |
Issue number | 9 |
DOIs | |
Publication status | Published - Sept 2001 |
Scopus Subject Areas
- Software
- Computer Graphics and Computer-Aided Design
User-Defined Keywords
- Adaptive search methods
- Fractal encoding
- Image compression
- Optimal bit allocation