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

edge detection
SMART_READER_LITE
LIVE PREVIEW

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


slide-1
SLIDE 1

Edge Detection

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

slide-2
SLIDE 2
  • Our goal is to extract

a “line drawing” representation from an image

  • Useful for recognition:

edges contain shape information

– invariance

slide-3
SLIDE 3

Edge detection

slide-4
SLIDE 4

Derivatives

  • Edges are locations with high image

gradient or derivative*

  • Estimate derivative using finite

difference

  • Problem?
slide-5
SLIDE 5

Smoothing

  • Reduce image noise by smoothing with

a Gaussian

slide-6
SLIDE 6

Convolution is Associative

  • We compute derivative of smoothed

image:

  • Since convolution is associative:
slide-7
SLIDE 7

Separable Convolution

  • Note that G can be factored as

and computed as two 1-D convolutions

slide-8
SLIDE 8

Edge orientation

  • Would like gradients in all directions
  • Approximate:

– Compute smoothed derivatives in x,y directions – Edge strength – Edge normal

slide-9
SLIDE 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”

slide-10
SLIDE 10

Non-maximum suppression: Select the single maximum point across the width

  • f an edge.

Slides by D. Lowe

slide-11
SLIDE 11

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

slide-12
SLIDE 12

Examples: Non-Maximum Suppression

courtesy of G. Loy

Original image Gradient magnitude Non-maxima suppressed

Slide credit: Christopher Rasmussen

slide-13
SLIDE 13
slide-14
SLIDE 14

fine scale high threshold

slide-15
SLIDE 15

coarse scale, high threshold

slide-16
SLIDE 16

coarse scale low threshold

slide-17
SLIDE 17

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).

slide-18
SLIDE 18

Edge Hysteresis

  • Hysteresis: A lag or momentum factor
  • Idea: Maintain two thresholds khigh and klow

– Use khigh to find strong edges to start edge chain – Use klow to find weak edges which continue edge chain

  • Typical ratio of thresholds is roughly

khigh / klow = 2

slide-19
SLIDE 19

Example: Canny Edge Detection

courtesy of G. Loy

gap is gone

Original image Strong edges

  • nly

Strong + connected weak edges Weak edges

slide-20
SLIDE 20

Problem?

  • Texture

– Canny edge detection responds all over textured regions