It uses frequency to encode each run length of the same coloured pixel
3 of 6
What are the two ways of lossless text compression?
Dictionary compression and Huffman trees
4 of 6
How does dictionary compression work?
It uses repeated patterns in the original text and encodes each pattern in a dictionary
5 of 6
How do Huffman trees work?
It analyses the frequency with which characters in a body of text are used. Characters are then placed in a binary tree structure where the most frequently occurring characters are placed nearest the top of the tree
6 of 6
Other cards in this set
Card 2
Front
What does RLE stand for?
Back
Run Length Encoding
Card 3
Front
How does RLE work?
Back
Card 4
Front
What are the two ways of lossless text compression?
Comments
No comments have yet been made