19 May 1992 Efficient image compression algorithm
Author Affiliations +
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.
© (1992) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Evangelos A. Yfantis, Matthew Y. Au, G. Miel, "Efficient image compression algorithm", Proc. SPIE 1657, Image Processing Algorithms and Techniques III, (19 May 1992); doi: 10.1117/12.58321; https://doi.org/10.1117/12.58321
PROCEEDINGS
10 PAGES


SHARE
KEYWORDS
Image compression

Image processing

Image storage

Information operations

Computer graphics

Computer programming

Visualization

RELATED CONTENT

Error-resilient image compression based on JPEG
Proceedings of SPIE (March 13 1996)
Scanline algorithms in compressed domain
Proceedings of SPIE (March 22 1996)
Visualization of space series
Proceedings of SPIE (June 01 1992)

Back to Top