Statistical efficiency of curve fitting algorithms
| dc.creator | Chernov, N. | |
| dc.creator | Lesort, C. | |
| dc.date | 2003-03-18 | |
| dc.date.accessioned | 2026-07-07T03:19:31Z | |
| dc.date.available | 2026-07-07T03:19:31Z | |
| dc.description | 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. | |
| dc.description | 17 pages, 3 figures | |
| dc.identifier | https://arxiv.org/abs/cs/0303015 | |
| dc.identifier | http://arxiv.org/abs/cs/0303015 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/31492 | |
| dc.subject | Computer Vision and Pattern Recognition | |
| dc.subject | I.4.8;I.5.1;I.2.10;G.3;G.1.2 | |
| dc.title | Statistical efficiency of curve fitting algorithms | |
| dc.type | text |