Simple fast and adaptive lossless image compression algorithm
Simple fast and adaptive lossless image compression algorithm
复制标题
DOI：
10.1002/spe.746
复制
发表时间：
2007-01
期刊：
影响因子：
--
通讯作者：
R. Starosolski
中科院分区：
文献类型：
--
作者：
R. Starosolski
本文提出了一种新的无损图像压缩算法。为了实现高压缩速度，我们使用线性预测，修改Golomb-Rice码族，和一个非常快速的预测误差建模方法。我们比较了算法实验与其他人的医疗和自然连续色调灰度图像的深度高达16位。它的结果对于大图像、高比特深度的自然图像和噪声图像特别好。Intel Xeon 3.06 GHz CPU的平均压缩速度为47 MB/s。对于大图像，速度超过60 MB/s，即该算法每字节图像需要不到50个CPU周期。版权所有© 2006约翰威利父子有限公司.
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.