Nonparametric segmentation of curves into various representations

1 January 1995

journal article
Published by Institute of Electrical and Electronics Engineers (IEEE)

Vol. 17 (12) , 1140-1153
https://doi.org/10.1109/34.476507

Abstract

This paper describes and demonstrates the operation and performance of an algorithm for segmenting connected points into a combination of representations such as lines, circular, elliptical and superelliptical arcs, and polynomials. The algorithm has a number of interesting properties including being scale invariant, nonparametric, general purpose, and efficient.

Keywords

This publication has 53 references indexed in Scilit:

Error Of Fit Measures For Recovering Parametric Solids
Published by Institute of Electrical and Electronics Engineers (IEEE) ,2005
Locating perceptually salient points on planar curves
Published by Institute of Electrical and Electronics Engineers (IEEE) ,1994
Extracting Geometric Primitives
CVGIP: Image Understanding, 1993
Ellipse detection and matching with uncertainty
Image and Vision Computing, 1992
Projectively invariant representations using implicit algebraic curves
Published by Springer Nature ,1990
Robust Regression and Outlier Detection
Published by Wiley ,1987
Perceptual Organization and Curve Partitioning
Published by Institute of Electrical and Electronics Engineers (IEEE) ,1986
Optimum Uniform Piecewise Linear Approximation of Planar Curves
Published by Institute of Electrical and Electronics Engineers (IEEE) ,1986
Fitting conic sections to “very scattered” data: An iterative refinement of the bookstein algorithm
Computer Graphics and Image Processing, 1982
On the Computational Cost of Approximating and Recognizing Noise-Perturbed Straight Lines and Quadratic Arcs in the Plane
IEEE Transactions on Computers, 1976