edge detection
play

Edge Detection Ref: Forsyth+Ponce Ch. 7,8 Trucco+Verri Ch. 4 Our - PowerPoint PPT Presentation

Edge Detection Ref: Forsyth+Ponce Ch. 7,8 Trucco+Verri Ch. 4 Our goal is to extract a line drawing representation from an image Useful for recognition: edges contain shape information invariance Edge detection Derivatives


  1. Edge Detection Ref: Forsyth+Ponce Ch. 7,8 Trucco+Verri Ch. 4

  2. • Our goal is to extract a “line drawing” representation from an image • Useful for recognition: edges contain shape information – invariance

  3. Edge detection

  4. Derivatives • Edges are locations with high image gradient or derivative* • Estimate derivative using finite difference • Problem?

  5. Smoothing • Reduce image noise by smoothing with a Gaussian

  6. Convolution is Associative • We compute derivative of smoothed image: • Since convolution is associative:

  7. Separable Convolution • Note that G can be factored as and computed as two 1-D convolutions

  8. Edge orientation • Would like gradients in all directions • Approximate: – Compute smoothed derivatives in x,y directions – Edge strength – Edge normal

  9. Canny Edge Detection • Compute edge strength and orientation at all pixels • “Non-max suppression” – Reduce thick edge strength responses around true edges • Link and threshold using “hysteresis” – Simple method of “contour completion”

  10. Non-maximum suppression: Select the single maximum point across the width of an edge. Slides by D. Lowe

  11. Non-maximum suppression At q, the value must be larger than values interpolated at p or r.

  12. Examples: Non-Maximum Suppression courtesy of G. Loy Non-maxima Original image Gradient magnitude suppressed Slide credit: Christopher Rasmussen

  13. fine scale high threshold

  14. coarse scale, high threshold

  15. coarse scale low threshold

  16. Linking to the next edge point Assume the marked point is an edge point. Take the normal to the gradient at that point and use this to predict continuation points (either r or s).

  17. Edge Hysteresis • Hysteresis : A lag or momentum factor • Idea: Maintain two thresholds k high and k low – Use k high to find strong edges to start edge chain – Use k low to find weak edges which continue edge chain • Typical ratio of thresholds is roughly k high / k low = 2

  18. Example: Canny Edge Detection gap is gone Strong + Original connected image weak edges Strong Weak edges edges only courtesy of G. Loy

  19. Problem? • Texture – Canny edge detection responds all over textured regions

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend


More recommend