Nonparametric segmentation of curves into various representations
- 1 January 1995
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Ieee Transactions On Pattern Analysis and Machine Intelligence
- 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 SolidsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Locating perceptually salient points on planar curvesIeee Transactions On Pattern Analysis and Machine Intelligence, 1994
- Extracting Geometric PrimitivesCVGIP: Image Understanding, 1993
- Ellipse detection and matching with uncertaintyImage and Vision Computing, 1992
- Projectively invariant representations using implicit algebraic curvesPublished by Springer Science and Business Media LLC ,1990
- Robust Regression and Outlier DetectionWiley Series in Probability and Statistics, 1987
- Perceptual Organization and Curve PartitioningIeee Transactions On Pattern Analysis and Machine Intelligence, 1986
- Optimum Uniform Piecewise Linear Approximation of Planar CurvesIeee Transactions On Pattern Analysis and Machine Intelligence, 1986
- Fitting conic sections to “very scattered” data: An iterative refinement of the bookstein algorithmComputer Graphics and Image Processing, 1982
- On the Computational Cost of Approximating and Recognizing Noise-Perturbed Straight Lines and Quadratic Arcs in the PlaneIEEE Transactions on Computers, 1976