Image Compression: (a) Run-Length Encoding (b) Lossless-Huffman Coding (c) Sine and Cosine Transform-Based (d) JPEG

Pre Test

1. Compressed image can be recovered back by

a) image enhancement
b) image decompression
c) image contrast
d) image equalization

2. Every run length pair introduce new

a) pixels
b) matrix
c) frames
d) intensity

3. If the pixels are reconstructed without error mapping is said to be

a) reversible
b) irreversible
c) temporal
d) facsimile

4. Replication of the pixels is called

a) coding redundancy
b) spatial redundancy
c) temporal redundancy
d) both b and c

5. Transforming the difference between adjacent pixels is called

a) mapping
b) image compression
c) image watermarking
d) image equalization