Harris corner detector - PowerPoint PPT Presentation

1 / 30
About This Presentation
Title:

Harris corner detector

Description:

Harris corner detector Digital Visual Effects, Spring 2005 Yung-Yu Chuang 2005/3/16 with s by Trevor Darrell Cordelia Schmid, David Lowe, Darya Frolova, Denis ... – PowerPoint PPT presentation

Number of Views:63
Avg rating:3.0/5.0
Slides: 31
Provided by: cyutEduT8
Category:

less

Transcript and Presenter's Notes

Title: Harris corner detector


1
Harris corner detector
  • Digital Visual Effects, Spring 2005
  • Yung-Yu Chuang
  • 2005/3/16

with slides by Trevor Darrell Cordelia Schmid,
David Lowe, Darya Frolova, Denis Simakov, Robert
Collins and Jiwon Kim
2
Moravec corner detector (1980)
  • We should easily recognize the point by looking
    through a small window
  • Shifting a window in any direction should give a
    large change in intensity

3
Moravec corner detector
flat
4
Moravec corner detector
flat
5
Moravec corner detector
flat
edge
6
Moravec corner detector
corner isolated point
flat
edge
7
Moravec corner detector
  • Change of intensity for the shift u,v

Four shifts (u,v) (1,0), (1,1), (0,1), (-1,
1) Look for local maxima in minE
8
Problems of Moravec detector
  • Noisy response due to a binary window function
  • Only a set of shifts at every 45 degree is
    considered
  • Responds too strong for edges because only
    minimum of E is taken into account
  • Harris corner detector (1988) solves these
    problems.

9
Harris corner detector
  • Noisy response due to a binary window function
  • Use a Gaussian function

10
Harris corner detector
  • Only a set of shifts at every 45 degree is
    considered
  • Consider all small shifts by Taylors expansion

11
Harris corner detector
Equivalently, for small shifts u,v we have a
bilinear approximation
, where M is a 2?2 matrix computed from image
derivatives
12
Harris corner detector
  • Responds too strong for edges because only
    minimum of E is taken into account
  • A new corner measurement

13
Harris corner detector
Intensity change in shifting window eigenvalue
analysis
?1, ?2 eigenvalues of M
direction of the fastest change
Ellipse E(u,v) const
direction of the slowest change
(?max)-1/2
(?min)-1/2
14
Harris corner detector
Classification of image points using eigenvalues
of M
?2
edge ?2 gtgt ?1
Corner ?1 and ?2 are large, ?1 ?2E increases
in all directions
?1 and ?2 are smallE is almost constant in all
directions
edge ?1 gtgt ?2
flat
?1
15
Harris corner detector
Measure of corner response
(k empirical constant, k 0.04-0.06)
16
Another view
17
Another view
18
Another view
19
Summary of Harris detector
20
Harris corner detector (input)
21
Corner response R
22
Threshold on R
23
Local maximum of R
24
Harris corner detector
25
Harris Detector Summary
  • Average intensity change in direction u,v can
    be expressed as a bilinear form
  • Describe a point in terms of eigenvalues of
    Mmeasure of corner response
  • A good (corner) point should have a large
    intensity change in all directions, i.e. R should
    be large positive

26
Harris Detector Some Properties
  • Partial invariance to affine intensity change
  • Only derivatives are used gt invariance to
    intensity shift I ? I b
  • Intensity scale I ? a I

27
Harris Detector Some Properties
  • Rotation invariance

Ellipse rotates but its shape (i.e. eigenvalues)
remains the same
Corner response R is invariant to image rotation
28
Harris Detector is rotation invariant
Repeatability rate
correspondences possible correspondences
29
Harris Detector Some Properties
  • But non-invariant to image scale!

All points will be classified as edges
Corner !
30
Harris Detector Some Properties
  • Quality of Harris detector for different scale
    changes

Repeatability rate
correspondences possible correspondences
Write a Comment
User Comments (0)
About PowerShow.com