AN UNCONSTRAINED ELLIPSE FITTING TECHNIQUE AND APPLICATION TO OPTIC CUP SEGMENTATION

Harsha Sridhar, J. Kumar, S. Jois, C. Seelamantula
{"title":"AN UNCONSTRAINED ELLIPSE FITTING TECHNIQUE AND APPLICATION TO OPTIC CUP SEGMENTATION","authors":"Harsha Sridhar, J. Kumar, S. Jois, C. Seelamantula","doi":"10.1109/GlobalSIP.2018.8646446","DOIUrl":null,"url":null,"abstract":"We present a novel method for fitting an ellipse to scattered data based on least-squares minimization. The new technique has several advantages over the standard ellipse fitting techniques. For one, it is constraint-free and computationally inexpensive thus making it easy to implement. Also, despite the absence of constraints, execution of the model always results in an ellipse fit. Additionally, the model results in a singular solution for a given set of datapoints. The proposed model is compared with standard techniques and shown to have the ability to fit an accurate ellipse even when other methods either fail to be ellipse-specific or take up excessive computation time for execution. An application to the problem of segmentation of the optic cup in retinal fundus images, is also presented. Experimental validation and performance comparisons show that the proposed technique is competitive with the state-of-the-art methods.","PeriodicalId":119131,"journal":{"name":"2018 IEEE Global Conference on Signal and Information Processing (GlobalSIP)","volume":"247 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE Global Conference on Signal and Information Processing (GlobalSIP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GlobalSIP.2018.8646446","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

We present a novel method for fitting an ellipse to scattered data based on least-squares minimization. The new technique has several advantages over the standard ellipse fitting techniques. For one, it is constraint-free and computationally inexpensive thus making it easy to implement. Also, despite the absence of constraints, execution of the model always results in an ellipse fit. Additionally, the model results in a singular solution for a given set of datapoints. The proposed model is compared with standard techniques and shown to have the ability to fit an accurate ellipse even when other methods either fail to be ellipse-specific or take up excessive computation time for execution. An application to the problem of segmentation of the optic cup in retinal fundus images, is also presented. Experimental validation and performance comparisons show that the proposed technique is competitive with the state-of-the-art methods.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
无约束椭圆拟合技术及其在光学杯分割中的应用
提出了一种基于最小二乘最小化的椭圆拟合方法。与标准的椭圆拟合方法相比,该方法具有许多优点。首先,它不受约束,计算成本低,因此易于实现。此外,尽管没有约束,模型的执行总是导致椭圆拟合。此外,对于给定的一组数据点,该模型的结果是奇异解。将所提出的模型与标准技术进行了比较,结果表明,即使其他方法不能特定于椭圆或占用过多的计算时间来执行,该模型也能够拟合出精确的椭圆。并给出了在视网膜眼底图像中光学杯分割问题的应用。实验验证和性能比较表明,所提出的技术与最先进的方法具有竞争力。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
ADAPTIVE CSP FOR USER INDEPENDENCE IN MI-BCI PARADIGM FOR UPPER LIMB STROKE REHABILITATION SPATIAL FOURIER TRANSFORM FOR DETECTION AND ANALYSIS OF PERIODIC ASTROPHYSICAL PULSES CNN ARCHITECTURES FOR GRAPH DATA OVERT SPEECH RETRIEVAL FROM NEUROMAGNETIC SIGNALS USING WAVELETS AND ARTIFICIAL NEURAL NETWORKS CNN BASED RICIAN K FACTOR ESTIMATION FOR NON-STATIONARY INDUSTRIAL FADING CHANNEL
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1