Improved Ellipse Fitting Algorithm with Outlier Removal

Outliers can significantly affect the results of ellipse fitting. Aiming at this problem, an improved ellipse fitting algorithm based on truncated least squares method and two methods based on double point removal are proposed. The truncated least squares method starts with random sampling , in each...

Full description

Saved in:
Bibliographic Details
Published inJi suan ji ke xue Vol. 49; no. 4; pp. 188 - 194
Main Authors Guo, Si-yu, Wu, Yan-dong
Format Journal Article
LanguageChinese
Published Chongqing Guojia Kexue Jishu Bu 01.04.2022
Editorial office of Computer Science
Subjects
Online AccessGet full text

Cover

Loading…
Abstract Outliers can significantly affect the results of ellipse fitting. Aiming at this problem, an improved ellipse fitting algorithm based on truncated least squares method and two methods based on double point removal are proposed. The truncated least squares method starts with random sampling , in each iteration, the data point with the smallest current fitting residual is selected as the fitted point set in the next iteration, and finally converges to the fitting result of the non-outlier points occupying the main body of the point set; double point removal The rule starts from the complete set of points to be fitted, and removes a pair of data points whose fitting residuals are the maximum positive and negative values ​​each time until the number of remaining points does not exceed a given ratio. On the image set of the actual part, for The proposed three algorithms and the existing comparison algorithms are tested. The results show that when the number of retained ellipse points is small, the two algorithms b
AbstractList Outliers can significantly affect the results of ellipse fitting. Aiming at this problem, an improved ellipse fitting algorithm based on truncated least squares method and two methods based on double point removal are proposed. The truncated least squares method starts with random sampling , in each iteration, the data point with the smallest current fitting residual is selected as the fitted point set in the next iteration, and finally converges to the fitting result of the non-outlier points occupying the main body of the point set; double point removal The rule starts from the complete set of points to be fitted, and removes a pair of data points whose fitting residuals are the maximum positive and negative values ​​each time until the number of remaining points does not exceed a given ratio. On the image set of the actual part, for The proposed three algorithms and the existing comparison algorithms are tested. The results show that when the number of retained ellipse points is small, the two algorithms b
The results of ellipse fitting can be considerably distorted by outliers in the fitted point set.To tackle this problem, three improved ellipse fitting algorithms, one of which is based on least trimmed square, and the other two on dual point removal, are proposed.The least trimmed square algorithm starts from a random sample of the original complete fitted set, and then in each iteration, new fitted set is formed by points with the least residual errors, till the process converges to an ellipse fitting a subset whose members are mostly non-outliers.Dual point removal algorithms, on the other hand, starts from the whole fitted set, removes the two points respectively with the maximal positive and the minimal negative residual errors, and halts when the number of points in the remaining set does not exceeds a user-defined threshold.The two proposed algorithms and existing methods are compared on an image base of actual accessories.Experimental results show that when the number of reserved ellipse points is rel
Author Guo, Si-yu
Wu, Yan-dong
Author_xml – sequence: 1
  givenname: Si-yu
  surname: Guo
  fullname: Guo, Si-yu
– sequence: 2
  givenname: Yan-dong
  surname: Wu
  fullname: Wu, Yan-dong
BookMark eNotj89LwzAcxXOY4Jy7eyx47syvpslxjE0Hg4Hs4K2kyTcztW1m2k397w1OHny_8OB9eO8OTfrQA0IPBC8IkUo8NUPz8b2gBFOMMccTNCUY05yw8u0WzYfB15gywZPIFJXb7hTDBWy2blt_GiDb-HH0_TFbtscQ_fjeZV_pZvvz2HqI2St04aLbe3TjdDvA_P_P0GGzPqxe8t3-ebta7nKrOMsL7cAYXghVpi61kk5IIYzUGDNKDIA1BjtLJNG1AseVtFRCASmHcYqwGdpesTbopjpF3-n4UwXtqz8jxGOl4-hNC5XRNbC6diXXmkuhtXFMF6V1FgpSW55Yj1dWGvx5hmGsmnCOfWpfUVEoqkquGPsFgiFjyQ
ContentType Journal Article
Copyright Copyright Guojia Kexue Jishu Bu 2022
Copyright_xml – notice: Copyright Guojia Kexue Jishu Bu 2022
DBID 7SC
8FD
JQ2
L7M
L~C
L~D
DOA
DOI 10.11896/jsjkx.210200040
DatabaseName Computer and Information Systems Abstracts
Technology Research Database
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
DOAJ
DatabaseTitle Computer and Information Systems Abstracts
Technology Research Database
Computer and Information Systems Abstracts – Academic
Advanced Technologies Database with Aerospace
ProQuest Computer Science Collection
Computer and Information Systems Abstracts Professional
DatabaseTitleList Computer and Information Systems Abstracts

Database_xml – sequence: 1
  dbid: DOA
  name: DOAJ Directory of Open Access Journals
  url: https://www.doaj.org/
  sourceTypes: Open Website
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EndPage 194
ExternalDocumentID oai_doaj_org_article_cabe3bbf74aa486aacf3a57dfde51bd4
GroupedDBID -0Y
5XA
5XJ
7SC
8FD
92H
92I
ACGFS
ALMA_UNASSIGNED_HOLDINGS
CCEZO
CUBFJ
CW9
GROUPED_DOAJ
JQ2
L7M
L~C
L~D
TCJ
TGT
U1G
U5S
ID FETCH-LOGICAL-d943-5afecc45697000b98f6866c8a00321ceedcc0fd181ab9ef498d28e5e5af007003
IEDL.DBID DOA
ISSN 1002-137X
IngestDate Tue Oct 22 15:08:58 EDT 2024
Thu Oct 10 20:27:35 EDT 2024
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed false
IsScholarly true
Issue 4
Language Chinese
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-d943-5afecc45697000b98f6866c8a00321ceedcc0fd181ab9ef498d28e5e5af007003
OpenAccessLink https://doaj.org/article/cabe3bbf74aa486aacf3a57dfde51bd4
PQID 2659297493
PQPubID 2048282
PageCount 7
ParticipantIDs doaj_primary_oai_doaj_org_article_cabe3bbf74aa486aacf3a57dfde51bd4
proquest_journals_2659297493
PublicationCentury 2000
PublicationDate 2022-04-01
PublicationDateYYYYMMDD 2022-04-01
PublicationDate_xml – month: 04
  year: 2022
  text: 2022-04-01
  day: 01
PublicationDecade 2020
PublicationPlace Chongqing
PublicationPlace_xml – name: Chongqing
PublicationTitle Ji suan ji ke xue
PublicationYear 2022
Publisher Guojia Kexue Jishu Bu
Editorial office of Computer Science
Publisher_xml – name: Guojia Kexue Jishu Bu
– name: Editorial office of Computer Science
SSID ssib023646461
ssib051375750
ssib001164759
ssj0057673
Score 2.313826
Snippet Outliers can significantly affect the results of ellipse fitting. Aiming at this problem, an improved ellipse fitting algorithm based on truncated least...
The results of ellipse fitting can be considerably distorted by outliers in the fitted point set.To tackle this problem, three improved ellipse fitting...
SourceID doaj
proquest
SourceType Open Website
Aggregation Database
StartPage 188
SubjectTerms Accuracy
Algorithms
Data points
ellipse fitting|ellipse detection|least trimmed square|dual point removal|vision-based measurement
Elliptic fitting
Least squares method
Matching
Outliers (statistics)
Parameter sensitivity
Random sampling
Run time (computers)
Title Improved Ellipse Fitting Algorithm with Outlier Removal
URI https://www.proquest.com/docview/2659297493
https://doaj.org/article/cabe3bbf74aa486aacf3a57dfde51bd4
Volume 49
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV07T8MwELZQJxbeiEJBHlhDk_g9FtSqQgIkVKRukR3btIW2qE0lxK_nnIeoxMDCkiGRleTO5_vufP4OoeuUOQOO1URUUBpR7kwkIbSNUoC_BAAEQISQh3x45MMXej9m461WX6EmrKIHrgTXzbVxxBgvqNZUcq1zTzQT1lvHEmMrJtBYbQVTJRAINFk_jjqwpPMt4jSWEAE4JW7WbADdoirFD60-iBg3G5pS8e5sPXv7vAmhUQBAcU3u_2vtLh3S4ADt1UgS96o_OEQ7X5MjtN90acC10R4jUeUNnMX9Mu_v8GBaFjvj3vvrcjUtJnMcsrH4aVMAIF3hZzdfwvw7QaNBf3Q3jOp2CZFVlERMe1AH4CEl4DuNkp5LznOpwW7TJPjCPI-9BY-ujXKeKmlT6ZiDcYHzJyanqLVYLtwZwiI3zBqn4CF4cMtB3gkMpUYouHLeRrdBBNlHRYiRBYrq8gYoLqsVl_2luDbqNALMartZZ2nY5YUQR5Hz_3jHBdpNw3GFstKmg1rFauMuAUQU5qqcL9-8S8G8
link.rule.ids 315,783,787,867,2109,27938,27939
linkProvider Directory of Open Access Journals
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Improved+Ellipse+Fitting+Algorithm+with+Outlier+Removal&rft.jtitle=Ji+suan+ji+ke+xue&rft.au=Guo%2C+Si-yu&rft.au=Wu%2C+Yan-dong&rft.date=2022-04-01&rft.pub=Guojia+Kexue+Jishu+Bu&rft.issn=1002-137X&rft.volume=49&rft.issue=4&rft.spage=188&rft_id=info:doi/10.11896%2Fjsjkx.210200040&rft.externalDBID=NO_FULL_TEXT
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1002-137X&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1002-137X&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1002-137X&client=summon