Elsevier

Pattern Recognition

Volume 32, Issue 2, February 1999, Pages 181-192
Pattern Recognition

A modified Hough transform for line detection and its performance

https://doi.org/10.1016/S0031-3203(98)00140-XGet rights and content

Abstract

The heavy burden of computational complexity and massive storage requirement is the drawback of the standard Hough transform (HT). Besides, the Hough transform is also quite a “blind” algorithm, which is much inferior to the intellectual mechanism of human’s visual recognition. To overcome these weaknesses of Hough transform, many modified approaches have been presented. In this paper, a modified Hough transform is proposed to alleviate the computation and storage burden of standard Hough transform, as well as its “blindness”. This algorithm is directly motivated by the recently popular probabilistic Hough transform (PHT). However, it has some specific advantages in comparison with other kinds of PHT methods.

References (0)

Cited by (89)

  • Wheat rows detection at the early growth stage based on Hough transform and vanishing point

    2016, Computers and Electronics in Agriculture
    Citation Excerpt :

    In essence, Hough transform is a voting process where each point belonging to the patterns votes for all the possible patterns passing through that point. These votes are accumulated in an accumulator array, and the pattern receiving the maximum votes is recognized as the desired pattern (Chutatape and Guo, 1999). A threshold is usually required to clear the neighbourhood in the process of peak detection (Rovira-Más et al., 2005; Jones et al., 2009a,b).

  • A survey of Hough Transform

    2015, Pattern Recognition
View all citing articles on Scopus
View full text