1. 1 SPIHT

2. 2 O(i,j) 為點 (i,j) 的兒子集合 D(i,j) 為點 (i,j) 的子嗣集合 L(i,j)=D(i,j) - O(i,j) H: 所有空間指向樹的樹根 ( 最低子頻帶 )

3. 3 Initialization Output set the LSP as an empty list add the coordinates to the LIP those with descendants also to the LIS,as type A entries

4. 4 Initialization Threshold = 32 LIPLISLSP 63-34(A) -34-31(A) -3123(A) 23

5. 5 Sorting Pass 2.1 for each entry (i,j) in the LIP do: 2.1.1 output S n (i,j); 2.1.2 if S n (i,j) = 1 then move (i,j) to the LSP and output the sign of (i,j) ;

6. 6 Sorting Pass Threshold = 32 LIPLISLSP -31-34(A)63 23-31(A)-34 23(A) output: : 111000

7. 7 Sorting Pass 2.2 for each entry (i,j) in the LIS do: 2.2.1 if the entry is of type A then output S n (D(i,j)); if S n (D(i,j)) = 1 then for each do: output S n (k,l) ; if S n (k,l) = 1 then add (k,l) to the LSP and output the sign of (k,l) ; if S n (k,l) = 0 then add (k,l) to the end of the LIP ; O(i,j)={ (2i, 2j ), (2i, 2j+1), (2i+1, 2j ), (2i+1, 2j+1) }

8. 8 Sorting Pass Threshold = 32 LIPLISLSP -31-34(A)63 23-31(A)-34 1023(A)49 14 -13 15 14 -9 -7 output: : 111000 111000 10000 0

9. 9 Sorting Pass If then move (i,j) to the end of the LIS as an entry of type B, and go to step2.2.2; Otherwise, remove entry (i,j) from the LIS ; 2.2.2 if the entry is of type B then output S n (L(i,j)); if S n (L(i,j)) = 1 then add each to the end of the LIS as an entry of type A ; remove (i,j) from the LIS

10. 10 Sorting Pass Threshold = 32 LIPLISLSP -31-34(B)63 23-31(B)-34 1049 14 -13 15 14 -9 -7 output: : 111000 111000 10000 0 0

11. 11 Sorting Pass Threshold = 32 LIPLISLSP -31-315(A)63 23214(A)-34 10-9(A)49 14-7(A)47 -13 15 14 -9 -7 output: : 111000 111000 10000 0 0 0 101100 0 0

12. 12

13. 13 Image Quality

14. 14 Image Quality 表示 x y 的線性相關程度，當 y=ax+b 得到最大值 1 表示 x y 的平均亮度，當 x=y 得到最大值 1 表示 x y 的對比相似度，當 得到最大值 1

15. 15 Father PSNR=28.1872 Q=0.977938

16. 16 Combine PSNR=27.9566 Q=0.976747Intra PSNR=28.1552 Q=0.97779

17. 17 Father IntraCombine

18. 18 Father IntraCombine