Digital Video
Download
1 / 11

Digital Video Solutions to Midterm Exam 2004 Edited by Yu-Kuang Tu - PowerPoint PPT Presentation


  • 94 Views
  • Uploaded on

Digital Video Solutions to Midterm Exam 2004 Edited by Yu-Kuang Tu Confirmed by Prof. Jar-Ferr Yang LAB: 92923 R, TEL: ext. 621 E-mail: [email protected] Page of MPL: http://mediawww.ee.ncku.edu.tw. 2.1. 81 horizontal lines per frame, 2:1 interlace scanning format,

loader
I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.
capcha
Download Presentation

PowerPoint Slideshow about ' Digital Video Solutions to Midterm Exam 2004 Edited by Yu-Kuang Tu' - gwylan


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.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.


- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript

Digital Video

Solutions to Midterm Exam 2004

Edited by Yu-Kuang Tu

Confirmed by Prof. Jar-Ferr Yang

LAB: 92923 R, TEL: ext. 621

E-mail: [email protected]

Page of MPL: http://mediawww.ee.ncku.edu.tw


2.1.

81 horizontal lines per frame, 2:1 interlace scanning format,

aspect ratio of 4:3, 20 frames per second.

81個

(a)

(b)

(c)

(d)

Horizontal

……

vertical


vertical

vertical

Incorrect time

2.2.

(a)

(b)

(c)

(d)

(e)

(f)

水平掃描電壓波幅不足

In Fig. g,H bias ckt has problem

normal

abnormal

垂直掃描電壓波幅不足

In Fig. g,V bias ckt has problem

Clock不同步

In Fig. g,V bias ckt has problem

Color decoder有問題

In Fig. h, the video amp (lower one) or 2~4.2M BPF has problem

Video Amplifier (AGC) 有問題

In Fig. h, the video amp (upper one) has problem with improper DC offset.

Blanking level 不正常

In Fig. h, the video amp (upper one) has problem


2.3.

(a)

(b)

(c)

Two-event (two examples)

Huffman code:

A1A1 0 or 1

A1A0 11 or 00

A0A1 100 or 011

A0A0 101 or 010

1

A1A1 0.766

1

A1A0 0.11

0

1

0.2356

A0A1 0.11

0

0.1256

A0A0 0.0156

0

0.0

0.125

1.0

A0

A1

0.33<W<0.414

W=3/8011

0.125

0.234

1.0

A0

A1

0.234

0.33

1.0

A0

A1

0.33

0.414

1.0

A0

A1


2.3.

(d)

0.0

0.125

1.0

A0

A1

0.125

0.234

1.0

W=0.375

A1A1A1

A0

A1

0.234

0.33

1.0

A0

A1


y[2n]

↑2

G0(z)

H0(z)

↓2

x[n]

x[n]

y[2n+1]

↑2

G1(z)

H1(z)

↓2

2.4.


2.4.

-2 1 0 1 2

h0

h1

h0

h1

h0

g0

g0

g0

g0

g0

g1

g1

g1

g1

g1

The last row is the reconstructed synthesis data


42

48

0

23

0

10

0

12

-26

0

0

12

3

0

10

0

0

19

-12

0

0

7

0

-4

14

0

14

0

0

0

0

0

2.7.

Initialization:

LIP: { (0,0)42, (0,1)23, (1,0)-26, (1,1)12 }

LIS: { (0,1)D, (1,0)D, (1,1)D }

LSP: {}

Significant Pass: 10,0,0,0 0,0,0

LIP: { (0,0)42, (0,1)23, (1,0)-26, (1,1)12 }

LIS: { (0,1)D, (1,0)D, (1,1)D }

LSP: { (0,0)42 }

Refinement Pass:

LIP

LIS


*

40

23

24

0

10

12

0

-26

-24

12

0

0

3

0

10

19

24

-12

0

0

7

-4

0

0

14

0

14

0

0

0

0

2.7.

LIS

LIP

Significant Pass: 10,11,0 0,1;10.0.0.0,0

LIP: { (0,1)23,(1,0)-26, (1,1)12, (2,1)-12,

(3,0)14, (3,1)14 }

LIS: { (0,1)D, (1,0)D, (1,1)D }

LSP: { (0,0)26, (0,1)23,(1,0)-26,(2,0)19 }

Refinement Pass: 0


*

40

*

24

0

10

0

12

*

-24

12

12

0

3

10

0

24

*

-12

(-)12

7

0

-4

0

0

14

0

14

0

0

0

0

SPIHT

25bits

Significant Pass: 10,11,10….

LIP: {(1,1)12, (2,1)-12, (3,0)14, (3,1)14 }

LIS: { (0,1)D, (1,1)D }

LSP: { (0,0)26, (0,1)23, (1,0)-26, (2,0)19 }

Refinement Pass: …


3.1.

3.2.

3.3.

3.4.

3.5.

F,…remove temporal redundancy…, …interframe coding…

F, …spatial-domain data…., …a spatial redundance removal…

F, RLC is a data compression technique.

F, However, there still exist some ways depending on data property to find an alternative scanning order to improve the coding efficiency actually

F,With the same rate,the hierarchical mode needs more computation and obtains less compression ratio.


ad