Fast fractal image encoding based on adaptive search

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.