Speeding up fractal-image compression

Behnam Bani-Eqbal

doi:10.1117/12.204140

3 March 1995 Speeding up fractal image compression

Behnam Bani-Eqbal

Proceedings Volume 2418, Still-Image Compression; (1995) https://doi.org/10.1117/12.204140
Event: IS&T/SPIE's Symposium on Electronic Imaging: Science and Technology, 1995, San Jose, CA, United States

Abstract

Fractal coding of digital images offers many promising qualities. However the coding process suffers from the long search time of the domain block pool. We offer a new approach to speed up the search, based on an efficient solution of the following problem. Given a sphere and a collection of lines going through the origin in Euclidean space, enumerate those lines which intersect the sphere. Experimental results show that the algorithm speeds up the coding process by up to 50 times.

Citation Download Citation

Behnam Bani-Eqbal "Speeding up fractal image compression", Proc. SPIE 2418, Still-Image Compression, (3 March 1995); https://doi.org/10.1117/12.204140

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