Assignment
1. Write the Hough edge linking with a brief example.
2. Suppose an image is given in which user is interested to find the pixels that lie inside the
boundary? Devise boundary extraction algorithm and find the boundary pixels.
3. Compute the magnitude and gradient of the shaded pixel. Apply Prewitt operator.
4. Which operator detects diagonal edges better than Prewitt operator? Also write operator
masks.
5. An image of size 5 x 4 and structuring element of size 1 x 2 are given below. Apply erosion,
dilation operation to find the result.
6. There is an image which consists of regions after segmentation. The regions are having
gaps which are to be filled. Apply region filling algorithm to fill region’s gap.
7. Compute the row wise Fourier transform of the following image, i.e. compute F(0, v), F(1,
v), F(2, v) and F(3, v).
8. Consider the following 9x9 image consisting of a darker object in a lighter background.
Generate the histogram of the image in tabular and graphical form. Suggest a gray value
threshold to demarcate the object from background pixels.
9. Suppose two discrete 1 dimensional functions are represented by the sequences f=[5 7 11
8 2 6 8 9 7 4 3], h=[1 2 1]. Compute opening and closing.
10. Proof dilation and erosion are duals of each other with respect to set complementation and
reflection.
11. Consider the problem of detecting edges in the following 5×5 image. First pad the boundary
by duplicating the pixels at the boundary and then apply the Prewitt operators to the image
to obtain the horizontal and vertical gradient maps.
12. When do you say that a shape is convex. What do you mean by convex hull. Give basic
3×3 structuring element used to find convex hull.
13. Given the set of five points, use Hough transform to join these points (1,4), (2,3), (3,1),
(4,1), (5,0). mmin=-1and mmax=2, interval=0.1.
14. Apply erosion, dilation, hit-or-miss transform.
