On the computational cost of approximating and recognizing noise-perturbed straight lines and quadratic arcs in the plane
Recognition of underlying straight lines and quadratic arcs in line drawings, and approximation of very noisy data by such line/curve segments, is addressed as a subproblem of the more general problem of optimum recognition of complicated line/curve drawings. Some specific algorithms are presented with extensions and interpretations for more complicated applications, and a data generation model is developed for the problem. Data are generated as a perturbation of a single underlying straight line or an elliptic or hyperbolic arc. Recursive estimation techniques, minimization of central processing unit time, decision making with controlled error probabilities, and modeling and recognition of pictures consisting of noisy curves are dealt with. Applications envisaged include: picture data compression, contour line representation in maps, intelligent data searches, and ballistic missile decoy tracking.