Statistical efficiency of curve fitting algorithms
From MaRDI portal
Abstract: We study the problem of fitting parametrized curves to noisy data. Under certain assumptions (known as Cartesian and radial functional models), we derive asymptotic expressions for the bias and the covariance matrix of the parameter estimates. We also extend Kanatani's version of the Cramer-Rao lower bound, which he proved for unbiased estimates only, to more general estimates that include many popular algorithms (most notably, the orthogonal least squares and algebraic fits). We then show that the gradient-weighted algebraic fit is statistically efficient and describe all other statistically efficient algebraic fits.
Recommendations
- Parameter estimation techniques: a tutorial with application to conic fitting
- On the complexity of curve fitting algorithms
- Fitting data in the plane by algebraic curves in parametric representation
- Statistical optimization for geometric fitting: theoretical accuracy bound and high order error analysis
- scientific article; zbMATH DE number 696784
Cites work
- scientific article; zbMATH DE number 1001849 (Why is no real title available?)
- scientific article; zbMATH DE number 4020222 (Why is no real title available?)
- scientific article; zbMATH DE number 3759341 (Why is no real title available?)
- scientific article; zbMATH DE number 1058100 (Why is no real title available?)
- scientific article; zbMATH DE number 918862 (Why is no real title available?)
- scientific article; zbMATH DE number 3216800 (Why is no real title available?)
- Cramer-Rao Lower Bounds for Estimation of a Circular Arc Center and Its Radius
- Heteroscedastic regression in computer vision: Problems with bilinear constraint
- Least-squares fitting by circles
- Least-squares fitting of circles and ellipses
- Least-squares orthogonal distances fitting of circle, sphere, ellipse, hyperbola, and parabola
- Rationalising the renormalisation method of Kanatani
Cited in
(25)- Constrained Cramér-Rao lower bound in errors-in variables (EIV) models: revisited
- A comparative study for two newly developed estimators for the slope in the functional EIV linear model
- Does the best-fitting curve always exist?
- Semi-doubly optimal concentric circles fitting with presence of heteroscedasticity
- Second-order performance analysis and unbiased estimation for the fitting of concentric circles
- Parameter estimation techniques: a tutorial with application to conic fitting
- scientific article; zbMATH DE number 1414614 (Why is no real title available?)
- A doubly optimal ellipse fit
- Detection and counting of flowers based on digital images using computer vision and a concave point detection technique
- On the convergence of fitting algorithms in computer vision
- Is the best fitting curve always unique?
- Fitting circles to data with correlated noise
- A New Perspective in Functional EIV Linear Models: Part II
- A new approach to statistical efficiency of weighted least squares fitting algorithms for reparameterization of nonlinear regression models
- Fitting circles to scattered data: parameter estimates have no moments
- On the complexity of curve fitting algorithms
- Statistical analysis of curve fitting methods in errors-in-variables models
- Fast and numerically stable circle fit
- Statistical optimization for geometric fitting: theoretical accuracy bound and high order error analysis
- Further statistical analysis of circle fitting
- Guaranteed ellipse fitting with a confidence region and an uncertainty measure for centre, axes, and orientation
- Error analysis for circle fitting algorithms
- Unified computation of strict maximum likelihood for geometric fitting
- Performance evaluation of iterative geometric fitting algorithms
- Hyper least squares fitting of circles and ellipses
This page was built for publication: Statistical efficiency of curve fitting algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q957048)
