.png){kind=icon}
.png){kind=icon}
Return
Constrained quadratic errors-in-variables fitting
.png){kind=icon}
PRE
AI
DOI：10.1007/s00371-013-0885-2.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We propose an estimation method to fit conics and quadrics to data in the context of errors-in-variables where the fit is subject to constraints. The proposed algorithm is based on algebraic distance minimization and consists of solving a few generalized eigenvalue (or singular value) problems and is not iterative. Nonetheless, the algorithm produces accurate estimates, close to those obtained with maximum likelihood, while the constraints are also guaranteed to be satisfied. Important special cases, fitting ellipses, hyperbolas, parabolas, and ellipsoids to noisy data are discussed.
Keywords:
Parameter estimation
Direct methods
Fitting with constraints
Eigenvalue problem
Journal
IF:
2.9
Papers:
4.5K
Citations:
6.5K