Start Discovering Solved Questions and Your Course Assignments
TextBooks Included
Active Tutors
Asked Questions
Answered Questions
Simulate the performance of this quantizer over the same range of ratio of variances as we have done for the uniform case.
For the 2 and 3 bit quantizers, compute the rate and distortion assuming that the quantizer outputs are entropy coded.
Comment on the final codebook you obtain. Plot the elements of the codebook and discuss why they ended up where they did.
Comment on the differences in the mean squared errors and the quality of the reconstructed images.
Compare the performance of a 16-dimensional pyramid vector quantizer and a 16-dimensional LBG vector quantizer for two different sources.
How does the variance of the prediction error compare with the variance of the {?n} sequence?
For each case compute the variance of the prediction error and the SNR in dB.
DPCM can also be used for encoding images. Encode the Sinan image using a one-tap predictor of the form xˆi.j = a*xi.j-1 .
DPCM-encode the Sinan, Elif, and bookshelf 1 images using a one-tap predictor and a four-level quantizer followed by a Huffman coder.
Compare the rate distortion performances using a one-tap and two-tap predictor.
Encode the sequence using the ppma algorithm and an adaptive arithmetic coder.
Encode using the Burrows-Wheeler transform and move-to-front coding.
A sequence is encoded using the Burrows-Wheeler transform. Given L = elbkkee, and index = 5.
What is the SNR for each of the reconstructions? Do the relative values reflect the difference in the perceptual quality?
If the sequence is random with P(0) = 0.8, compute the rate and distortion for M = 1, 2,4, 8, 16.
Generate a random binary sequence with P(0) = 0.8, and compare your simulation results with the analytical results.
Suppose there was an error in the channel and the first bit was received as a 0 instead of a 1. Decode the received sequence of bits.
For a binary source with probabilities P(0) = 0.9, P(l) = 0.1, design a Huffman code for the source obtained by blocking m bits together.
Encode the following sequence of 16 values using the Rice code with 7 = 8 and one split sample option.
Write a program for encoding images using the Rice algorithm. Use eight options, including the fundamental sequence, five split sample options.
Given a number a in the interval [0, 1) with an n-h ii binary representation.
The binary arithmetic coding approach specified in the JBIG standard can be used for coding gray-scale images via bit plane encoding.
Bit plane encoding is more effective when the pixels are encoded using a Gray code.
We will encode the sequence 1 3 2 1 with parameters shown in Table .
What is the word length required for unambiguous encoding?