Parallel lossless image compression using Huffman and arithmetic coding

We show that high-resolution images can be encoded and decoded efficiently in parallel. We present an algorithm based on the hierarchical MLP method, used either with Huffman coding or with a new variant of arithmetic coding called quasi-arithmetic coding. The coding step can be parallelized, even t...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Information processing letters Ročník 59; číslo 2; s. 65 - 73
Hlavní autori:	Howard, Paul G., Vitter, Jeffrey Scott
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Amsterdam Elsevier B.V 22.07.1996 Elsevier Science Elsevier Sequoia S.A
Predmet:	Algorithmics. Computability. Computer arithmetics Algorithms Applied sciences Arithmetic coding Artificial intelligence Computer science; control theory; systems Data compression Exact sciences and technology Huffman coding Information processing Parallel algorithms Parallel processing Pattern recognition. Digital image processing. Computational geometry Studies Theoretical computing Arithmetic coding Huffman coding Parallel algorithms Data compression High resolution Image processing Coding Huffman code Prediction Arithmetic code
ISSN:	0020-0190, 1872-6119
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!