Lecture Notes - Introduction to Lossy Image Compression Flashcards

(9 cards)

1
Q

What is lossy image compression?

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

What’s entropy?

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

What’s entropy rate?

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Give the different combinations for the 4 subbands of a Haar transform and name the subbands

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Explain the concept of Multi-Level Haar. What’s the implication of the Multi-Level Haar are you increase the levels?

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

After quantising the Haar transform, the huffman code can be used. Is it efficient or inefficient at reducing the entropy?

A
  1. Inefficient
  2. After quantising the Haar transform, the symbol ‘0’ is very frequent, with a probability much bigger than 0.5

e.g consider a black image. Huffman code will see it as each pixel bin with 1 bit and makes it harder to decode.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

In practical encoding, which coding scheme or rather combination gives near ideal entropy coding.

A
  1. Pre-process the quantised transform by RLC
  2. Then use Huffman.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

Why use the Haar transform?

A

The HT can be used to decrease the energy of the signal (or overall entropy) and thus achieve much better compression.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q
A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly