IEG4160: Mid Exam

20 Oct 2003

1. (15 points) Compute the linear convolution of h(m,n) and u(m,n). The underlined pixels are at the
origin, m increases from left to right, and n increases from bottom to top.
h(m,n) u(m,n)
3 -1 2 0
1 2 1 3

2. (25 points) The image f(x,y) = 4 cos4πx cos6πy is sampled with ∆x = ∆y = 0.2. The
reconstruction filter is an ideal low-pass filter H with bandwidth (1/(2∆x), 1/(2∆y)), i.e.
1
 if − 2.5 ≤ ξ1 , ξ 2 ≤ 2.5
H (ξ1 , ξ 2 ) =  25
 0 otherwise
What is the reconstructed image?

3. (30 points) Consider the probability density function p(u) of an input u below. There are three
decision levels {-1, 0, 1} and two reconstruction levels {r0, r1}.
p(u) 1

-1 r0= -1/2 0 r1=1/2 1 u

a) (10 points) Initially, r0= -1/2 and r1=1/2. Compute the mean square quantization error, i.e.
E[(u-Q(u))2].
b) (10 points) For the fixed decision levels {-1, 0, 1}, optimize the reconstruction levels r0 and r1
to minimize the mean square quantization error.
c) (10 points) Suppose that the reconstruction levels are updated to the optimum values in b).
Then, what is the corresponding mean square quantization error? Compare the result with a).

4. (15 points) We are given four pixel values at coordinates (0,0), (0,1), (1,0), and (1,1). They are
f(0,0) = 20, f(1,0) = 50,
f(0,1) = 0, f(1,1) = 15.
Obtain the pixel values at coordinates (1/3, 1/3), (1/3, 2/3), (2/3, 1/3), and (2/3, 2/3) by using the
bilinear interpolation method.

5. a) (5 points) Find 1-D DFT of (1, 5, 2, 3)T.

b) (10 points) Find 2-D DFT of the 2ä2 image below.
1 5
 2 3
 