EECS 203A: HOMEWORK #1
Due: 7 April 2016. Submit written questions during class and images to class dropbox.
1. Suppose that a continuous ramp image is defined by
c(x, y) = 256x
0x1
0y1
An N N digital image f (X, Y ) is formed by sampling c(x, y) at the s

EECS 203A: HOMEWORK #3
Due: April 21, 2016
1. Consider two images. Image1 is 512512 pixels where the first 256 columns have brightness 0
and the last 256 columns have brightness 200. Image2 is 512 512 pixels with the pattern of a
chess board with an 8 8 p

ECE203A: HOMEWORK #2
Due: April 14, 2016
1. Suppose that we have an input image with the histogram
h(rk ) = 3rk
rk = 0, 1, 2, . . . , 10
We desire a gray level transformation M(rk ) such that the histogram of the transformed image
is as close as possible

EECS 203A: HOMEWORK #4
Due: May 5, 2016
1. Let h(x, y) be the 64 64 filter defined by
h(x, y) = 2 + cos(0.25y)
x = 0, 1, 2, . . . , 63 y = 0, 1, 2, . . . , 63
a) Compute the DFT H(u, v) for u = 0, 1, 2, . . . , 63 v = 0, 1, 2, . . . , 63.
b) If your answe

EECS203A: HOMEWORK #5
Due: May 12, 2016
Problems from the textbook: 5.1, 5.2, 5.3, 5.4, 5.5, 5.6, 5.7, 5.8, 5.9, 5.10
Note that these are the same problems in the second and third editions of the textbook. You
may use a computer for problems 5.1, 5.2, . .