Scribd
Upload
61 views3 pages

Exam2 (2006 Spring)

This document provides instructions for Exam #2 in the course EE5356 Digital Image Processing. It outlines: 1) The exam will take place on 4/4/06 from 12:30-1:50 pm. It will be closed book and notes. 2) The 5 problems are equally weighted and students should show all steps in their work. Problems can be done in any order. 3) Students should print their name and last 4 digits of their ID on the exam.

Uploaded by

gunnersregister
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
61 views3 pages

Exam2 (2006 Spring)

This document provides instructions for Exam #2 in the course EE5356 Digital Image Processing. It outlines: 1) The exam will take place on 4/4/06 from 12:30-1:50 pm. It will be closed book and notes. 2) The 5 problems are equally weighted and students should show all steps in their work. Problems can be done in any order. 3) Students should print their name and last 4 digits of their ID on the exam.

Uploaded by

gunnersregister
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

EE5356 Digital Image Processing

Exam #2
4/4/06 Tuesday
12:30 pm1:50 pm

1) Closed books and closed notes.


2) All problems carry equal weights
3) Please show all the steps in your work
4) You can work problems in any order. At the end please
rearrange as 1,2,3,4,5.
5) Please print your name and last four digits of your ID.

Problem 1
Prove that the formula for extracting the nth bit of a pixel is
k n = in 2 in 1
where
u
in int B n , int[ x ] integer part of x
2
B 1
B 2
u = k1 2 + k 2 2 + K + k B 1 2 + k B , k i = 0 or 1, i = 1,2, K , B
B is the number of quantization bits for each pixel

Problem 2
An image has the gray level PDF p r (r ) shown in the following figure. It is desired to
transform the gray level of this image so that they will have the specified p z (z ) shown.
Assume continuous quantities and find the transformation ( in terms of r and z ) that will
accomplish this.

p z (z )

p r (r )
2

z
1

Problem 3
An 8 level image has the gray-level distribution shown in the table below, rk indicated a
gray level in the image.
k
0
1
2
3
4
5
6
7

rk
0
1/7
2/7
3/7
4/7
5/7
6/7
1

nk
327
901
573
574
410
204
942
165

a) Draw the histogram of the original image.


b) Draw the histogram based on histogram equalization. Show all steps.

Problem 4
One way to perform linear interpolation is first interlacing zeros along rows and columns
in the original data and then convolving with interpolating window. For the following
data U, and the interpolation window, H, show the result of linear interpolation. Show all
steps.

1 2 1
2 10
1
U=
, H = 2 4 2

4
8 4
1 2 1
Problem 5

Show that if an image {u (m, n), 0 m, n N 1} is multiplied by the checkerboard


pattern ( 1) m+ n , then its unitary 2D-DFT is centered at (N/2,N/2). If the unitary 2D-DFT
of u(m,n) has its region of support crosshatched regions A,B,C,D as shown in Fig.1, what
would be the region of support of the unitary 2D-DFT of (1) m+ n u (m, n) ? Sketch this,
justify your answer analytically.
Fig.1 shows the magnitude of the unitary 2D-DFTs of an image u(m,n). This method can
be used for computing unitary 2D-DFT whose origin is at the center of the image matrix.
The frequency increases as one moves away from the origin.
k
l

N-1

N/2

N/2
C

N-1
N/2

Fig. 1

You might also like