Академический Документы
Профессиональный Документы
Культура Документы
CS 775 ResM
Research Methodology Formulation of Research Problem
Descriptive Statistics; Probability & Probability Distribution;
Random Variables;
Sampling Distribution;
Rajeev Kumar
Hypothesis Testing;
SC&SS, JNU Error Analysis & Accuracy;
cse.iitkgp.ac.in/~rkumar Regression Analysis; Multivariate Analysis.
99%
95%
n
12 34 0 54 0 0 0 0
87 0 0 12 0 0 0 0 Variable Length Codes
16 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 Optimal Codes
0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 Uniqely Decoded
0 0 0 0 0 0 0 0
Pre-fix free codes Binary tree property
0 0 0 0 0 0 0 0
Non-deterministic
After zig-zag scanning the sequence of DCT coefficients to be transmitted looks like:
12 34 87 16 0 0 54 0 0 0 0 0 0 12 0 0 3 0 0 0 ..... Used for those sources which are transformed to yield
The DC coefficient (12) is sent via a separate Huffman table.
Pre-defined probability density function
After Run-Level parsing, the remaining coefficients and associated runs of zeros are:
34 | 87 | 16 | 0 0 54 | 0 0 0 0 0 0 12 | 0 0 3 | 0 0 0 ..... Statistics is wonderful if used appropriately
in absence of such Statistical Properties in Source
Universal Codecs
Design an Algorithm
AAAAAAAAAAAAAAAA
Given: A Data Source
Process: Repeated Patterns : A Dictionary Approach ABABABABABABABABABAAB
Output: Codes (lossless) ABCABCABCABCABCABCABCABCABC
ABCABCABCABCABCABCABCABCABC
Universal coding schemes, like LZW, do not require When encoding begins the code table contains only the first
advance knowledge and can build such knowledge on-the- 256 entries, with the remainder of the table being blanks.
fly.
Compression is achieved by using codes 256 through 4095
to represent sequences of bytes.
LZW is the foremost technique for general purpose data
compression due to its simplicity and versatility.
As the encoding continues, LZW identifies repeated
sequences in the data, and adds them to the code table.
It is the basis of many PC utilities that claim to double the
capacity of your hard drive Decoding is achieved by taking each code from the
compressed file, and translating it through the code table
LZW compression uses a code table, with 4096 as a to find what character or characters it represents.
common choice for the number of table entries.
LZW Encoding Algorithm Example 1: Compression using LZW
1 Initialize table with single character strings Example 1: Use the LZW algorithm to compress the string
2 P = first input character
3 WHILE not end of input stream
BABAABAAA
4 C = next input character
5 IF P + C is in the string table
6 P=P+C
7 ELSE
8 output the code for P
9 add P + C to the string table
10 P=C
11 END WHILE
Since the codewords are 12 bits, any single encoded Simply forget about adding any more entries and use the table as
character will expand the data size rather than reduce it. is.
In this example, 72 bits are represented with 72 bits of Throw the dictionary away when it reaches a certain size.
data. After a reasonable string table is built, compression
improves dramatically. Throw the dictionary away when it is no longer effective at
compression.
Advantages of LZW over Huffman: Clear entries 256-4095 and start building the dictionary again.
LZW requires no prior information about the input data stream.
LZW can compress the input stream in one single pass. Some clever schemes rebuild a string table from the last N
Another advantage of LZW its simplicity, allowing fast execution. input characters.