Title :
An Algorithm for Circle Curve Fitting Based on the Constrained Least Square Model Represented by Mosaic Observation Points
Author :
Hu Juan-li ; Deng Jia-bin ; Hu Chang
Author_Institution :
Comput. Eng. Dept., Zhongshan Polytech., Zhongshan, China
Abstract :
In the application of engineering technology, a certain number of disturbed observation points with errors are often used to fit a plane circle. Considering the distribution characteristics of these points, two kinds of models are presented in this paper: an unconstrained non-linear least square model and a non-linear least square model constrained by the mosaic center coordinates for the plane circle fitting. The lsqnonlin function for nonlinear least square algorithm is applied to work out the unconstrained least square model. The searching method is adopted to figure out the constrained model by analyzing the symmetry of simulated data, determining the initial value for searching and simplifying the solving process. By contrasting the two fitting results, it is obvious that the constrained least square model can successfully simplify the computation with higher accuracy. Furthermore, this algorithm can also be used for the computation of spherical centers and radii in the three-dimensional space.
Keywords :
computational geometry; curve fitting; least squares approximations; circle curve fitting; constrained least square model; disturbed observation points; mosaic center coordinates; mosaic observation points; plane circle fitting; searching method; unconstrained nonlinear least square model; Analytical models; Approximation algorithms; Computational modeling; Computer errors; Curve fitting; Distributed computing; Iterative algorithms; Least squares approximation; Least squares methods; Testing;
Conference_Titel :
Wireless Communications, Networking and Mobile Computing, 2009. WiCom '09. 5th International Conference on
Conference_Location :
Beijing
Print_ISBN :
978-1-4244-3692-7
Electronic_ISBN :
978-1-4244-3693-4
DOI :
10.1109/WICOM.2009.5302849