Efficient algorithms for finding the centers of conics and quadrics in noisy data
- 1 May 1997
- journal article
- Published by Elsevier in Pattern Recognition
- Vol. 30 (5) , 673-684
- https://doi.org/10.1016/s0031-3203(96)00122-7
Abstract
No abstract availableThis publication has 17 references indexed in Scilit:
- Comparative study of Hough Transform methods for circle findingPublished by Elsevier ,2003
- Multidimensional curve fitting to unorganized data points by nonlinear minimizationComputer-Aided Design, 1995
- Fitting a second degree curve in the presence of errorPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1995
- Accurate parameter estimation of quadratic curves from grey-level imagesCVGIP: Image Understanding, 1991
- Algorithm for finding the center of circular fiducialsComputer Vision, Graphics, and Image Processing, 1990
- Fitting ellipses and predicting confidence envelopes using a bias corrected Kalman filterImage and Vision Computing, 1990
- Estimation of a circular arc center and its radiusComputer Vision, Graphics, and Image Processing, 1987
- 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
- The measurement of circularity and ellipticity on a digital gridPattern Recognition, 1982