A new and efficient transform for curve detection
Ping Liang · Journal of Robotic Systems · 1991
Abstract A new transform for curve detection, called the Curve‐Fitting Hough Transform (CFHT), is proposed. In the conventional Hough Transform (HT) and its variants, both storage and computation grow exponentially with the number of parameters. The CFHT is advantageous over the conventional HT and variants in its high speed, small storage, arbitrary parameter range, and high parameter resolution. This is achieved by fitting a segment of the curve to be detected to a small neighborhood of edge points. If the fitting error is less than a given threshold, the parameters obtained from curve fitting are used to map an edge element to a single point in the parameter space. A multidimensional ordered parameter list is used to accumulate the occurrences of the curve to be detected.