1 / 15

Digital Video Solutions to Final Exam 2008 Edited by Hung-Ming Wang Shih-Ming Huang

Digital Video Solutions to Final Exam 2008 Edited by Hung-Ming Wang Shih-Ming Huang Confirmed by Prof. Jar-Ferr Yang LAB: 92923 R, TEL: ext. 621 E-mail: ming@video5.ee.ncku.edu.tw Page of MediaCore: http://mediawww.ee.ncku.edu.tw. References. Lecture Materials 考古題 ( 以前 ~ 現在 ).

shakti
Download Presentation

Digital Video Solutions to Final Exam 2008 Edited by Hung-Ming Wang Shih-Ming Huang

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. Digital Video Solutions to Final Exam 2008 Edited by Hung-Ming Wang Shih-Ming Huang Confirmed by Prof. Jar-Ferr Yang LAB: 92923 R, TEL: ext. 621 E-mail: ming@video5.ee.ncku.edu.tw Page of MediaCore: http://mediawww.ee.ncku.edu.tw

  2. References Lecture Materials 考古題 (以前~現在) Video coding using the H.264/MPEG-4 AVC compression standard link Atul Puri, , a, Xuemin Chen, b and Ajay Luthra, c Signal Processing: Image Communication Volume 19, Issue 9, October 2004, Pages 793-849

  3. 2.1 (a) (b) (c) (d) Cross Search: Best 5+8 = 13 points ; Worst??? TSS: 9+8+8+8= 33 points HS: Best 7+4 = 11 points; Worst??? Novel TSS: Best 9+8=17 points; Worst: 9+8+8+8+8=41 Each search points: requires 256 + 255 additions Sum of absolute differences Difference pixel by pixel (16x16 block-size)

  4. 2.2 (a) Spatial & SNR Scalability (b) Q1>Q2>Q3 (c) Upper part (d) S1 ,S2 ,S3 ,S4 ,S5 ,S6 ,S7 ,S8 (e) Spatial Scalability SNR Scalability SNR Scalability Encoder

  5. 2.2 (e) Decoder Entropy Decoding + DeMultiplex Inverse IDCT Inter/Intra Prediction Q1-1 Q2-1 Q3-1 Embedded Bitstream Interpolation Filter Inverse IDCT Inter/Intra Prediction Q1-1 Video Out Q2-1 Q3-1

  6. 2.3. Please give 4 major functional differences between (a) H.261 and H.263; (b) H.263 and H.264. • http://www.eetimes.com/news/latest/showArticle.jhtml?articleID=184417335&pgno=1

  7. 2.4. Please describe the major functionality and draw a graphics to explain the relationship among MPEG-1, MPEG-2, MPEG-4, MPEG-7, and MPEG-21

  8. 2.5 Reordered Block Data: 0, 0, -2, 0, 2, 0, -1, 0, -1, 0… (a) TotalCoeffs = 4 (indexed from highest frequency [3] to lowest frequency [0]) TotalZeros = 5 TrailingOne = 2

  9. Reordered Block Data: 0, 0, -2, 0, 2, 0, -1, 0, -1, 0… (b) 2.5 (1) nA=2, nB=4, nC = (nA + nB + 1)>>1=3 Coeff_token: 000101 ( TrailingOne = 2, TotalCoeffs = 4, nC = 3 ) (2) T1 sign codes : 11 (--) (3) Level codes : 1011 Level [1]: +1 (use Level_VLC0) 1 Level [0]: -2 (use Level_VLC1) 011 (4) TotalZeros code : 101 ( TotalZeros = 5, TotalCoeffs = 4 ) (5) Run_before codes : 101010 Run_before[3]: ZerosLeft=5; run_before=1 10 Run_before[2]: ZerosLeft=4; run_before=1 10 Run_before[1]: ZerosLeft=3; run_before=1 10 Run_before[0]: ZerosLeft=2; run_before=2 No code required; last coefficient Note: Level (1), with a value of +2, is encoded as +1. If there are less than 3 T1s, then the first non-T1 level will not have a value of +/-1 (otherwise it would have been encoded as a T1). To save bits, this level is decremented if positive and incremented if negative.

  10. (c) 2.5 nA=2, nB=3, nC = (nA + nB + 1)>>1= 3 Bitstream: 0100010100010011010001011 Code Element Value Output array coeff_token TotalCoeffs=4, T1s=3 Empty 0100 T1 sign 1 + 0 T1 sign -1, 1 - 1 T1 sign 1, -1, 1 + 0 1 Level (VLC_0) 1, 1, -1, 1 1 00010 TotalZeros 1, 1, -1, 1 10 011 run_before 4 1, 1, -1, 0, 0, 0, 0, 1 run_before 4 1, 1, 0, 0, 0, 0 , -1, 0, 0, 0, 0, 1 010 run_before 2 00 1, 0, 0, 1, 0, 0, 0, 0 , -1, 0, 0, 0, 0, 1 The last four bits are redundant !!!

  11. (c) 2.5 Decoded data: 1, 0, 0, 1, 0, 0, 0, 0 , -1, 0, 0, 0, 0, 1… Output matrix

  12. Table – coeff_token mapping to TotalCoeff( coeff_token ) and TrailingOnes( coeff_token )

  13. Table – total_zeros tables for 4x4 blocks with TotalCoeff( coeff_token ) 1 to 7 Table – Tables for run_before

  14. III. 3.1 (F): the encoder is with ME and MC; the decoder is with MC to reduce the temporal redundancy. 3.2 (F): If the number of bands is equivalent to the number of transform length, the DCT and Subband coding are equivalent. 3.3 (F): RLC, which uses data consecution property, is a kind of data compaction. 3.4 (F): Even if you use the same standard, difference encoders could encoded difference coded data. 3.5 (F): For the decoder, the same coded data will obtain the same decoded video data. However, if considering post-processing of the decoded video, we may choose the better or more expensive one.

More Related