Non-invasive Dry Eye detection using Fuzzy c-means Clustering Algorithm

IF 1.3 4区 医学 Q4 MEDICINE, RESEARCH & EXPERIMENTAL
I.Ch, ra, N.Prabhakaran, V.Prabhu, S.Harshavardhan, N.Duraichi
{"title":"Non-invasive Dry Eye detection using Fuzzy c-means Clustering Algorithm","authors":"I.Ch, ra, N.Prabhakaran, V.Prabhu, S.Harshavardhan, N.Duraichi","doi":"10.35841/0970-938X.S1-S5","DOIUrl":null,"url":null,"abstract":"The background includes the study area of the dry eye taken from 75 patients to analyze eye-related disease. This method suggested as earlier detection of eye detection and tries to diagnose the problem. Early detection of eye problem helps the patient to have a clear line of sight distance through fuzzy c means clustering algorithm.The tear film must be detected at an early stage to protect the person from death. The tear film should be a monitor at the initial stage and diagnose by the unique technique, whether it may be the invasive or non-invasive method of dry detection. The invasive approach is the time-consuming process, and many disadvantages in this method arise in tear film detection. The non- invasive technique is not said to be a slow process. So the author proposed the novel approach of tear film detection by fuzzy c means clustering algorithm. The sample of eye images are taken and processed with fuzzy c means clustering algorithm and finds the intensity in both the eye. The accuracy analysis carried by fuzzy c indicates a clustering algorithm of 82% in its efficiency.","PeriodicalId":9138,"journal":{"name":"Biomedical Research-tokyo","volume":null,"pages":null},"PeriodicalIF":1.3000,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Biomedical Research-tokyo","FirstCategoryId":"3","ListUrlMain":"https://doi.org/10.35841/0970-938X.S1-S5","RegionNum":4,"RegionCategory":"医学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MEDICINE, RESEARCH & EXPERIMENTAL","Score":null,"Total":0}
引用次数: 0

Abstract

The background includes the study area of the dry eye taken from 75 patients to analyze eye-related disease. This method suggested as earlier detection of eye detection and tries to diagnose the problem. Early detection of eye problem helps the patient to have a clear line of sight distance through fuzzy c means clustering algorithm.The tear film must be detected at an early stage to protect the person from death. The tear film should be a monitor at the initial stage and diagnose by the unique technique, whether it may be the invasive or non-invasive method of dry detection. The invasive approach is the time-consuming process, and many disadvantages in this method arise in tear film detection. The non- invasive technique is not said to be a slow process. So the author proposed the novel approach of tear film detection by fuzzy c means clustering algorithm. The sample of eye images are taken and processed with fuzzy c means clustering algorithm and finds the intensity in both the eye. The accuracy analysis carried by fuzzy c indicates a clustering algorithm of 82% in its efficiency.
基于模糊c均值聚类算法的无创干眼检测
背景包括75例干眼患者的干眼研究区域,以分析眼相关疾病。这种方法建议早期检测眼睛,并试图诊断问题。通过模糊c均值聚类算法,早期发现眼部问题,帮助患者获得清晰的视线距离。必须在早期阶段检测到泪膜,以保护人免于死亡。泪膜应作为初期的监测,通过独特的技术进行诊断,无论是有创还是无创的干法检测。有创入路是一个耗时的过程,并且在泪膜检测中出现了许多缺点。这种非侵入性技术并不是一个缓慢的过程。为此,作者提出了一种基于模糊c均值聚类算法的泪膜检测新方法。采用模糊c均值聚类算法对眼睛图像样本进行处理,得到两眼的灰度值。模糊c进行的准确率分析表明,聚类算法的效率为82%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Biomedical Research-tokyo
Biomedical Research-tokyo 医学-医学:研究与实验
CiteScore
2.40
自引率
0.00%
发文量
19
审稿时长
>12 weeks
期刊介绍: Biomedical Research is peer-reviewed International Research Journal . It was first launched in 1990 as a biannual English Journal and later became triannual. From 2008 it is published in Jan-Apr/ May-Aug/ Sep-Dec..
×
引用
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学术官方微信