1 / 18

SPIHT

SPIHT. SPIHT. O(i,j) 為點 (i,j) 的兒子集合 D(i,j) 為點 (i,j) 的子嗣集合 L(i,j)=D(i,j) - O(i,j) H: 所有空間指向樹的樹根 ( 最低子頻帶 ). 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. Initialization.

mare
Download Presentation

SPIHT

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. SPIHT

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

  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. Initialization

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

  6. Sorting Pass output: : 111000

  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 Sn(D(i,j)); if Sn(D(i,j)) = 1 then for each do: output Sn(k,l) ; if Sn(k,l) = 1 then add (k,l) to the LSP and output the sign of (k,l) ; if Sn(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. Sorting Pass output: : 111000 111000 10000 0

  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 Sn(L(i,j)); if Sn(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. Sorting Pass output: : 111000 111000 10000 0 0

  11. Sorting Pass output: : 111000 111000 10000 0 0 0 101100 0 0

  12. Image Quality

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

  14. Father PSNR=28.1872 Q=0.977938

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

  16. Father Combine Intra

  17. Father Combine Intra

More Related