Abstract
The discretization of the Hough transform parameter plane is considered. It is shown that the popular accumulator method implies sampling of a nonbandlimited signal. The resultant aliasing accounts for several familiar difficulties in the algorithm. Bandlimiting the parameter plane would allow Nyquist sampling, thus aliasing could be avoided. An effectively alias-free Hough algorithm is presented and analyzed. The uncertainty principle of signal representation induces a compromise between image-space localization and parameter-space sampling density, as well as an upper bound on the performance of the algorithm. These results contribute to the development of a design methodology for hierarchical "coarse to fine" Hough algorithms.
Original language | English |
---|---|
Pages (from-to) | 213-222 |
Number of pages | 10 |
Journal | CVGIP: Graphical Models and Image Processing |
Volume | 53 |
Issue number | 3 |
DOIs | |
State | Published - May 1991 |
Externally published | Yes |