Suppose we have a small 8-bit grayscale image, with all pixels equal to the same pixel value, say 113. Consider the performance of an LZW compression scheme. First initialize codes in the dictionary with pixel values, $0 . .255$. Use 9-bit codes.
For a $4 \times 4$ uniform image made of pixel values which are all 113, how many bits will LZW (i.e., PKZIP, WINZIP, etc.) use for a compressed version of the image? Explain in detail, using an LZW table. What is the compression ratio?
Hint: recall that the LZW coding algorithm is

Answer:

Question

Suppose we have a small 8-bit grayscale image, with all pixels equal to the same pixel value, say 113. Consider the performance of an LZW compression scheme. First initialize codes in the dictionary with pixel values, $0 . .255$. Use 9-bit codes.
For a $4 \times 4$ uniform image made of pixel values which are all 113, how many bits will LZW (i.e., PKZIP, WINZIP, etc.) use for a compressed version of the image? Explain in detail, using an LZW table. What is the compression ratio?
Hint: recall that the LZW coding algorithm is
  
Answer:

Quizplus · Accepted Answer

The Answer of Suppose we have a small 8-bit grayscale image, with all pixels equal to the same pixel value, say 113. Consider the performance of an LZW compression scheme. First initialize codes in the dictionary with pixel values, $0 . .255$. Use 9-bit codes.
For a $4 \times 4$ uniform image made of pixel values which are all 113, how many bits will LZW (i.e., PKZIP, WINZIP, etc.) use for a compressed version of the image? Explain in detail, using an LZW table. What is the compression ratio?
Hint: recall that the LZW coding algorithm is
  
Answer:

Suppose We Have a Small 8-Bit Grayscale Image, with All 0..2550 . .2550..255

Suppose We Have a Small 8-Bit Grayscale Image, with All $0 . .255$