Share Email Print

Proceedings Paper

Efficient image compression algorithm
Author(s): Evangelos A. Yfantis; Matthew Y. Au; G. Miel
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

An image compression algorithm is described in this research paper. The algorithm is an extension of the run-length image compression algorithm. The implementation of this algorithm is relatively easy. This algorithm was implemented and compared with other existing popular compression algorithms. As we show in this paper, sometimes our algorithm is best in terms of saving memory space, and sometimes one of the competing algorithms is best. Once the data is in the real memory a relatively simple and fast transformation is applied to uncompress the file. In image processing and computer graphics a scene drawn on the screen requires considerable amount of RAM space. This space in todays computers is in the order of 1 Mb. To create animation it is often required that we calculate several scenes, some of them stored on the disk and considerable number of them stored in real memory. Our algorithm compresses images that ordinarily take in the order of 1 Mb of memory to a few tens of Kbs of memory thus enabling us to store many images in real memory in a relatively small space.

Paper Details

Date Published: 19 May 1992
PDF: 10 pages
Proc. SPIE 1657, Image Processing Algorithms and Techniques III, (19 May 1992); doi: 10.1117/12.58321
Show Author Affiliations
Evangelos A. Yfantis, Univ. of Nevada/Las Vegas (United States)
Matthew Y. Au, Univ. of Nevada/Las Vegas (United States)
G. Miel, Univ. of Nevada/Las Vegas (United States)

Published in SPIE Proceedings Vol. 1657:
Image Processing Algorithms and Techniques III
James R. Sullivan; Benjamin M. Dawson; Majid Rabbani, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?