MIDTERM WED' OCT'21

1
MIDTERM WED. OCT.21
2
Modified Hough Algorithm(More Efficient)

• Note that for p-parameters a1,a2,,ap containing
  2 translation parameters that the accumulator
  array is now (p-2) dimensional.
• Also note reduction in the number of pixels that
  are effectively visited
• Instead of examining all pixels as a possible
  center for the shape we now only examine edge
  points as possible boundary points for the shape.

3
GENERALIZED HOUGH ALGORITHM
4
BINARY SETS AND THEIR PROPERTIES
5
(No Transcript)
6
MORPHOLOGICAL OPENING AND CLOSING
7
EUCLIDEAN DISTANCE TRANSFORM

• For a set S the Euclidean Distance Transform is
  the non-negative scalar function d(x,S) where x
  is a point in S and d(x,S) is the shortest
  distance from x to the boundary of S.

8
SKELETONS AND THE MEDIAL AXIS TRANSFORM
9
(No Transcript)