Direct ellipse fitting by minimizing the L0 algebraic distance

Gang Zhou, Zhenghui Hu, Xiaolei Chen, Qingjie Liu
{"title":"Direct ellipse fitting by minimizing the L0 algebraic distance","authors":"Gang Zhou, Zhenghui Hu, Xiaolei Chen, Qingjie Liu","doi":"10.1109/ICCECE58074.2023.10135531","DOIUrl":null,"url":null,"abstract":"Given a set of 2D scattering points from an edge detection operator, the aim of ellipse fitting is to construct an elliptic equation that best fit the observations. For the data collected often contain noisy, uncertainty, and incompleteness which constitutes a considerable challenge for all algorithms. To address this issue, a method of direct ellipse fitting by minimizing the L0 algebraic distance is presented. Unlike its L2 counterparts that assumed the fitting error follows a Gaussian distribution, our method tried to model the outliers using the L0 norm of the algebraic distance between the ideal elliptic equation and its fitting data. In addition, an efficient numerical algorithm based on alternating optimization strategy with half-quadratic splitting is developed to solve the resulting L0 minimization problem and a detailed research of the selection of algorithm parameters is carried out benefit from which it does not suffer from the convergence issues due to poor initialization, which is an open question encountered in all iterative based approaches. Numerical experiments suggest that the proposed method achieves a very high precision and reliability to various bias especially for Non-Gaussian artifacts as well as easy to implement.","PeriodicalId":120030,"journal":{"name":"2023 3rd International Conference on Consumer Electronics and Computer Engineering (ICCECE)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-01-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2023 3rd International Conference on Consumer Electronics and Computer Engineering (ICCECE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCECE58074.2023.10135531","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Given a set of 2D scattering points from an edge detection operator, the aim of ellipse fitting is to construct an elliptic equation that best fit the observations. For the data collected often contain noisy, uncertainty, and incompleteness which constitutes a considerable challenge for all algorithms. To address this issue, a method of direct ellipse fitting by minimizing the L0 algebraic distance is presented. Unlike its L2 counterparts that assumed the fitting error follows a Gaussian distribution, our method tried to model the outliers using the L0 norm of the algebraic distance between the ideal elliptic equation and its fitting data. In addition, an efficient numerical algorithm based on alternating optimization strategy with half-quadratic splitting is developed to solve the resulting L0 minimization problem and a detailed research of the selection of algorithm parameters is carried out benefit from which it does not suffer from the convergence issues due to poor initialization, which is an open question encountered in all iterative based approaches. Numerical experiments suggest that the proposed method achieves a very high precision and reliability to various bias especially for Non-Gaussian artifacts as well as easy to implement.
通过最小化L0代数距离的直接椭圆拟合
给定一组来自边缘检测算子的二维散射点,椭圆拟合的目的是构造一个最适合观测值的椭圆方程。因为所收集的数据通常包含噪声、不确定性和不完整性,这对所有算法都构成了相当大的挑战。为了解决这一问题,提出了一种最小化L0代数距离的直接椭圆拟合方法。与假设拟合误差遵循高斯分布的L2对应方法不同,我们的方法试图使用理想椭圆方程与其拟合数据之间的代数距离的L0范数来建模异常值。此外,提出了一种基于半二次分裂交替优化策略的高效数值算法来解决由此产生的L0最小化问题,并对算法参数的选择进行了详细的研究,从而避免了所有基于迭代的方法都会遇到的由于初始化差而导致的收敛问题。数值实验表明,该方法对各种偏差特别是非高斯伪像具有很高的精度和可靠性,且易于实现。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信