Professional Documents
Culture Documents
Lec09 Hough
Lec09 Hough
Lec09 Hough
Voting schemes
Let each feature vote for all the models that
are compatible with it
Hopefully the noise features will not vote
consistently for any single model
Missing data doesnt matter as long as there
are enough features remaining to agree on a
good model
Hough transform
An early type of voting scheme
General outline:
Discretize parameter space into bins
For each feature point in the image, put a vote in every bin in
the parameter space that could have generated this point
Find bins that have the most votes
Image space
Source: S. Seitz
Image space
Image space
(x1, y1)
(x0, y0)
b = x1m + y1
(x1, y1)
(x0, y0)
b = x1m + y1
Algorithm outline
Initialize accumulator H
to all zeros
For each edge point (x,y)
in the image
For = 0 to 180
= x cos + y sin
H(, ) = H(, ) + 1
end
end
Find the value(s) of (, ) where H(, ) is a
local maximum
Basic illustration
features
votes
Other shapes
Square
Circle
Several lines
Effect of noise
features
votes
Effect of noise
features
votes
Effect of noise
Number of votes for a line of 20 points with
increasing noise:
Random points
features
votes
Random points
As the level of uniform noise increases, the
maximum number of votes increases too:
Practical details
Try to get rid of irrelevant features
Take only edge points with significant gradient magnitude
y
( x, y ) + rf ( x, y )
(x,y)
( x, y ) rf ( x, y )
x
y
x
y
What is more efficient: going from the image
space to the parameter space or vice versa?
Application in recognition
Laplacian
circles
Hough-like
circles
a
p
r()
Example
model shape
Example
Example
Example
Example
Example
Example
Example
Application in recognition
Instead of indexing displacements by gradient
orientation, index by visual codeword
Application in recognition
Instead of indexing displacements by gradient
orientation, index by visual codeword
test image
B. Leibe, A. Leonardis, and B. Schiele, Combined Object Categorization and
Segmentation with an Implicit Shape Model, ECCV Workshop on Statistical
Learning in Computer Vision 2004