2006
DOI: 10.1002/spe.746
|View full text |Cite
|
Sign up to set email alerts
|

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 big images, for natural images of high bit depths, and for noisy images. The average compression speed on Intel Xeon 3.06 G… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
19
0
2

Year Published

2009
2009
2019
2019

Publication Types

Select...
4
3
2

Relationship

2
7

Authors

Journals

citations
Cited by 36 publications
(21 citation statements)
references
References 21 publications
0
19
0
2
Order By: Relevance
“…All other algorithms are noticeably slower -from 39% (Lossless JPEG) to 82% (PNG). Our aim in this study was to analyse popular "standard" image compression algorithms; however we note, that there exist other methods with compression speeds over 2 times higher than JPEG-LS [2], [13]. The speeds of JPEG2000, PNG and CALIC are similar (CALIC is faster than the remaining two algorithms by 11% respectively 20%).…”
Section: Resultsmentioning
confidence: 99%
“…All other algorithms are noticeably slower -from 39% (Lossless JPEG) to 82% (PNG). Our aim in this study was to analyse popular "standard" image compression algorithms; however we note, that there exist other methods with compression speeds over 2 times higher than JPEG-LS [2], [13]. The speeds of JPEG2000, PNG and CALIC are similar (CALIC is faster than the remaining two algorithms by 11% respectively 20%).…”
Section: Resultsmentioning
confidence: 99%
“…Genellikle entropi kodlayıcısının performansını artırmak için veya üretilen nihai bit uzunluğunu azaltmak için öngörü hata değerlerinin üzerinde ilave bir düzenleme işlemi yapmak önerilmektedir [10]. Bu işlem öngörü hataların modüler aritmetikle yeniden hesaplanması ve bu öngörü hata değerlerinin yeniden düzenlenmesi olarak iki aşamadan oluşmaktadır.…”
Section: I Deneysel Sonuçlarunclassified
“…Ancak modüler aritmetik sonucu oluşan öngörü hata dağılımı Lablacian dağılımına yaklaşmaktadır [10]. Bahse konu dağılım aşağıdaki denklem kullanarak …”
Section: I Deneysel Sonuçlarunclassified
“…Typical grayscale images are of 8 to 16 bit depth [11]. RGB images are consisting of three matrixes of R, G and B each of which has the same depth to grayscale.…”
Section: Transformation (Edt)mentioning
confidence: 99%