The Community for Technology Leaders
Green Image
Approximation of noisy data in the plane by straight line or elliptic or single-branch hyperbolic curve segments arises in pattern recognition, data compaction, and other problems. A number of questions concerning the efficient search for and approximation of data by such curves are examined. Recursive least-squares linear curve fitting is applied to the original or to transformed data in the plane to provide computationally simple algorithms for sequentially searching out appropriate data points and fitting straight line segments or quadratic arcs to the data found. The error minimized by the algorithms is interpreted. Central processing unit (CPU) times for estimating parameters for fitting straight lines and quadratic curves are determined and compared. CPU time for data search is also determined for the case of straight line fitting. Quadratic curve fitting is shown to require about six times as much CPU time as does straight line fitting. Curves relating CPU time and fitting error are determined for straight line fitting. A number of the preceding results are extended by using maximum likelihood curve estimation, and the modification of the classical least-squares curve fit resulting from the use of an a priori probability density function for the unknown curve parameters is determined.
Computational cost, curve-fitting error measures, pattern recognition, recursive least-squares and maximum likelihood curve fitting, sequential curve recognition.

N. Yalabik and D. Cooper, "On the Computational Cost of Approximating and Recognizing Noise-Perturbed Straight Lines and Quadratic Arcs in the Plane," in IEEE Transactions on Computers, vol. 25, no. , pp. 1020-1032, 1976.
91 ms
(Ver 3.3 (11022016))