Three Popular Subband Structures

7 Zerotree Coding

C.-Y. Su scy@ntnu.edu.tw Department of Applied Electronics Technology National Taiwan Normal University
Video & Image Processing Lab.

C.-Y. Su

VIP

C.-Y. Su

Subband Decomposition
first-level decomposition

Embedded Zerotree Coder

Introduced by Shapiro. Using wavelet transform not DCT. Wavelet coefficients in different subbands represent the same spatial location in the image. Scalar quantization with coefficient structure If a coefficient has a magnitude greater than T, it is called a significant coefficient at level T. If a coefficient has a magnitude less than T, and all its descendants have magnitudes less than T, then the coefficient is called a zerotree root. If a coefficient has a magnitude less than T but some of its descendants have a value greater than T, then the coefficient is called an isolated zero.
C.-Y. Su 4

Video & Image Processing Lab.

VIP

C.-Y. Su

Video & Image Processing Lab.

VIP

Ten-band Wavelet Decomposition

Scanning
log 2 cmax T0 2

1 Ti Ti 1 2
For a given value of Ti, we assign one of four possible labels to the coefficients: significant positive (sp) significant negative (sn) zerotree root (zr) isolated zero (iz)

Video & Image Processing Lab.

VIP

C.-Y. Su

Video & Image Processing Lab.

VIP

C.-Y. Su

Three-level Midtread Quantizer

1.5T

Example
log 2 26 T0 2 16

Dominant pass

-T

26, send sp, LS={26} 6, send zr reconstructed by T0+T0/2 -7, send zr 7, send zr 26-24=2, send 1,

-1.5T

Subordinate pass

reconstructed by 24+(T0/4)=28
C.-Y. Su 8

Video & Image Processing Lab.

VIP

C.-Y. Su

Video & Image Processing Lab.

VIP

Example

Set Partitioning in Hierarchical Trees

1 T1 T0 8 2 Dominant pass

Subordinate pass

6, send iz -7, send zr 7, send zr 13, send sp LS={26, 13} 10, send sp LS={26, 13, 10} 6, send iz (or zr) 4, send iz (or zr)

26-28=-2, send 0,

28-T1/4=26 12+T1/4=14 12-T1/4=10

Proposed by Amir Said and William Pearlman Using a partition of the trees to keep insignificant coefficients together in larger subsets

13-12=1, send 1,

10-12=-2, send 0,

Video & Image Processing Lab.

VIP

C.-Y. Su

Video & Image Processing Lab.

VIP

C.-Y. Su

11

Example
1 T2 T1 4 2 Dominant pass

Data Structure used in SPIHT

no offsprings

6, send sp -7, send sn 7, send sp 6, send sp; 4, send sp 4, send sp; -4, send sn 2, send iz; -2, send iz 4, send sp; -3, send iz -2, send iz; 0, send iz
LS={26, 13, 10, 6, -7, 7, 6, 4, 4, -4, 4}
C.-Y. Su 10 Video & Image Processing Lab.

Subordinate pass

Video & Image Processing Lab.

VIP

VIP

C.-Y. Su

12

Four Types of Sets

Example

O(i, j) This is the set of coordinates of the offsprings of the wavelet coefficient at location (i, j). D(i, j) This is the set of all descendants of the coefficient at location (i, j). Descendants include the offsprings, the offsprings of the offsprings, and so on. H This is the set of all root nodes. L(i, j) = D(i, j)-O(i, j) The algorithm makes use of three lists:

Second pass: n=3 corresponds to T=8

output bits: 0 0 0 output bits: 1 10 10 0 0 0 0 output bits: 1

LIP: the list of insignificant pixels LSP: the list of significant pixels LIS: the list of insignificant sets

Video & Image Processing Lab.

VIP

C.-Y. Su

13

Video & Image Processing Lab.

VIP

C.-Y. Su

15

Example
n log 2 cmax

Example

Third pass: n=2 corresponds to T=4

output bits: 10 11 10 10 10 output bits: 1 10 11 0 0 1 10 0 0 0 output bits: 0 1 0

output bits: 10 0 0 0 0 0 0
Video & Image Processing Lab.

VIP

C.-Y. Su

14

Video & Image Processing Lab.

VIP

C.-Y. Su

16

Decoding
Initial values First pass

Decoding

Third pass: n=2 and T=4

receive n=4, then set T=16 receive 10 0 0 0 0 0 0 and reconstruct

receive 10 11 10 10 10 receive 1 10 11 0 0 receive 1 10 0 0 0 receive 0 1 0

website: http://ipl.rpi.edu/SPIHT
Video & Image Processing Lab.

VIP

C.-Y. Su

17

Video & Image Processing Lab.

VIP

C.-Y. Su

19

Decoding

Second pass: n=3 and T=8

receive 000 1101000 0 0 1

Video & Image Processing Lab.

VIP

C.-Y. Su

18