Efficient computation of the Gauss-Newton direction when fitting NURBS using ODR |
| |
Authors: | Per Bergström Ove Edlund Inge Söderkvist |
| |
Affiliation: | 1.Department of Engineering Sciences and Mathematics,Lule? University of Technology,Lule?,Sweden |
| |
Abstract: | We consider a subproblem in parameter estimation using the Gauss-Newton algorithm with regularization for NURBS curve fitting. The NURBS curve is fitted to a set of data points in least-squares sense, where the sum of squared orthogonal distances is minimized. Control-points and weights are estimated. The knot-vector and the degree of the NURBS curve are kept constant. In the Gauss-Newton algorithm, a search direction is obtained from a linear overdetermined system with a Jacobian and a residual vector. Because of the properties of our problem, the Jacobian has a particular sparse structure which is suitable for performing a splitting of variables. We are handling the computational problems and report the obtained accuracy using different methods, and the elapsed real computational time. The splitting of variables is a two times faster method than using plain normal equations. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|