Fast fractal image compression using pyramids

Huawu Lin; Anastasios N. Venetsanopoulos

doi:10.1117/1.601798

1 June 1998 Fast fractal image compression using pyramids

Huawu Lin, Anastasios N. Venetsanopoulos

Optical Engineering, Vol. 37, Issue 6, (June 1998). https://doi.org/10.1117/1.601798

Fractal image compression is based on the self-similarity search of the image. The encoding process is computationally intensive. We present a fast fractal image encoding algorithm that is based on a refinement of the fractal code from an initial coarse level of a pyramid. 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 algorithm is quasi-optimal in terms of minimizing the mean square error. Computational efficiency depends on the depth of the pyramid and the search step size, and could be improved by up to two orders of magnitude over the computational effort required for a full search of the original image.

Citation Download Citation

Huawu Lin and Anastasios N. Venetsanopoulos "Fast fractal image compression using pyramids," Optical Engineering 37(6), (1 June 1998). https://doi.org/10.1117/1.601798

Published: 1 June 1998

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available