Segmenting curves into elliptic arcs and straight lines
- 4 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
A method is described for segmenting edge data into a combination of straight lines and elliptic arcs. The two-stage process first segments the data into straight line segments. Ellipses are then fitted to the line data. This is much faster than curve fitting directly to pixel data since the lines provide a great reduction in data. Segmentation is performed in the paradigm suggested by D.G. Lowe (1987). A measure of significance is defined that produces a scale-invariant description and allows the replacement of sequences of line segments by ellipses without requiring any thresholds. A method for fitting ellipses to arbitrary curves, essential for this algorithm, has been developed, based on an iterative Kalman filter. This is guaranteed to produce an elliptical fit even though the best conic fit may be a hyperbola or parabola.Keywords
This publication has 7 references indexed in Scilit:
- Fitting ellipses and predicting confidence envelopes using a bias corrected Kalman filterImage and Vision Computing, 1990
- Segmentation of edges into lines and arcsImage and Vision Computing, 1989
- A simple approach for the estimation of circular arc center and its radiusComputer Vision, Graphics, and Image Processing, 1989
- Detection of an ellipse by use of a recursive least-squares estimatorJournal of Robotic Systems, 1985
- Curve Fitting with Conic SplinesACM Transactions on Graphics, 1983
- A note on polygonal and elliptical approximation of mechanical partsPattern Recognition, 1979
- On the Computational Cost of Approximating and Recognizing Noise-Perturbed Straight Lines and Quadratic Arcs in the PlaneIEEE Transactions on Computers, 1976