DocumentCode
2330629
Title
Robust fitting of ellipses with heuristics
Author
De la Fraga, Luis Gerardo ; Domínguez, Gustavo M López
Author_Institution
Comput. Sci. Dept., Mexico City, Mexico
fYear
2010
fDate
18-23 July 2010
Firstpage
1
Lastpage
8
Abstract
In this paper we solve the problem of robust fitting of ellipses to a set of points under condition of very high noise (when more than 50% of the points are outliers), using the sum of the orthogonal distances (instead of the sum of the squares of the distances) from the given points to the fitted ellipse. The fitting problem now is nonlinear and is solved using Differential Evolution. We demonstrate by simulations that one or several ellipses can be extracted from the data set of points. The proposed method is compared with the least median of squares solved with RANSAC.
Keywords
computational geometry; curve fitting; evolutionary computation; RANSAC; differential evolution; ellipses fitting; least median of squares method; Equations; Fitting; Least squares approximation; Mathematical model; Minimization; Noise; Robustness; Differential Evolution; Ellipse Fitting; Euclidean Distance Fit; RANSAC; Robust Fitting;
fLanguage
English
Publisher
ieee
Conference_Titel
Evolutionary Computation (CEC), 2010 IEEE Congress on
Conference_Location
Barcelona
Print_ISBN
978-1-4244-6909-3
Type
conf
DOI
10.1109/CEC.2010.5586304
Filename
5586304
Link To Document