1 / 21

Digital Video Solutions to Final Exam 2005 Edited by Yu-Kuang Tu Confirmed by Prof. Jar-Ferr Yang

Digital Video Solutions to Final Exam 2005 Edited by Yu-Kuang Tu Confirmed by Prof. Jar-Ferr Yang LAB: 92923 R, TEL: ext. 621 E-mail: specta@video5.ee.ncku.edu.tw Page of MPL: http://mediawww.ee.ncku.edu.tw. 2-1. (a) (b) (c) (d). FS: (2*32+1)(2*32+1) = 4225 points

hetal
Télécharger la présentation

Digital Video Solutions to Final Exam 2005 Edited by Yu-Kuang Tu Confirmed by Prof. Jar-Ferr Yang

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 2005 Edited by Yu-Kuang Tu Confirmed by Prof. Jar-Ferr Yang LAB: 92923 R, TEL: ext. 621 E-mail: specta@video5.ee.ncku.edu.tw Page of MPL: http://mediawww.ee.ncku.edu.tw

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

  3. 2-2. Decoder Frame Mean De Mux + VLC Decoder RLC Decoder Inverse DCT + AC difference + AC1~63 + z-1 DC terms + DC + z-1 Intra/Inter frame mode + Decoded Video + Frame Buffer MV difference Motion Vector (MV) + + Motion Vector Prediction

  4. 2-2. Encoder M U X Inter/Intra Frame Mode Video Input Intra - Inter AC terms AC difference + RLC VLC DCT - - Frame Mean DC AC DC terms DC - IDCT z-1 + + MC + + Motion Vector Prediction MV Frame Buffer MV diff - MV ME Frame Mean

  5. 2-8. Four Types of Coding Primitives • Significance Coding (Normal Mode) [zero coding] • Use to code new significance. • 9 contexts according to the significance of its neighbors. • Significance Coding (Run Mode) [run length coding] • Group 4 insignificant coefficients when they are very probable. • Reduce the average number of symbols needed to be coded. • One context for whether all four are insignificant.

  6. 2-8. Four Types of Coding Primitives • Magnitude Refinement Coding • 3 contexts depending on the significance of its neighbors and whether it is the first time for refinement. • Sign Coding • Used to code the sign right after a coefficient is identified significant. • 5 contexts based on the sign of four neighbors.

  7. 2-8. Significance Coding (Normal Mode) Current sample Formation of significance coding context

  8. 2-8. Coding Passes • 3 coding passes for each bit-plane, p • Significance Propagation Pass • Sample location j belongs to this pass if it is insignificant, but has a significant neighborhood • Magnitude Refinement Pass • For any sample which was already significant in the previous bit-plane • Cleanup Pass • Including all samples for which information has not already been coded in bit-plane p

  9. 2-8. Primitive of Each Coding Pass • Significant Propagation Passes • Significance coding (normal mode) + Sign coding primitive • Magnitude Refinement Pass • Magnitude refinement primitive • Cleanup Pass • Significance coding (normal mode) + Sign coding primitive + Significance coding (run mode)

  10. 0 0 1 0 0 0 0 0 0 1 1 0 1 1 0 0 1 0 1 1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 1 1 0 1 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 2-8. Significance Propagation Pass (Pass 1) ZC: Zero Coding Significance coding (normal mode) SC: Sign Coding zc zc sc zc zc zc zc sc zc zc sc zc sc zc zc zc zc zc zc zc sc zc zc zc zc zc zc sc zc zc sc zc zc zc sc zc sc zc zc zc zc zc : Coefficient which is already significant : Significance Propagation Pass (Pass 1)

  11. 0 0 1 0 0 0 0 0 0 1 1 0 1 1 0 0 1 0 1 1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 1 1 0 1 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 2-8. Magnitude Refinement Pass (Pass 2) MR: Magnitude Refinement Coding zc zc sc zc zc zc zc sc zc zc sc MR zc sc zc zc zc zc MR zc MR zc MR zc sc zc zc zc zc zc zc sc zc zc sc zc zc zc sc MR zc sc zc zc MR zc zc zc : Pass 1 (done) : Magnitude refinement pass (Pass 2)

  12. 0 0 1 0 0 0 0 0 0 1 1 0 1 1 0 0 1 0 1 1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 1 1 0 1 0 0 0 0 0 1 0 0 R LC 0 0 0 0 0 0 0 0 2-8. Clean-up Pass (Pass 3) zc zc zc sc zc zc zc zc zc zc zc sc zc zc sc zc MR zc sc zc zc sc zc zc zc MR zc MR zc zc zc MR zc zc sc zc zc zc zc zc zc zc zc sc zc zc sc zc zc zc zc sc zc zc MR zc zc zc sc zc zc MR zc zc zc zc zc zc zc zc : Pass 1 : Pass 3 (Normal Mode) : Pass 2 : Pass 3(Run Mode)

  13. 0 0 1 0 0 0 0 0 0 1 1 0 1 1 0 0 1 0 1 1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 1 1 0 1 0 0 0 0 0 1 0 0 R LC 0 0 0 0 0 0 0 0 0 0 0 0 1 1 1 0 0 2-8. zc zc zc sc zc zc zc zc zc (b) zc zc sc zc zc sc zc MR zc sc zc zc sc zc zc zc MR zc MR zc zc zc MR zc zc sc zc zc zc zc zc zc zc zc sc zc zc sc zc zc zc zc sc zc zc MR zc zc zc sc zc zc MR zc zc zc zc zc zc zc zc Zero coding, LL band kh[j] = 0, kv[j] = 0, kd[j] = 1, ksig[j] = 1 Sign coding ch[j] = 0, cv[j] = 0, ksign = 10 zc zc zc sc

  14. 0 0 1 0 0 0 0 0 0 1 1 0 1 1 0 0 1 0 1 1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 1 1 0 1 0 0 0 0 0 1 0 0 R LC 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 2-8. zc zc zc sc zc zc zc zc zc (b) zc zc sc zc zc sc zc MR zc sc zc zc sc zc zc zc MR zc MR zc zc zc MR zc zc sc zc zc zc zc zc zc zc zc sc zc zc sc zc zc zc zc sc zc zc MR zc zc zc sc zc zc MR zc zc zc zc zc zc zc zc zc zc Zero coding, LL band kh[j] = 0, kv[j] = 0, kd[j] = 0, ksig[j] = 0 zc

  15. 0 0 1 0 0 0 0 0 0 1 1 0 1 1 0 0 1 0 1 1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 1 1 0 1 0 0 0 0 0 1 0 0 R LC 0 0 0 0 0 0 0 0 0 1 1 1 1 0 0 1 0 2-8. zc zc zc sc zc zc zc zc zc (b) zc zc sc zc zc sc zc MR zc sc zc zc sc zc zc zc MR zc MR zc zc zc MR zc zc sc zc zc zc zc zc zc zc zc sc zc zc sc zc zc zc zc sc zc zc MR zc zc zc sc zc zc MR zc zc zc zc zc zc zc zc Magnitude refinement coding, LL band kh[j] = 1, kv[j] = 2, kd[j] = 2, ksig[j] = 7 kmag[j] = 16 or 17 (we don’t know s [j]) zc zc sc zc sc zc zc MR zc sc zc

  16. 0 0 1 0 0 0 0 0 0 1 1 0 1 1 0 0 1 0 1 1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 1 1 0 1 0 0 0 0 0 1 0 0 R LC 0 0 0 0 0 0 0 0 0 1 0 1 1 0 0 1 1 2-8. zc zc zc sc zc zc zc zc zc (b) zc zc sc zc zc sc zc MR zc sc zc zc sc zc zc zc MR zc MR zc zc zc MR zc zc sc zc zc zc zc zc zc zc zc sc zc zc sc zc zc zc zc sc zc zc MR zc zc zc sc zc zc MR zc zc zc zc zc zc zc zc Magnitude refinement coding, LL band kh[j] = 1, kv[j] = 2, kd[j] = 1, ksig[j] = 7 kmag[j] = 16 or 17 (we don’t know s [j]) zc zc zc sc zc sc MR zc zc

  17. 2-8. (b) Assignment of context labels for significant coding “x” means “don’t care.”

  18. 2-8. (b) Assignment of context labels and flipping factor for sign coding Current sample ch[j] , cv[j]: neighborhood sign status -1: one or both negative. 0: both insignificant or both significant but opposite sign. 1: one or both positive.

  19. 2-8. (b) Assignment of context labels and flipping factor for magnitude refinement coding s [j]: remains zero until after the first magnitude refinement bit has been coded. For subsequent refinement bits, s [j] = 1. ksig[j]: context label for significant coding of sample j

  20. III. 3.1(c) 3.2(b) 3.3(d) 3.4(d) 3.5(c) 3.6(b)

  21. IV. 4.1 (F): the encoder is with ME and MC; the decoder is with MC to reduce the temporal redundancy. 4.2 (F): If the number of bands is equivalent to the number of transform length, the DCT and Subband coding are equivalent. 4.3 (F): RLC, which uses data consecution property, is a kind of data compaction. 4.4 (F): Even if you use the same standard, difference encoders could encoded difference coded data. 4.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