This preview shows pages 1–4. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: ECE 253a Digital Image Processing Pamela Cosman 12/10/10 First Name: Last Name: ECE 253a FINAL EXAM This cover sheet is provided to give all students equal time. Do not turn it over until everybody has received a copy of the exam and you are instructed to start. You have 3 hours to work on this exam. Please make sure that your copy of the exam is complete. There are 10 problems and a total of 13 pages (including the cover sheet). The problems are worth different numbers of points between 8 and 10. Problem Possible Score 1 8 2 9 3 8 4 8 5 8 6 8 7 9 8 9 9 10 10 9 Total 86 1 1. Binary Morphological Operators (8 points): In quiz 1, you were given this binary image with the letter E plus noise blobs (of size 2x2 pixels, separated from each other by more than 2 pixels). The E and the noise blobs are all 1valued pixels, depicted as black. Let A denote the image foreground (set of all 1valued pixels in the image). Let B be a 3x3 structuring element. The term inner boundary means a 1pixel wide boundary of the letter E which is part of the E. The term outer boundary means a 1pixel wide boundary which surrounds the E and is not part of the E. How can you get a clean inner boundary (no noise) using some combination of dilation, erosion, and set differencing operations? (The set differencing operation is defined in the textbook on page 81.) How can you get a clean outer boundary (no noise) using some combination of dilation, erosion, and set differencing operations? 2 2. Color (9 points): For each of the following statements about color, write whether the statement is true or false. No explanations needed. (a) If we have a pixel in a 24bit color image with RGB values (10,20,45) and we multiply these values by 2 to get RGB values (20,40,90), we are not changing the hue of the pixel. (b) If we have a pixel in a 24bit color image with RGB values (10,20,45) and we multiply these values by 2 to get RGB values (20,40,90), we are not changing the saturation of the pixel. (c) Two color gamuts (A and B) corresponding to two different sets of phosphors, as shown in the xy chromaticity diagram below, will produce the same number of visually discrim inable colors if the areas of the triangles are the same. 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 x y A B (d) Converting an RGB color image to HSI, performing histogram equalization on the sat uration component, and converting back to RGB, is in general a good way to enhance saturation (although there may be outofrange problems when converting from HSI back to RGB)....
View Full
Document
 Fall '11
 Cosman
 Image processing

Click to edit the document details