In this paper, we describe a circuit for real-time computation of the Generalized Hough Transform (GHT). The GHT is a technique to find out arbitrary shapes in an image. The GHT is very robust to occlusion and noises, but requires large amount of memory and long computation time. In the GHT, a point is chosen as a reference point of a shape, and the point is searched using edge points in an image. In order to implement the GHT on one FPGA, we first look up regions that may include the reference points, and then search the points in those regions. With this two phase search, the circuit on XC2V6000 can find 112 kinds of shapes smaller than 256 × 256 pixels in an image (640 × 480 pixels) in real-time (more than 25 frames per second). The 112 kinds of shapes can be used to find an object of arbitrary distance and angle in 3-D space.
[1]
Marcus A. Magnor,et al.
A graphics hardware implementation of the generalized Hough transform for fast object recognition, scale, and 3D pose detection
,
2003,
12th International Conference on Image Analysis and Processing, 2003.Proceedings..
[2]
Emilio L. Zapata,et al.
A Parallel Pipelined Hough Transform
,
1996,
Euro-Par, Vol. II.
[3]
Mamoru Nakanishi,et al.
A parallel algorithm for real-time object recognition
,
2002,
Pattern Recognit..
[4]
Marco Ferretti.
The Generalized Hough Transform on Mesh-Connected Computers
,
1993,
J. Parallel Distributed Comput..
[5]
Dana H. Ballard,et al.
Generalizing the Hough transform to detect arbitrary shapes
,
1981,
Pattern Recognit..