The Community for Technology Leaders
2014 Second International Symposium on Computing and Networking (CANDAR) (2014)
Shizuoka, Japan
Dec. 10, 2014 to Dec. 12, 2014
ISBN: 978-1-4799-4152-0
pp: 447-452
ABSTRACT
The main contribution of this paper is to present an efficient implementation of the Hough transform algorithm that uses only one-dimensional parameter spaces for circles detection on a Xilinx Virtex-7 FPGA. We implemented the circuit using 398 DSP48E1 slices and 309 block RAMs with 18Kbits. The experimental results show that the architecture runs in 181.812MHz. For an edge image of size 400 × 400, our circuit can perform in at most 970434 clock cycles, i.e., 5337.568µs. Our implementation attains a speed-up factor of approximately 189 over the sequential implementation on the CPU.
INDEX TERMS
Random access memory, Image edge detection, Registers, Transforms, Field programmable gate arrays, Computer architecture, Clocks
CITATION

X. Zhou, Y. Ito and K. Nakano, "An Efficient Implementation of the One-Dimensional Hough Transform Algorithm for Circle Detection on the FPGA," 2014 Second International Symposium on Computing and Networking (CANDAR), Shizuoka, Japan, 2014, pp. 447-452.
doi:10.1109/CANDAR.2014.32
182 ms
(Ver 3.3 (11022016))