Number theory helps line detection in digital images an extended abstract

  • Tetsuo Asano
  • Naoki Katoh
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 762)


This paper deals with the problem of detecting line components in a digital image. For this purpose, the Hough Transform, which is based on voting in the dual plane, is widely used. However, there have been few theoretical studies on the relationship between its computational complexity and ability of detecting straight lines. In this paper we present two completely different algorithms for detecting every maximal line component contained in a digital image. The one, which is effective in the case of a dense digital image, is based on a new transformation named L1-Dual Transform defined by the L1-distance between points and lines. Number Theory supports efficient implementation of the algorithm. It can complete the required task in least time needed to achieve the above-mentioned ability of line detection. The other, which is effective when the edge density is low, attains efficiency by using the plane sweep technique in computational geometry. Furthermore, we present an efficient approximation algorithm which can detect at least α×100% of any maximal line component and show that its computational complexity depends on the value of α. Choosing α=0.5, for example, the time complexity of the algorithm is reduced from O(N4) to O(N3), where N is the length of one side of an image.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [H62]
    P. V. C. Hough: ”Method and Means for Recognizing Complex Patterns”, U.S. Patent 3069654, December 18, 1962.Google Scholar
  2. [DH72]
    R. O. Duda and P.E. Hart: ”Use of the Hough Transformation to Detect Lines and Curves in Pictures”, Comm. of the ACM, 15, January 1972, pp. 11–15.CrossRefGoogle Scholar
  3. [MK89]
    T. Matsuyama and H. Koshimizu: ”Hough Transform and Pattern Matching in Computer Vision”, Joho-Shori, 20, 9, 1989, pp. 1035–1046.Google Scholar
  4. [FWM91]
    Fujii, Wada and Matsuyama: ”How to Construct a Parameter Space without any Distortion in Hough Transform”, Proc. 1991 Domestic Conference of IEICE of Japan, D-562 (1991).Google Scholar
  5. [K81]
    D. E. Knuth: ”The Art of Computer Programming”, Vol. II (Seminumerical Algorithms), p.324, Addison-Wesley, 1981.Google Scholar
  6. [GKP89]
    R. L. Graham, D. E. Knuth, and O. Patashnik: ”Concrete Mathematics”, Addison-Wesley, 1989.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  • Tetsuo Asano
    • 1
  • Naoki Katoh
    • 2
  1. 1.Osaka Electro-Communication UniversityNeyagawaJapan
  2. 2.Gakuen-Nishimachi, Nishi-kuKobe University of CommerceKobeJapan

Personalised recommendations