harris method

25
Harris corner detector

Upload: sheenum

Post on 27-Jun-2015

6.629 views

Category:

Business


0 download

DESCRIPTION

EXTRACT FEATURE POINTS FROM THE FACE.

TRANSCRIPT

Page 1: Harris Method

Harris corner detector

Page 2: Harris Method

Moravec corner detector (1980)• We should easily recognize the point by lookin

g through a small window• Shifting a window in any direction should give

a large change in intensity

Page 3: Harris Method

Moravec corner detector

flat

Page 4: Harris Method

Moravec corner detector

flat

Page 5: Harris Method

Moravec corner detector

flat edge

Page 6: Harris Method

Moravec corner detector

flat edgecorner

isolated point

Page 7: Harris Method

Moravec corner detectorChange of intensity for the shift [u,v]:

2

,

( , ) ( , ) ( , ) ( , )x y

E u v w x y I x u y v I x y

IntensityShifted intensity

Window function

Four shifts: (u,v) = (1,0), (1,1), (0,1), (-1, 1)Look for local maxima in min{E}

Page 8: Harris Method

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 minim

um of E is taken into account

Harris corner detector (1988) solves these problems.

Page 9: Harris Method

Harris corner detector

Noisy response due to a binary window function Use a Gaussian function

Page 10: Harris Method

Harris corner detector

Only a set of shifts at every 45 degree is consideredConsider all small shifts by Taylor’s expansion

yxyx

yxy

yxx

yxIyxIyxwC

yxIyxwB

yxIyxwA

BvCuvAuvuE

,

,

2

,

2

22

),(),(),(

),(),(

),(),(

2),(

Page 11: Harris Method

Harris corner detector

( , ) ,u

E u v u v Mv

Equivalently, for small shifts [u,v] we have a bilinear approximation:

2

2,

( , ) x x y

x y x y y

I I IM w x y

I I I

, where M is a 22 matrix computed from image derivatives:

Page 12: Harris Method

Harris corner detector

Responds too strong for edges because only minimum of E is taken into accountA new corner measurement

Page 13: Harris Method

Harris corner detector

( , ) ,u

E u v u v Mv

Intensity change in shifting window: eigenvalue analysis

1, 2 – eigenvalues of M

direction of the slowest chan

ge

direction of the fastest change

(max)-1/2

(min)-1/2

Ellipse E(u,v) = const

Page 14: Harris Method

Harris corner detector

1

2

Corner1 and 2 are large,

1 ~ 2;

E increases in all directions

1 and 2 are small;

E is almost constant in all directions

edge 1 >> 2

edge 2 >> 1

flat

Classification of image points using eigenvalues of M:

Page 15: Harris Method

Harris corner detector

Measure of corner response:

2det traceR M k M

1 2

1 2

det

trace

M

M

(k – empirical constant, k = 0.04-0.06)

Page 16: Harris Method

Another view

Page 17: Harris Method

Another view

Page 18: Harris Method

Another view

Page 19: Harris Method

Summary of Harris detector

Page 20: Harris Method

Harris corner detector (input)

Page 21: Harris Method

Corner response R

Page 22: Harris Method

Threshold on R

Page 23: Harris Method

Local maximum of R

Page 24: Harris Method

Harris corner detector

Page 25: Harris Method

Harris Detector: Summary• Average intensity change in direction [u,v] can be e

xpressed as a bilinear form:

• Describe a point in terms of eigenvalues of M:measure of corner response

• A good (corner) point should have a large intensity change in all directions, i.e. R should be large positive

( , ) ,u

E u v u v Mv

2

1 2 1 2R k