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.
Efficient image compression algorithm
Image Processing Algorithms and Techniques III ; 1992 ; San Jose,CA,United States
Proc. SPIE ; 1657
1992-05-19
Aufsatz (Konferenz)
Elektronische Ressource
Englisch
Fast and efficient fractal image compression algorithm [3545-129]
British Library Conference Proceedings | 1998
|Efficient embedded subband coding algorithm for DCT image compression [4551-08]
British Library Conference Proceedings | 2001
|An image-data-compression algorithm
NTRS | 1981
|Memory-efficient spatial prediction image compression scheme
British Library Online Contents | 2007
|An Efficient Algorithm for Hierarchical Compression of Video
British Library Conference Proceedings | 1994
|