A pyramid algorithm for fast fractal image compression

Author

Lin, H. ; Venetsanopoulo, A.N.

Author_Institution

Dept. of Electr. & Comput. Eng., Toronto Univ., Ont., Canada

Volume

3

fYear

1995

fDate

23-26 Oct 1995

Firstpage

596

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

computational complexity; data compression; fractals; image coding; random processes; search problems; IID Laplacian random process; computational efficiency; fast fractal image compression; fast fractal image encoding algorithm; fractal code; identically distributed Laplacian random process; matching error distribution; mean square error; objective function; pyramid algorithm; pyramidal level; quasioptimal pyramid search algorithm; search step size; threshold sequence; Compression algorithms; Computational efficiency; Electronic mail; Fractals; Image coding; Image resolution; Laplace equations; Mean square error methods; Random processes; Redundancy;

fLanguage

English

Publisher

ieee

Conference_Titel

Image Processing, 1995. Proceedings., International Conference on

Conference_Location

Washington, DC

Print_ISBN

0-8186-7310-9

Type

conf

DOI

10.1109/ICIP.1995.537705

Filename

537705