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

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 Difference pixel by pixel (16x16 block-size) Sum of absolute differences

4. 2.2 (a) Spatial & SNR Scalability (b) Q 1 >Q 2 >Q 3 (c) Upper part (d) S 1,S 2,S 3,S 4,S 5,S 6,S 7,S 8 (e) SNR Scalability Spatial Scalability Encoder

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

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 (a) Reordered Block Data: 0, 0, -2, 0, 2, 0, -1, 0, -1, 0… TotalCoeffs = 4 (indexed from highest frequency [3] to lowest frequency [0]) TotalZeros = 5 TrailingOne = 2

9. 2.5 (b) (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. Reordered Block Data: 0, 0, -2, 0, 2, 0, -1, 0, -1, 0…

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

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

12. Table – coeff_token mapping to TotalCoeff( coeff_token ) and TrailingOnes( coeff_token ) TrailingOnes ( coeff_token ) TotalCoeff ( coeff_token ) 0 <= nC < 22 <= nC < 44 <= nC < 88 <= nCnC = = -1 0011111110000 1101 010001 010010 110011 110000 000001 11 11011011100000 011 020000 01110001 110010 110001 00 12 0011 10111 10001 010001 10 2200101111010001 10001 030000 0011 10000 1110010 00 0000 11 130000 01100010 100110 00010 010000 011 230000 1010010 010111 00010 100000 010 330001 1010111000010 110001 01 040000 0001 110000 01110001 1110011 000000 10 140000 0011 00001 100101 00011 010000 0011 240000 01010001 010101 10011 100000 0010 340000 11010010110011 110000 000 050000 0000 1110000 01000001 0110100 00- 150000 0001 100000 1100100 00100 01- 250000 0010 10000 1010100 10100 10- 350000 1000011 010100100 11- 060000 0000 0111 10000 0011 10001 0010101 00- 160000 0000 1100000 01100011 100101 01- 260000 0001 010000 01010011 010101 10- 360000 01000010 0010010101 11-

13. Table – total_zeros tables for 4x4 blocks with TotalCoeff( coeff_token ) 1 to 7 total_zerosTotalCoeff( coeff_token ) 1234567 0111101010001 101010000 01 1011110111 01000000 1 201010111001010011111101 300111001010100111110100 400100110100110 101011 50001 101010011101 10011 60001 00100100 011010 70000 11001101100110110100001 80000 100010 01100100001001 90000 0110001 1 00100000 10010000 00 100000 0100001 0 00010000 00 110000 00110000 110000 010000 10000 0 120000 00100000 100000 10000 0 130000 0001 10000 010000 00 140000 0001 00000 00 150000 0000 1 Table – Tables for run_before run_beforezerosLeft 123456>6 01111 111 100110 000110 2-0001 011001101 3--00001010011100 4---000001010011 5----000101010 6-----100001 7------0001 8-----00001 9------000001 10------0000001 11------00000001 12------000000001 13------0000000001 14------00000000001

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