Paper Info
Title
Simple fast and adaptive lossless image compression algorithm
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.
Year
DOI
Venue
2007
10.1002/spe.v37:1
Softw., Pract. Exper.
Keywords
DocType
Volume
lossless image compression,predictive coding,adaptive modeling,medical imaging,golomb{rice codes
Journal
37
Issue
ISSN
Citations 
1
0038-0644
9
PageRank 
References 
Authors
0.84
15
1
Name
Order
Citations
PageRank
Roman Starosolski1397.30