Abstract :
In the Hough transform votes are added in the parameter space along patterns dictated by image pixels´ location. The time performance of the transform is directly related to the rate at which the addresses along these patterns are generated. Usually, these addresses are calculated using digital multiplication or a look-up table. For a slope-intercept parameterisation, where a point is transformed into a monotonic straight line, a method is proposed whereby each such line is represented by a bit sequence, and the process of address generation is accomplished by a counting sequence. Implemented with a simple circuitry, a high throughput is achievable.
Keywords :
computerised pattern recognition; computerised picture processing; counting circuits; transforms; Hough transform; address generation; bit sequence; counter-based transform; counting sequence; high throughput; image processing; monotonic straight line; parametric transformation; shape analysis; slope-intercept parameterisation;
