Ellipse Fitting of Planar Points With Outliers Using Random Samples Filtered by Fitting Qualities

ABSTRACT Ellipse fitting is a traditional approach to construct elliptical models from points. Outliers can significantly distort a fittied ellipse from the actual model. A novel ellipse fitting algorithm is proposed to be applied to planar points with outliers. The fitting qualities of candidate ellipses generated by five‐point random sampling are evaluated, and the median curve of the best fittings yields the final result through a classic fitting algorithm. A fitting error metric is introduced. The proposed algorithm achieved median fitting errors of 0.067 on a synthetic dataset and 0.057 on an image dataset, respectively, both the best among the algorithms compared. The execution speed of the novel algorithm is on average 0.091 s on the synthetic dataset and 0.087 s on the image dataset. The algorithm is advantageous also for use due to the comprehensibility and insensitivity of the algorithmic parameters.

Authors

Institutions

Publication Details

Journal
IET Image Processing
Published
2025-01-01
DOI
https://doi.org/10.1049/ipr2.70167
Primary Topic
Image and Object Detection Techniques
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Ellipse Fitting of Planar Points With Outliers Using Random Samples Filtered by Fitting Qualities

Xin Li, Qi Zeng, Siyu Guo
IET Image Processing
Image and Object Detection Techniques
article

Ellipse Fitting of Planar Points With Outliers Using Random Samples Filtered by Fitting Qualities

Xin Li, Qi Zeng, Siyu Guo
article en

Abstract

ABSTRACT Ellipse fitting is a traditional approach to construct elliptical models from points. Outliers can significantly distort a fittied ellipse from the actual model. A novel ellipse fitting algorithm is proposed to be applied to planar points with outliers. The fitting qualities of candidate ellipses generated by five‐point random sampling are evaluated, and the median curve of the best fittings yields the final result through a classic fitting algorithm. A fitting error metric is introduced. The proposed algorithm achieved median fitting errors of 0.067 on a synthetic dataset and 0.057 on an image dataset, respectively, both the best among the algorithms compared. The execution speed of the novel algorithm is on average 0.091 s on the synthetic dataset and 0.087 s on the image dataset. The algorithm is advantageous also for use due to the comprehensibility and insensitivity of the algorithmic parameters.

IET Image ProcessingVol. 19(1)
Hunan University (CN)
National Natural Science Foundation of China
Openalex Percentile: Top 84%
Image and Object Detection Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.