Filters and Edges - PowerPoint PPT Presentation

About This Presentation
Title:

Filters and Edges

Description:

Edge(x) = a U(x) n(x) U(x) x=0. Convolve image with U and find points with high magnitude. Choose value by comparing with a threshold determined by the noise model. ... – PowerPoint PPT presentation

Number of Views:32
Avg rating:3.0/5.0
Slides: 37
Provided by: paulsc1
Category:

less

Transcript and Presenter's Notes

Title: Filters and Edges


1
Filters and Edges
2
(No Transcript)
3
(No Transcript)
4
Zebra convolved with Leopard
5
(No Transcript)
6
(No Transcript)
7
(No Transcript)
8
(No Transcript)
9
(No Transcript)
10
(No Transcript)
11
(No Transcript)
12
(No Transcript)
13
(No Transcript)
14
(No Transcript)
15
(No Transcript)
16
(No Transcript)
17
(No Transcript)
18
(No Transcript)
19
(No Transcript)
20
(No Transcript)
21
(No Transcript)
22
(No Transcript)
23
(No Transcript)
24
(No Transcript)
25
Edge Detection as a signal detection problem
Goal find meaningful intensity boundaries.
26
Simplest Model (Canny) Edge(x) a U(x) n(x)

?
U(x)
x0
Convolve image with U and find points with high
magnitude. Choose value by comparing with a
threshold determined by the noise model.
27
Probability of a filter response on an edge
Probability of a filter response off an edge
28
Fundamental limits on edge detection
29
Need to take into account base edge rate.
30
Smoothing and Differentiation
  • Issue noise
  • smooth before differentiation
  • two convolutions to smooth, then differentiate?
  • actually, no - we can use a derivative of
    Gaussian filter
  • because differentiation is convolution, and
    convolution is associative

31
There are three major issues 1) The gradient
magnitude at different scales is different which
should we choose? 2) The gradient
magnitude is large along thick trail how
do we identify the significant points? 3) How
do we link the relevant points up into curves?
32
1 pixel
3 pixels
7 pixels
The scale of the smoothing filter affects
derivative estimates, and also the semantics of
the edges recovered.
33
Computing Edges via the gradient
34
We wish to mark points along the curve where the
magnitude is biggest. We can do this by looking
for a maximum along a slice normal to the
curve (non-maximum suppression). These points
should form a curve. There are then two
algorithmic issues at which point is the
maximum, and where is the next one?
35
Non-maximum suppression
At q, we have a maximum if the value is larger
than those at both p and at r. Interpolate to get
these values.
36
Predicting the next edge point
Assume the marked point is an edge point. Then
we construct the tangent to the edge curve (which
is normal to the gradient at that point) and use
this to predict the next points (here either r or
s).
Write a Comment
User Comments (0)
About PowerShow.com