Skip to main content

Object Location Using the HOUGH Transform

  • Reference work entry
Machine Vision Handbook
  • 7562 Accesses

Abstract

This chapter considers how best to locate 2D object shapes in digital images. Simple paradigms such as boundary tracking followed by analysis of centroidal shape profiles lack robustness and are incapable of coping with occlusion, breakage or gross shape distortions, whereas the Hough transform readily overcomes these problems as an integral property of its voting schema. This is an important advantage, especially in practical situations such as those where lighting is non-ideal. In addition, the Hough transform is excellent at locating straight lines, circles, ellipses and other well defined shapes: it can even locate arbitrary shapes that are defined by so-called R-tables. The method also has the advantage of being able to make sense of patterns of point features, and is far less computation intensive than the maximal clique graph matching method often used for this purpose. Being a form of spatial matched filter, the Hough transform has high signal-to-noise sensitivity, and for simple shapes is highly efficient, but when applied to arbitrary shapes of variable orientation, size and individual variability, measures have to be taken to limit its computation. Overall, the Hough transform provides a very useful, robust search technique for locating known types of object in digital images.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 999.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 549.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Davies ER (2005) Machine vision: theory, algorithms, practicalities, 3rd edn. Morgan Kaufmann, San Francisco

    Google Scholar 

  2. Hough PVC (1962) Method and means for recognising complex patterns. US Patent 3069654

    Google Scholar 

  3. O’Gorman F, Clowes MB (1976) Finding picture edges through collinearity of feature points. IEEE Trans Comput 25:449–456

    Article  MATH  Google Scholar 

  4. Davies ER (1986) Image space transforms for detecting straight edges in industrial images. Pattern Recogn Lett 4:185–192

    Article  Google Scholar 

  5. Wallace RS (1985) A modified Hough transform for lines. IEEE international conference on computer vision and pattern recognition, San Francisco (11–13 June), pp 665–667

    Google Scholar 

  6. Dudani SA, Luk AL (1978) Locating straight-line edge segments on outdoor scenes. Pattern Recogn 10:145–157

    Article  Google Scholar 

  7. Kimme C, Ballard D, Sklansky J (1975) Finding circles by an array of accumulators. Comm ACM 18:120–122

    Article  MATH  Google Scholar 

  8. Davies ER (1988) A modified Hough scheme for general circle location. Pattern Recogn Lett 7:37–43

    Article  Google Scholar 

  9. Davies ER (1987) A high speed algorithm for circular object location. Pattern Recogn Lett 6:323–333

    Article  Google Scholar 

  10. Davies ER, Barker SP (1990) An analysis of hole detection schemes. In: Proceedings of the British machine vision association conference, Oxford (24–27 September), pp 285–290

    Google Scholar 

  11. Davies ER (1989) Finding ellipses using the generalised Hough transform. Pattern Recogn Lett 9:87–96

    Article  Google Scholar 

  12. Tsuji S, Matsumoto F (1978) Detection of ellipses by a modified Hough transform. IEEE Trans Comput 27:777–781

    Article  Google Scholar 

  13. Yuen HK, Illingworth J, Kittler J (1988) Ellipse detection using the Hough transform. In: Proceedings of the 4th Alvey Vision Conference, Manchester, 31 August–2 September, pp 265–271

    Google Scholar 

  14. Davies ER (1998) Rapid location of convex objects in digital images. In: Proceedings of the European Signal Processing Conference (EUSIPCO’98), Rhodes, Greece (8–11 Sept.), pp 589–592

    Google Scholar 

  15. Davies ER (1999) Algorithms for ultra-fast location of ellipses in digital images. In: Proceedings of the 7th IEE international conference on image processing and its applications, Manchester (13–15 July), IEE Conference Publication no. 465, pp 542–546

    Google Scholar 

  16. Ballard DH, Brown CM (1981) Generalizing the Hough transform to detect arbitrary shapes. Pattern Recogn 13:111–122

    Article  MATH  Google Scholar 

  17. Davies ER (1993) Electronics, noise and signal recovery. Academic, London

    Google Scholar 

  18. Davies ER (1987) A new framework for analysing the properties of the generalised Hough transform. Pattern Recogn Lett 6:1–7

    Article  Google Scholar 

  19. Bolles RC, Cain RA (1982) Recognizing and locating partially visible objects: the local-feature-focus method. Int J Robotics Res 1(3):57–82

    Article  Google Scholar 

  20. Davies ER (1991) The minimal match graph and its use to speed identification of maximal cliques. Signal Process 22(3):329–343

    Article  Google Scholar 

  21. Davies ER (1991) Alternative to abstract graph matching for locating objects from their salient features. Image Vision Comput 9(4):252–261

    Article  Google Scholar 

  22. Rosenfeld A (1969) Picture processing by computer. Academic, New York

    MATH  Google Scholar 

  23. Duda RO, Hart PE (1972) Use of the Hough transformation to detect lines and curves in pictures. Comm ACM 15:11–15

    Article  Google Scholar 

  24. Gerig G, Klein F (1986) Fast contour identification through efficient Hough transform and simplified interpretation strategy. In: Proceedings of the 8th international conference on pattern recognition, Paris (27–31 October), pp 498–500

    Google Scholar 

  25. Stockman GC, Agrawala AK (1977) Equivalence of Hough curve detection to template matching. Comm ACM 20:820–822

    Article  MATH  Google Scholar 

  26. Sklansky J (1978) On the Hough technique for curve detection. IEEE Trans Comput 27:923–926

    Article  MATH  Google Scholar 

  27. Xu L, Oja E (1993) Randomized Hough transform (RHT): basic mechanisms, algorithms, and computational complexities. CVGIP Imag Understanding 57(2):131–154

    Article  Google Scholar 

  28. Tsukune H, Goto K (1983) Extracting elliptical figures from an edge vector field. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, Washington, pp 138–141

    Google Scholar 

  29. Basalamah S, Bharath A, McRobbie D (2004) Contrast marginalised gradient template matching. In: Pajdla T, Matas J (eds) 8th European Conference on Computer Vision (ECCV 2004), Prague, Czech Republic. Springer, Berlin, pp 417–429

    Google Scholar 

  30. Bolles RC (1979) Robust feature matching via maximal cliques. SPIE, 182. In: Proceedings of the technical symposium on imaging applications for automated industrial inspection and assembly, Washington DC (April), pp 140–149

    Google Scholar 

  31. Kasif S, Kitchen L, Rosenfeld A (1983) A Hough transform technique for subgraph isomorphism. Pattern Recogn Lett 2:83–88

    Article  Google Scholar 

  32. Davies ER (1988) An alternative to graph matching for locating objects from their salient features. In: Proceedings of the 4th Alvey Vision Conference, Manchester, 31 August–2 September, pp 281–286

    Google Scholar 

  33. Davies ER (1992) Locating objects from their point features using an optimised Hough-like accumulation technique. Pattern Recogn Lett 13(2):113–121

    Article  Google Scholar 

  34. Xie Y, Ji Q (2002) A new efficient ellipse detection method. In: Proceedings of the 16th International Conference on Pattern Recognition, Québec, Canada, 11–15 August, vol II, pp 957–960

    Google Scholar 

  35. Lei Y, Wong KC (1999) Ellipse detection based on symmetry. Pattern Recogn Lett 20(1):41–47

    Article  MATH  Google Scholar 

  36. Toennies K, Behrens F, Aurnhammer M (2002) Feasibility of Hough-transform-based iris localisation for real-time application. In: Proceedings of the 16th international conference on pattern recognition, Québec, Canada, 11–15 August, vol II, pp 1053–1056

    Google Scholar 

  37. Wang J-G, Sung E (2001) Gaze determination via images of irises. Image Vision Comput 19(12):891–911

    Article  MathSciNet  Google Scholar 

  38. Wu H, Yoshikawa G, Shioyama T, Lao S, Kawade M (2002) Glasses frame detection with 3D Hough transform. In: Proceedings of the 16th international conference on pattern recognition. Québec, Canada, 11–15 August, vol II, pp 346–349

    Google Scholar 

  39. Schaffalitsky F, Zisserman A (2000) Planar grouping for automatic detection of vanishing lines and points. Image Vision Comput 18(9):647–658

    Article  Google Scholar 

  40. Tuytelaars T, Turina A, van Gool L (2003) Noncombinatorial detection of regular repetitions under perspective skew. IEEE Trans Pattern Anal Mach Intell 25(4):418–432

    Article  Google Scholar 

  41. Davies ER, Atiquzzaman M (eds) (1998) Special issue on projection-based transforms. Image Vision Comput 16:9–10

    Google Scholar 

Download references

Acknowledgements

This research has been supported by Research Councils UK, under Basic Technology Grant GR/R87642/02.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to E. Roy Davies .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag London Ltd.

About this entry

Cite this entry

Davies, E.R. (2012). Object Location Using the HOUGH Transform. In: Batchelor, B.G. (eds) Machine Vision Handbook. Springer, London. https://doi.org/10.1007/978-1-84996-169-1_18

Download citation

Publish with us

Policies and ethics