A pyramid algorithm for fast fractal image compression
- 19 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 3, 596-599 vol.3
- https://doi.org/10.1109/icip.1995.537705
Abstract
We present a fast fractal image encoding algorithm which is based on a refinement of the fractal code from an initial coarse level of the pyramid. The pyramid search algorithm is quasi-optimal in terms of minimizing the mean square error. Assuming that the distribution of the matching error is described by an independent, identically distributed (i.i.d.) Laplacian random process, we derive the threshold sequence for the objective function in each pyramidal level. The computational efficiency depends on the depth of the pyramid and the search step size and could be improved up to two orders of magnitude compared with the full search of the original image.Keywords
This publication has 2 references indexed in Scilit:
- Image coding based on a fractal theory of iterated contractive image transformationsIEEE Transactions on Image Processing, 1992
- The Laplacian Pyramid as a Compact Image CodeIEEE Transactions on Communications, 1983