![]() |
|
Huffman EncodingHuffman Encoding is a method of compression which (for bitmaps) works by counting the number of occurrences of each pixel color.Each color is then represented by a code, those colors which occur more frequently are represented by shorter codes, and those which occur less frequently are represented by longer codes. As shorter codes generally predominate, the amount of storage required to hold the bitmap is thus reduced. How much compression can be achieved by Huffman Encoding varies depending on the exact algorithm used, and depending on the content of an image. A reduction to about one eighth of the original size is typical for many images. The main disadvantage of Huffman Encoding is that it can be relatively slow to compress images into this format, and to decompress them back. An additional disadvantage of Huffman Encoding is it is very sensitive to data-loss through (for example) transmission errors. If even a single bit of data is dropped or added during transmission (for example, over the Internet), the rest of the image will display incorrectly.
Related Books:
|
||||||||||||||||||||||||||||||||||||
| Privacy Terms Of Use Copyright © 2005-2008, Answers 2000 Limited With any business, it is up to the individual owner of said business to ensure the success of the business. You may make more or less than any sample figures or results that might be quoted on our web sites or other publications. All business involves risk, and many businesses do not succeed. Further, Answers 2000 Limited does NOT represent that any particular individual or business is typical, or that any results or experiences achieved by any particular individual/business is necessarily typical. In Association With Amazon.com All trademarks are property of their respective owners. All third party content and adverts are copyright of their respective owners. Some graphics on our web sites are Copyright (C) 1997-2000 Hemera Technologies Inc., and used under license. All such pictures are provided for viewing purposes only and are not to be saved or downloaded. All such pictures of recognizable individuals are models and used for illustrative purposes only, and not meant to imply any association or endorsement of said individual with any product or service. |