A Hardware Architecture of Hough Transform Using an Improved Voting Scheme 


Vol. 38,  No. 9, pp. 773-781, Sep.  2013


PDF
  Abstract

The Hough transform for line detection is widely used in many machine vision applications due to its robustness against data loss and distortion. However, it is not appropriate for real-time embedded vision systems, because it has inefficient computation structure and demands a large number of memory accesses. Thus, this paper proposes an improved voting scheme of the Hough transform, and then applies this scheme to a Hough transform hardware architecture so that it can provide real-time performance with less hardware resource. The proposed voting scheme reduces computation overhead of the voting procedure using correlation between adjacent pixels, and improves computational efficiency by increasing reusability of vote values. The proposed hardware architecture, which adopts this improved scheme, maximizes its throughput by computing and storing vote values for many adjacent pixels in parallel. This parallelization for throughput improvement is accomplished with little hardware overhead compared with sequential computation.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

J. Lee, K. Bae, B. Moon, "A Hardware Architecture of Hough Transform Using an Improved Voting Scheme," The Journal of Korean Institute of Communications and Information Sciences, vol. 38, no. 9, pp. 773-781, 2013. DOI: .

[ACM Style]

Jeong-Rok Lee, Kyeong-ryeol Bae, and Byungin Moon. 2013. A Hardware Architecture of Hough Transform Using an Improved Voting Scheme. The Journal of Korean Institute of Communications and Information Sciences, 38, 9, (2013), 773-781. DOI: .

[KICS Style]

Jeong-Rok Lee, Kyeong-ryeol Bae, Byungin Moon, "A Hardware Architecture of Hough Transform Using an Improved Voting Scheme," The Journal of Korean Institute of Communications and Information Sciences, vol. 38, no. 9, pp. 773-781, 9. 2013.