1. Object Detection 01 – Basic Hough Transformation JJCAO

2. What do you see?

8. “Puzzle” solved from a new view

9. Different view, different domain ? ! The same problem, phenomenon or data set, when viewed from a different angle, or in a new domain, may better reveal its underlying structure to facilitate the solution

10. Line and curve detection Find lines, curves, or parts of lines or curves in an input image. Such an image might be the output of a edge detector Hough Transform: Elegant method for direct object recognition – Edges need not be connected – Complete object need not be visible – Key Idea: Edges VOTE for the possible model 10 Detect partially occluded lines

11. Hough transforms oObject detection → peaks identification in Hough images oHough59: P.V.C. Hough, A method for faster analysis of bubble chamber photographs, International Conference on High Energy Accelerators and Instrumentation, 1959, cited times: 33 oUSE OF THE HOUGH TRASFORMTION TO DETECT LINES and Curves in Pictures_duda_CommunAcm71, cited times: 2623 oGENERALIZING THE HOUGH TRANSFORM TO DETECT ARBITRARY SHAPES_Ballard_pr81, cited times: 2476 oA survey of the hough transform_Illingworth_CVGIP88, cited times: 1339

12. Beyond lines!!! Hough transform is a method for estimating the parameters of a shape from its boundary points The idea can be generalized to estimate “parameters” of arbitrary shapes – Ballard 1981 – Other primitives – Lowe, ICCV 1999 – Object detection – Leibe, Schiele BMVC 2003 – Object class detection – CVPR 2009: Maji& Malik, Gall& Lempitsky, Gu et al. … – CVPR 2010: Bari, Lemp & Kohli 12

13. HT for Lines: representation 1 straight line in image space: y = mx+ b, is plotted for each pair of values (x, y). What is the characteristic of the line? – Not x or y – But its slope m and intercept b A line in the image corresponds to a point in Hough space 13 Image spaceHough parameter space Source: S. Seitz

14. Parameter space representation What does a point (x 0, y 0 ) in the image space map to in the Hough space? Image spaceHough parameter space

15. Parameter space representation What does a point (x 0, y 0 ) in the image space map to in the Hough space? – Answer: the solutions of b = –x 0 m + y 0 – This is a line in Hough space Image spaceHough parameter space

16. Parameter space representation Where is the line that contains both (x 0, y 0 ) and (x 1, y 1 )? Image spaceHough parameter space (x 0, y 0 ) (x 1, y 1 ) b = –x 1 m + y 1

17. Parameter space representation Where is the line that contains both (x 0, y 0 ) and (x 1, y 1 )? – It is the intersection of the lines b = –x 0 m + y 0 and b = –x 1 m + y 1 Image spaceHough parameter space (x 0, y 0 ) (x 1, y 1 ) b = –x 1 m + y 1

18. HT for Lines: representation 1 18 Parameter space (b,m) b=y-mx Image space y=mx+b (x,y) Parameter Space

19. Line Detection by Hough Transform Parameter Space 11 11 11 2 11 11 11 Algorithm: Quantize Parameter Space Create Accumulator Array Set For each image edge increment: If lies on the line: Find local maxima in

20. HT for Lines: representation 2 20

21. HT for Lines 21 Parameter space (b,m) Image space y=mx+b (x,y)

22. HT for Lines - Computation How to find the intersection point? 22

23. Algorithm HOUGH_LINES 23 Is any pixels a voter?

24. Several lines

25. HT lines: local max & threshold 25 Image space votes Horizontal axis is θ, vertical is rho.

26. Dealing with noise Try to get rid of irrelevant features – Take only edge points with significant gradient magnitude Choose a good grid / discretization – Too coarse: large votes obtained when too many different lines correspond to a single bucket – Too fine: miss lines because some points that are not exactly collinear cast votes for different buckets Increment neighboring bins  smoothing in accumulator array

27. 27 HT for lines: noisy example

28. A more complicated image http://ostatic.com/files/images/ss_hough.jpg

29. HT lines: Problem of parameter ranges 29 Vertical flip P n

30. HT lines: Parameter ranges 30

31. HT lines: Parameter ranges 31

32. Real World Example Original Edge Detection Found Lines Parameter Space Could we extract better edges?

33. Algorithm HOUGH_line (weight) 33 Is any pixels a voter? Gradient(i,j)

34. Hough_Grd Recall: when we detect an edge point, we also know its gradient direction But this means that the line is uniquely determined! Modified Hough transform: For each edge point (x,y) θ = gradient orientation at (x,y) ρ = x cos θ + y sin θ A(θ, ρ) = A(θ, ρ) + 1 end Θ=[0-360] so there is a conversion

35. EE6358 - Computer Vision 35 Computational Load

36. Mechanics of the Hough transform Difficulties – how big should the cells be? (too big, and we merge quite different lines; too small, and noise causes lines to be missed) How many lines? – Count the peaks in the Hough array – Treat adjacent peaks as a single peak Which points belong to each line? – Search for points close to the line – Solve again for line and iterate

37. HT for high dimensional Parameter Curves 37

38. 38 5.2 Parameters for analytic curves Analytic FormParametersEquation Line , xcos+ysin= Circle x 0, y 0,  (x-x o ) 2 +(y-y 0 ) 2 =r 2 Parabola x 0, y 0, (y-y 0 ) 2 =4(x-x o ) Ellipse x 0, y 0, a, b, (x-x o ) 2 /a 2 +(y-y 0 ) 2 /b 2 =1

39. Summary Feature extraction technique in cv Purpose of it is to find imperfect (partially occluded, noisy) instances of objects within a certain class of shapes By a voting procedure: – 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 Since each point is handled independently, parallel implementations are possible It becomes difficult when the dimension of the parameter space is large 39

40. HT for Circles: Search with fixed R Equation of Circle:

41. Multiple Circles with known R Multiple circles with the same radius can be found with the same technique. The centerpoints are represented as red cells in the parameter space drawing. Overlap of circles can cause spurious centers to also be found, such as at the blue cell. Spurious circles can be removed by matching to circles in the original image. 41

42. HT for Circles: Search with unknown R Equation of Circle: If radius is not known: 3D Hough Space! Use Accumulator array What is the surface in the hough space?

43. Hough transform for circles x y (x,y) x y r image spaceHough parameter space

44. 44

45. Generalized Hough transform We want to find a shape defined by its boundary points and a reference point D. Ballard, Generalizing the Hough Transform to Detect Arbitrary Shapes, Pattern Recognition 13(2), 1981, pp. 111-122. a

46. Generalized Hough transform We want to find a shape defined by its boundary points and a reference point For every boundary point p, we can store the displacement vector r = a – p as indexed by gradient orientation θ D. Ballard, Generalizing the Hough Transform to Detect Arbitrary Shapes, Pattern Recognition 13(2), 1981, pp. 111-122. (x c,y c ) θiθi riririri PiPiPiPi iiii x c = x i + r i cos(  i ) y c = y i + r i sin(  i )

47. Generalizing the H.T. (x c,y c ) PiPiPiPi iiii riririri iiii x c = x i + r i cos(  i ) y c = y i + r i sin(  i ) Suppose, there were m different gradient orientations: (m <= n) Suppose, there were m different gradient orientations: (m <= n) 1122......mm1122......mm... (r 1 1,  1 1 ),(r 1 2,  1 2 ),…,(r 1 n1,  1 n1 ) (r 2 1,  2 1 ),(r 2 2,  1 2 ),…,(r 2 n2,  1 n2 )... (r m 1,  m 1 ),(r m 2,  m 2 ),…,(r m nm,  m nm ) jjjj rjrjrjrj jjjj R-table

48. Example model shape

49. Example displacement vectors for model points

50. Example range of voting locations for test point

51. Example range of voting locations for test point

52. Example votes for points with θ =

53. Example displacement vectors for model points

54. Example range of voting locations for test point

55. votes for points with θ = Example

56. Generalized Hough Transform Find Object Center given edges Create Accumulator Array Initialize: For each edge point For each entry in table, compute: Increment Accumulator: Find Local Maxima in Assumption: translation is the only transformation here, i.e., orientation and scale are fixed

58. 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 doesn’t matter as long as there are enough features remaining to agree on a good model

59. Applications 59

60. Measuring local gradient saliency Gradient => Gradient saliency 60 GradientShop: A Gradient-Domain Optimization Framework for Image and Video Filtering_tog09

61. Speed up – Kernel Based HT 61 Real-time line detection through an improved Hough transform voting scheme_pr08, cited times: 72

62. More A new curve detection method: Randomized Hough transform (RHT)_prl90, cited times: 555 An improved Hough transform voting scheme utilizing surround suppression_prl_09 An Improved Hough Transform Neighborhood Map for Straight Line Segments_tip10 A probabilistic Hough transform_pr91 Progressive Probabilistic hough transform_98 62