Share Email Print

Proceedings Paper

Speeding up fractal-image compression
Author(s): Behnam Bani-Eqbal
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper 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.

Paper Details

Date Published: 3 March 1995
PDF: 8 pages
Proc. SPIE 2418, Still-Image Compression, (3 March 1995); doi: 10.1117/12.204140
Show Author Affiliations
Behnam Bani-Eqbal, Univ. of Manchester (United Kingdom)

Published in SPIE Proceedings Vol. 2418:
Still-Image Compression
Majid Rabbani; Edward J. Delp; Sarah A. Rajala, Editor(s)

© SPIE. Terms of Use
Back to Top