Name
Abstract | ||
|---|---|---|
The authors survey three approaches to extending the Hough transform that improve speed and reduce memory requirements. Two approaches center on the use of two-pass techniques to reduce dimensionality. One approach, specifically aimed at circle extraction, offers little more than a polar transformation. In the second approach, for ellipses, center coordinates and rotation are extracted in the first pass, and major and minor radii in the second. The final technique involves an iterative search procedure based on combining intersecting points between an approximation ellipse and its target and using a nonlinear least squares to evaluate the approximation. Each of these techniques requires less than 5% of the execution time of the equivalent Hough transform |
Year | DOI | Venue |
|---|---|---|
1989 | 10.1109/ICASSP.1989.266739 | Glasgow |
Keywords | DocType | ISSN |
transforms,hough transform,approximation ellipse,circle extraction,ellipses,execution time,iterative search procedure,major radius,minor radius,nonlinear least squares,two-pass techniques,data structures,data mining,least squares approximation,image analysis,voting,computer science,shape,image recognition,noise shaping | Conference | 1520-6149 |
Citations | PageRank | References |
18 | 2.13 | 0 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Muammar, H. | 1 | 18 | 2.13 |
| Nixon, M. | 2 | 18 | 2.13 |