Question: 2 2 2 0 2 2 4 5 4 4 4 0 4 4 4 2 3 4 2 3 4 2 2 5 4

2 2 2 0 2 2 4 5 4 4 4 0 4 4 4 2 3 4 2 3 4 2 2 5 4 0 5 4 5 5 4 5 5 3 3 2 3 153 4 6 6 3 6 15 2 6 6 2 2 3 3 3 4 15 5 2 2 5 5 5 05 4 a) (10 pts) This image is corrupted with a noise. Determine the noise that corrupted the image and remove it with an appropriate 3x3 filter with replicate method. For the following, use restored image as input b) (5 pts) Apply histogram equalization. You do not need to apply the result on the image. c) (5 pts) Compute the entropy of the image. d) (10 pts) Construct the Huffman coding. e) (5 pts) Determine the average bit length of the Huffman coded image. f) (5pts) Compute the redundancy for the Huffman coded image? 2 2 2 0 2 2 4 5 4 4 4 0 4 4 4 2 3 4 2 3 4 2 2 5 4 0 5 4 5 5 4 5 5 3 3 2 3 153 4 6 6 3 6 15 2 6 6 2 2 3 3 3 4 15 5 2 2 5 5 5 05 4 a) (10 pts) This image is corrupted with a noise. Determine the noise that corrupted the image and remove it with an appropriate 3x3 filter with replicate method. For the following, use restored image as input b) (5 pts) Apply histogram equalization. You do not need to apply the result on the image. c) (5 pts) Compute the entropy of the image. d) (10 pts) Construct the Huffman coding. e) (5 pts) Determine the average bit length of the Huffman coded image. f) (5pts) Compute the redundancy for the Huffman coded image
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
