CS 5814, Assignment 1 -
Due 5pm September 13, 2007
Please show all your work!
Gonzalez and Woods Problem 2.11, pp. 101
Gonzalez and Woods Problem 2.15, p. 101
Show the steps in the Rosenfeld algorithm for determining the D-border of
the following 8-component of 1's Give a chain encoding of the resulting border.
Consider the handwriting sample Sample 1 in the class image set.
For this problem, use as input the 8-bit binary image, olddoc1.img.
The .img filetype is not a standard type. Many imaging programs such as
photoshop recognize .raw however. In this case simply change the type
from .img to .raw and enter the image dimensions when requested.
Create from olddoc1.img a new image newdoc1.img of the same dimensions whose
pixels are 0 but 1 wherever the olddoc1 pixels have a value less than or equal
to 120.
Write a connected components program using the Haralick B algorithm
that labels all the 8-components of 1 pixels. Make note of the number of
components and the size of the largest component.
Assign the smallest component the new label 254, the next largest component
the new label 253, and so forth until either all components are relabeled or
the label 1 is used. Relabel all the remaining components with a 1.
Then create a new 8-bit binary label image named label.raw in which the pixels
in the components are replaced by their labels and all background pixels are set
to 255. Such an image is called a symbolic image because the pixels
represent image attributes rather than visual information. Now see if you can eliminate
all the small black dots in the image by thresholding the label image.
Submit label.raw to Seung In as an Email attachment, and in your written homework,
indicate the number of components you found and the size of the largest component.