International Conference on Acoustics, Speech, and Signal Processing · 2003 · 64 citations · 8 references
ComputingComputer ScienceComputational GeometryComputer VisionMachine VisionGeometry ProcessingIntersection DetectionObject DetectionObject RecognitionPattern RecognitionShape AnalysisExecution Time AnalysisInterest Point DetectionKeypoint DetectionLeast Squares ApproximationNonlinear Least SquaresShape DetectionShape Feature Extraction
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.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
8
A survey of the hough transform
J. Illingworth, Josef Kittler · Computer Vision Graphics and Image Processing · 1988 · 2.1K citations
A modified Hough scheme for general circle location
E.R. Davies · Pattern Recognition Letters · 1988 · 187 citations