

Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
An assignment on implementing the canny edge detector, including filtering, nonmaximum suppression, and hysteresis thresholding and linking. It also provides instructions on how to apply the edge detector to test images with varying parameters.
Typology: Assignments
1 / 3
This page cannot be seen from the preview
Don't miss anything!


Due: May 1
d dx [f (x) ∗ g(x)] = df (x) dx ∗ g(x)
and that
d dx [f (x) ∗ g(x)] = f (x) ∗ dg(x) dx where ∗ denotes convolution.
Your goal is to implement the Canny edge detector as described in the text (Trucco and Veri) including the three main steps of filtering, nonmaximum suppression, and hysteresis thresholding and linking. You will apply your edge detector to a set of images found on the web page. You should be able
to specify three parameters: σ (the filter standard deviation), τl (the low threshold), τh (the high threshold). Some specific notes:
Hand in:
(a) The component of the gradient with respect to x. (b) The component of the gradient with respect to y. (c) The magnitude of the gradient (edge strength). (d) The result of nonmaximum supression.