Domain indexing for fractal image compression

Hsueh-Ting Chu; Chaur-Chin Chen

doi:10.1117/12.386667

30 May 2000 Domain indexing for fractal image compression

Hsueh-Ting Chu, Chaur-Chin Chen

Proceedings Volume 4067, Visual Communications and Image Processing 2000; (2000) https://doi.org/10.1117/12.386667
Event: Visual Communications and Image Processing 2000, 2000, Perth, Australia

Abstract

This paper presents a novel algorithm to accelerate the encoding procedure of fractal image compression. We develop an indexing technology to access candidate domain blocks. The location of maximal gradient is adopted as the key for indexing. Only those blocks whose positions of maximal gradients matching that of a given range block are rested. In our experiments, the new algorithm promises good performance. It takes few seconds to encode a 512 by 512 image on a Pentium II 450 PC with a slight loss of decoded image fidelity.

Citation Download Citation

Hsueh-Ting Chu and Chaur-Chin Chen "Domain indexing for fractal image compression", Proc. SPIE 4067, Visual Communications and Image Processing 2000, (30 May 2000); https://doi.org/10.1117/12.386667

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