1 / 16

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

Digital Video Solutions to Final Exam 2004 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). FS: (2*16+1)(2*16+1) = 1089 points

celina
Download Presentation

Digital Video Solutions to Final Exam 2004 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 2004 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) FS: (2*16+1)(2*16+1) = 1089 points TSS: 9+8+8+8= 33 points DS: Best 9+4 = 13 points; Worst??? Each search points: requires 64 + 63 additions Sum of absolute differences Difference pixel by pixel (8x8 block-size)

  3. 2-2. Decoder De -Mux JPEG Decoder 4x4↑ Stream 1 X’’ 2x2↑ EZW Decoder Stream 2 2x2↑ X’ DPCM Decoder Stream 3 X

  4. 2-2. Encoder Mux 2x2↓ 2x2↓ JPEG Encoder Stream 1 Input Image 2x2↑ JPEG Decoder + - EZW Encoder Stream 2 2x2↑ EZW Decoder + - + + DPCM Encoder Stream 3

  5. 2-4. 0 1 2 3 4 5 6 7 8 9 10 11 12 13… I B B B P B B P B B B I B B… Order of transmitted frame numbers 0 4 1 2 3 7 5 6 11 8 9 10… 12 13… I P B B B P B B I B B B… B B…

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

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

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

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

  10. 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)

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

  12. 0 0 1 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 1 0 0 0 0 1 0 0 1 0 0 0 0 0 0 0 0 1 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 zc zc zc zc sc zc zc zc zc zc sc zc zc zc zc zc zc zc zc sc zc zc : Pass 1 (done) : Magnitude refinement pass (Pass 2)

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

  14. 0 0 1 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 1 0 0 0 0 1 0 0 1 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 2-8. (b) zc zc sc zc zc zc zc sc zc zc zc zc sc *: Cannot be obtained since there’s no sign plane given. 正負號可自行假設

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

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

More Related