The dynamic generalized hough transform

  • V. F. Leavers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 427)


A new algorithm for computing the Hough transform has been presented. It uses information present in the location of the feature points to reduce the generation of evidence in the transform plane. The algorithm gives improved performance compared with the standard Hough transform. The improvement is in computation time and memory allocation. Further advantages of using the algorithm are that peak detection is one dimensional and the end points of curves may be detected. The algorithm is also inherently parallel.


Feature Point Image Point Image Space Memory Allocation Hough Transform 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. [1]
    Hough P.V.C.Method and means for Recognising complex patterns. U.S. Patent No. 3069654, 1962Google Scholar
  2. [2]
    Ballard D.H.Generalizing the Hough Transform to detect arbitrary shapes, Pattern Recognition, Vol 13. No. 2, 111–122, 1981.Google Scholar
  3. [3]
    Gerig G. and Klein F.Fast contour identification through efficient Hough transform and simplified interpretation strategies.Proc. 8th Int. Conf. Pattern Recognition, Vol 1, Paris 1986.Google Scholar
  4. [4]
    Li H., Lavin M.A. and LeMaster R.J.Fast Hough TransformProc. of 3rd workshop on computer vision: Bellair, Michgan 1985Google Scholar
  5. [5]
    Li H.Fast Hough Transform for multidimensional signal processing, IBM Research report, RC 11562, York Town Heights 1985Google Scholar
  6. [6]
    Illingworth J. and Kittler J.The adaptive Hough transformin press IEEE T-PAMI 1987Google Scholar
  7. [7]
    Forman A.VA modified Hough transform for detecting lines in digital imagery, 151–160, SPIE, Vol 635, Applications of Artificial Intelligence III, 1986.Google Scholar
  8. [8]
    Jain A.N. and Krig D.B.A robust Hough transform technique for machine vision, Proc. Vision 86, Detroit, Michigan, 86.Google Scholar
  9. [9]
    Illingworth J. and Kittler J.A survey of the Hough transform, accepted for publication in IEEE Trans. on Pattern Analysis and Mach. Intell., 1987.Google Scholar
  10. [10]
    Leavers V.F. and Sandler M. B.An efficient Radon transformBPRA 4th International Conf., Cambridge, 1988.Google Scholar
  11. [11]
    R.S. WallaceA modified Hough transform for lines, IEEE conference on computer vision and pattern recognition, San Francisco 1985, 665–667.Google Scholar
  12. [12]
    Leavers V.F.Method and Means of Shape Parametrisation, British Patent App. N0. 8622497. September 1986.Google Scholar
  13. [13]
    Leavers V.F. and Boyce J.F.The Radon transform and its application to shape detection in computer vision, Image and Vision Computing Vol.5, May 1987.Google Scholar
  14. [14]
    Gerig G.Linking image-space and accumulator-space. A new approach for object recognitionProc. of First Int. Conf. on Computer Vision, London, June 1987Google Scholar
  15. [15]
    Leavers V.F.Dynamic Generalized Hough Transform, British Patent Application, April 1989.Google Scholar
  16. [16]
    Deans S.R.Hough transform from the Radon transform.IEEE Trans. Pattern Analysis and Machine Intelligence. Vol. PAMI-3, No., March 1981.Google Scholar
  17. [17]
    Gel'fand I.M., Graev M.I. and Vilenkin N.Ya.Generalized functionsVol 5, Academic Press, New York, 1966.Google Scholar
  18. [18]
    Leavers V.F., Ben-Tzvi D. and Sandler M.B.A Dynamic Hough Transform for Lines and Circles, Alvey Vision Conference, Reading, 1989Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1990

Authors and Affiliations

  • V. F. Leavers
    • 1
  1. 1.Department of PhysicsKing's College LondonStrand, London

Personalised recommendations