1 October 1992 Efficient image compression algorithm for computer-animated images
Author Affiliations +
J. of Electronic Imaging, 1(4), (1992). doi:10.1117/12.59970
Abstract
An image compression algorithm is described. The algorithm is an extension of the run-length image compression algorithm and its implementation is relatively easy. This algorithm was implemented and compared with other existing popular compression algorithms and with the Lempel-Ziv (LZ) coding. The Lempel-Ziv algorithm is available as a utility in the UNIX operating system and is also referred to as the UNIX uncompress. Sometimes our algorithm is best in terms of saving memory space, and sometimes one of the competing algorithms is best. The algorithm is lossless, and the intent is for the algorithm to be used in computer graphics animated images. Comparisons made with the LZ algorithm indicate that the decompression time using our algorithm is faster than that using the LZ algorithm. Once the data are in memory, a relatively simple and fast transformation is applied to uncompress the file.
Evangelos A. Yfantis, Matthew Y. Au, G. Miel, "Efficient image compression algorithm for computer-animated images," Journal of Electronic Imaging 1(4), (1 October 1992). http://dx.doi.org/10.1117/12.59970
JOURNAL ARTICLE
7 PAGES


SHARE
KEYWORDS
Image compression

Raster graphics

Algorithm development

Computer graphics

Data storage

Computer programming

Gold

RELATED CONTENT


Back to Top