Reducing the codebook size in fractal image compression by geometrical analysis

Julien Signes

doi:10.1117/12.233215

27 February 1996 Reducing the codebook size in fractal image compression by geometrical analysis

Julien Signes

Proceedings Volume 2727, Visual Communications and Image Processing '96; (1996) https://doi.org/10.1117/12.233215
Event: Visual Communications and Image Processing '96, 1996, Orlando, FL, United States

Abstract

In most IFS based image coding schemes, the domain blocks codebook searched is independent from the input image, identical for all range blocks of the same size, and non optimized. In order to get a good match between range and domain blocks, a huge codebook is used, which is both inefficient in terms of computational complexity and output bit rate. We propose to design an optimal reduced codebook for the whole image thanks to a geometrical analysis of the basic scheme. We then compare this method with a 'local' codebook method, which leads us to some conclusions about the differences between IFS and vectorial quantization (VQ) based coding schemes.

Citation Download Citation

Julien Signes "Reducing the codebook size in fractal image compression by geometrical analysis", Proc. SPIE 2727, Visual Communications and Image Processing '96, (27 February 1996); https://doi.org/10.1117/12.233215

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