cs682-canny-edges - Image Features Edges Formal Design of...

Info iconThis preview shows pages 1–6. Sign up to view the full content.

View Full Document Right Arrow Icon
1 Image Features Edges 2/11/2004 Octavia I. Camps 2 Formal Design of an Optimal Edge Detector • Edge detection involves 3 steps: – Noise smoothing – Edge enhancement – Edge localization • J. Canny formalized these steps to design an optimal edge detector
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
2 2/11/2004 Octavia I. Camps 3 Canny Edge Detector • Experiments consistently show that it performs very well • Probably, the most used by C.V. practitioners 2/11/2004 Octavia I. Camps 4 Canny Edge Detector • Uses a mathematical model of the edge and the noise • Formalizes a performance criteria • Synthesizes the best filter
Background image of page 2
3 2/11/2004 Octavia I. Camps 5 Edge Model (1D) • An ideal edge can be modeled as an step A < = 0 if 0 if 0 ) ( x A x x G 2/11/2004 Octavia I. Camps 6 Performance Criteria (1) • Good detection – The filter must have a stronger response at the edge location (x=0) than to noise
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
4 2/11/2004 Octavia I. Camps 7 Performance Criteria (2) • Good Localization – The filter response must be maximum very close to x=0 X=0 X=0 2/11/2004 Octavia I. Camps 8 Performance Criteria (3) • Low False Positives – There should be only one maximum in a reasonable neighborhood of x=0 large
Background image of page 4
5 2/11/2004 Octavia I. Camps 9 Canny Edge Detector • Canny found a linear, continuous filter that maximized the three given criteria. • There is no close-form solution for the optimal filter. • However, it looks VERY SIMILAR to the derivative of a Gaussian. 2/11/2004 Octavia I. Camps 10 Algorithm CANNY_ENHANCER The input is image I; G is a zero mean Gaussian filter (std = σ ) 1. J = I * G (smoothing) 2. For each pixel (i,j): (edge enhancement) Compute the image gradient » J(i,j) = (J x (i,j),J y (i,j))’
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 6
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 11/06/2010 for the course CSE 527 taught by Professor Ab during the Fall '09 term at Cornell University (Engineering School).

Page1 / 16

cs682-canny-edges - Image Features Edges Formal Design of...

This preview shows document pages 1 - 6. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online