April 2, 2001 - Lab 4

1. Threshold the following image and make it into a binary image.

Using the built-in dilation operator of ImageJ, remove the central hole. How many iterations will be needed if the operator is a 3x3 matrix of 1s? What happens to the size and shape of the square?

How would you preserve the original size of the square? Does the sequence of operations matter?

2. How would you remove the noise from the images below?

3. Use binary operations to detect the edges of the picture of the square given above in part 1.

4. How would you threshold the image of the T-shaped wedge given below? Note that it is not a thumbnail picture.

5. Remove the smaller disks from the following image with minimal change to the large disks.

Last modified on April 10, 2001