HW1, EECS 203A

Fall 2004. UCI

by Nasser Abbasi




Problem 2.10 statment
Figure

Problem 2.10 solution




First calculate the number of pixels in each frame.

MATH

Since this is interlaced, then one frame is made up of two fields each is MATHpixels, and each is $\frac{1}{60}$ seconds long. (2 fields make up one frame)

Hence number of pixels in $\frac{1}{30}$seconds MATH pixels

Hence number of pixels in one second (using 30 fps) MATHpixels

Then using 24 bits per pixel, we get MATH bits/second.

$\allowbreak $Then 2 hrs will require MATH MATH bits or

MATH

MATH bits
MATH bytes Note_1




HW1, Problem 2.19

ECS 203A.

Nasser Abbasi

Problem:

Show that an operator that computes median of a subinage area S is nonlinear.

Solution:

An operator $\digamma $ is linear if

MATH

To show that median is nonlinear operator, only need to provide one example of such case.

Conside image $S_{1}$ given by $\{2,4,1\}$ and $S_{2}$ given by $\{6,5,9\}$

Let $\alpha =1\,\ $and $\beta =1$ (since definition is valid for any scalars $\alpha ,\beta $)

Apply the median operator on $S_{1}$and $S_{2}$

MATH

MATH

So

MATH

Now add the two images togother (addition is by element to element) we get

MATH

So

MATH

Compare (1) and (2) above we see they not equal.

Hence the operator $\digamma $ (median) is not linear.