HELP! * GREY=local LOCAL HTML version of Foils prepared July 6,1995

Foil 5 Huffman and Other Compression Techniques

From CPS600 Compression Presentation CPS600 Spring 1995 -- March 1995. by Roman Markowski and Geoffrey Fox * See also color IMAGE

Huffman encoding; Shannon-Fano encoding; arithmetic encoding
  • input is sliced into fixed units while the corresponding output comes in chunks of variable size
RLE -Run Length Encoding (TIFF, BMP)
  • lossless: Replace upto 127 identical characters by two bytes -- first byte is number of identical characters in string, second byte is character itself
  • For example: AAAAbbbbbccct ---> 4A5b3c1t
LZW - Lepel-Ziv-Welch (TIFF, GIF)
  • Directory based encoding algorithm
  • compress, zoo, lha, pkzip. arj
  • LZ77, LZ78
  • input is divided into units of variable length (words) and coded in a fixed-length output code
  • shorter bit patterns for most common characters
DCT - Discrete Cosine Transform (MPEG, JPEG, H.261)
  • lossy; converts the spatial image representation into a frequency map
  • DCT scheme is effective only for compressing continuous-tone images (from "Graphics File Formats", O'Reilly and Associates Inc., page 162 in description of JPEG algorithm)



Northeast Parallel Architectures Center, Syracuse University, npac@npac.syr.edu

If you have any comments about this server, send e-mail to webmaster@npac.syr.edu.

Page produced by wwwfoil on Tue Feb 18 1997