SPIHT(Set Partitioning In Hierarchical Trees)

13
SPIHT BY, PRAVEEN.M.K-9913107002 1Yr M.Tech(D.C.N) KLU 1 12/06/2022

Transcript of SPIHT(Set Partitioning In Hierarchical Trees)

Page 1: SPIHT(Set Partitioning In Hierarchical Trees)

18/04/2023

1

SPIHT

BY,

PRAVEEN.M.K-9913107002

1Yr M.Tech(D.C.N)

KLU

Page 2: SPIHT(Set Partitioning In Hierarchical Trees)

18/04/2023

2 What is IMAGE Compression? Reduce the size of data.

Also, Compression is a way to reduce the number of bits in a frame but retaining its meaning.

**(For e.g..,5Mb data is reduced to 1.47Mb.)**

Page 3: SPIHT(Set Partitioning In Hierarchical Trees)

18/04/2023

3 Need for IMAGE compression….??

For large storage requirements.(for e.g.., Encyclopedia).

Relatively used in the medical field to transfer the patients CT-scan image. Etc..,

Page 4: SPIHT(Set Partitioning In Hierarchical Trees)

18/04/2023

4 Types:

Page 5: SPIHT(Set Partitioning In Hierarchical Trees)

18/04/2023

5 SPIHT: SPIHT means Set Partitioning in Hierarchical Trees.

This was proposed by Pearlman in 1996.

It is an image compressing method of DWT and it belongs to lossless compression technique.

wavelet

transform

SPIHT

encoding

original

image

bit

stream

Page 6: SPIHT(Set Partitioning In Hierarchical Trees)

18/04/2023

6

Three-Level Haar function of Wavelet Transformation Structure(compression):

Page 7: SPIHT(Set Partitioning In Hierarchical Trees)

18/04/2023

7Formation of cells:

Page 8: SPIHT(Set Partitioning In Hierarchical Trees)

18/04/2023

8ALGORITHM: O(i,j): set of coordinates of all offspring of node (i,j); children only

D (i,j): set of coordinates of all descendants of node (i,j); children, grandchildren, great-grand, etc.

H (i,j): set of all tree roots (nodes in the highest pyramid level); parents

L (i,j): D (i,j) – O(i,j) (all descendents except the offspring); grandchildren, great-grand, etc.

Page 9: SPIHT(Set Partitioning In Hierarchical Trees)

18/04/2023

9COMPRESSING OF PIXELS:

A DCB A+B C-DA-BC+D

20

17

15

16

30

31

20

22

15

21

18

22

17

19

25

18

35

33

50

53

5

1

10

9

33

43

42

37

-3

-1

-8

1

original image

Compressed image

Page 10: SPIHT(Set Partitioning In Hierarchical Trees)

18/04/2023

10 COMPRESSED IMAGE:

Page 11: SPIHT(Set Partitioning In Hierarchical Trees)

18/04/2023

11DECOMPRESSED IMAGE:

Page 12: SPIHT(Set Partitioning In Hierarchical Trees)

18/04/2023

12 Properties of SPIHT:

Good image quality with a high PSNR Fast coding and decoding A fully progressive bit-stream Can be used for lossless compression May be combined with error protection Ability to code for exact bit rate or PSNR

Page 13: SPIHT(Set Partitioning In Hierarchical Trees)

18/04/2023

13