Assignment for Module Two

Here you will implement a complete Canny algorithm for edge detection. This will be achieved by

putting together the parts that have been discussed in the lectures.

Start by getting your Part One code all together. You need to follow the slides and the video that

explains the code $($starts around $10$:$30$ in video$2$ for Part One, of Module $2$: Canny Edge Detector Part

One$).$ This involves changing the marrh.c code and blending it with the sobel.c code. You will know

that you are done with this Part One when you get output similar to what was produced as Sobel$$s

magnitude image. You must test your code on the chess picture stored in garb$34.$pgm available at