Abstract | ||
---|---|---|
An efficient algorithm for compressing true color images is proposed. The technique uses a combination of simple and computationally cheap operations. The three main steps consist of predictive image filtering, decomposition of data, and data compression through the use of run length encoding, Huffman coding and grouping the values into polyominoes. The result is a practical scheme that achieves good compression while providing fast decompression. The approach has performance comparable to, and often better than, competing standards such JPEG 2000 and JPEG-LS. |
Year | DOI | Venue |
---|---|---|
2009 | 10.1007/978-3-642-10210-3_18 | IWCIA |
Keywords | DocType | Volume |
good compression,computationally cheap operation,main step,practical scheme,Huffman coding,data compression,run length encoding,predictive image,efficient algorithm,Lossless True Color Image,fast decompression | Conference | 5852 |
ISSN | Citations | PageRank |
0302-9743 | 2 | 0.40 |
References | Authors | |
6 | 3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Elena Barcucci | 1 | 306 | 59.66 |
Srecko Brlek | 2 | 151 | 26.29 |
Stefano Brocchi | 3 | 12 | 1.96 |