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.
PCIF: an algorithm for lossless true color image compression / E. Barcucci; S. Brlek; S. Brocchi. - STAMPA. - 5852:(2009), pp. 224-237. (Intervento presentato al convegno 13th International Workshop on Combinatorial Image Analysis IWCIA'09 tenutosi a Playa del Carmen, Messico nel 24-27 novembre 2009) [10.1007/978-3-642-10210-3_18].
PCIF: an algorithm for lossless true color image compression
BARCUCCI, ELENA;BROCCHI, STEFANO
2009
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.
I documenti in FLORE sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
