Efficient computation of the Gauss-Newton direction when fitting NURBS using ODR
DOI10.1007/s10543-012-0371-7zbMath1255.65039OpenAlexW2067693391MaRDI QIDQ1759585
Ove Edlund, Per Bergström, Inge Söderkvist
Publication date: 21 November 2012
Published in: BIT (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10543-012-0371-7
algorithmJacobianparameter estimationregularizationnumerical examplesleast-squarescurve fittingGauss-NewtonLevenberg-Marquardtlinear overdetermined systemnonuniform rational \(B\)-splinesorthogonal distance regression (ODR)block angular formNURBS fitting
Numerical computation using splines (65D07) Numerical smoothing, curve fitting (65D10) Numerical solutions to overdetermined systems, pseudoinverses (65F20)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A full-Newton approach to separable nonlinear least squares problems and its application to discrete least squares rational approximation
- Global reparametrization for curve approximation
- Optimization of a NURBS representation
- A class of methods for fitting a curve or surface to data by minimizing the sum of squares of orthogonal distances.
- Total least squares fitting of Bézier and B-spline curves to ordered data
- Parametrization of randomly measured points for least squares fitting of \(B\)-spline curves and surfaces
- Sparse Matrices in MATLAB: Design and Implementation
- Algorithm 676: ODRPACK: software for weighted orthogonal distance regression
- Unitary Triangularization of a Nonsymmetric Matrix
This page was built for publication: Efficient computation of the Gauss-Newton direction when fitting NURBS using ODR