Simple fast and adaptive lossless image compression algorithm

Authors:
Roman Starosolski
Affiliations:
Silesian University of Technology, Institute of Computer Science, Akademicka 16, 44–100 Gliwice, Poland
Venue:
Software—Practice & Experience
Year:
2007

Citing 0
Cited 2

Simple Compression Algorithm for Memoryless Laplacian Source Based on the Optimal Companding Technique

Informatica
PCIF: An Algorithm for Lossless True Color Image Compression

IWCIA '09 Proceedings of the 13th International Workshop on Combinatorial Image Analysis

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we present a new lossless image compression algorithm. To achieve the high compression speed we use a linear prediction, modified Golomb–Rice code family, and a very fast prediction error modeling method. We compare the algorithm experimentally with others for medical and natural continuous tone grayscale images of depths of up to 16 bits. Its results are especially good for large images, for natural images of high bit depths, and for noisy images. The average compression speed on Intel Xeon 3.06 GHz CPU is 47 MB/s. For large images the speed is over 60 MB/s, i.e. the algorithm needs less than 50 CPU cycles per byte of image. Copyright © 2006 John Wiley & Sons, Ltd.