Parallel lossless image compression using Huffman and arithmetic coding

P.G. Howard; Jeffrey Scott Vitter

doi:10.1016/0020-0190(96)00090-7

ScienceGate Book Chapters

JOURNAL ARTICLE

Parallel lossless image compression using Huffman and arithmetic coding

P.G. Howard Jeffrey Scott Vitter

Year: 1996 Journal: Information Processing Letters Vol: 59 (2)Pages: 65-73 Publisher: Elsevier BV

DOI: 10.1016/0020-0190(96)00090-7

Get Full-Text PDF Get Analytical Report

Keywords:

Huffman coding Arithmetic coding Lossless compression Tunstall coding Arithmetic Data compression Image compression Computer science Context-adaptive binary arithmetic coding Variable-length code Entropy encoding Shannon–Fano coding Lossless JPEG Golomb coding Canonical Huffman code Algorithm Mathematics Image processing Artificial intelligence Image (mathematics) Decoding methods Code rate

Metrics

Cited By

0.00

FWCI (Field Weighted Citation Impact)

Refs

0.12

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Algorithms and Data Compression

Physical Sciences → Computer Science → Artificial Intelligence

Advanced Data Compression Techniques

Physical Sciences → Computer Science → Computer Vision and Pattern Recognition

Video Coding and Compression Technologies

Physical Sciences → Computer Science → Signal Processing

Parallel lossless image compression using Huffman and arithmetic coding

Metrics

Citation History

Topics

Related Documents

Parallel lossless image compression using Huffman and arithmetic coding

Analysis of Stereoscopic Image Compression Using Arithmetic Coding and Huffman Coding

Pixel pyramid for lossless image compression using Arithmetic Coding

New methods for lossless image compression using arithmetic coding

New methods for lossless image compression using arithmetic coding