DIGITAL IMAGE COMPRESSION BY HUFFMAN CODE
The storage and transmission of digital images are required in many applications like optical surveillance, remote sensing or experiment automation. In some applications no information on pixel levels has to be lost during compression and decompression, even if the compression factor will be limited by this condition. One of these compression methods is the Huffman code with the basic idea that all quantization levels in an image occur equally often. Huffman code is a variable length code in which shorter codes are assigned to the most frequently occurring levels. The resulting compression depends on the type of input image. The code implementation requires first the histogram computation of quantization levels over the whole image, second the code elaboration for each pixel value and third the generation of the compressed image file with the associated code file. The decompression reconstructs the original image from the compressed image and the associated code. Different correlation cases (normal, linear and cross- difference) have been investigated. Good results are obtained using the linear difference version of Huffman code.
Bibliographic Reference: EUR 11475 EN, 1988, MF, 26 PP., ECU 4, BLOW-UP COPY, ECU 5, AVAILABILITY: EUROFFICE, LUXEMBOURG, POB 1003
Availability: Can be ordered online
Record Number: 1989126114600 / Last updated on: 1989-06-01
Available languages: en