Detection and comparison of Proliferative Diabetic Retinopathy using Watershed Algorithm and K-Means Clustering Algorithm

被引:1
|
作者
Naz, Farheen [1 ]
Rani, Jenila D. [1 ]
Rajakumari, R. [2 ]
机构
[1] Saveetha Univ, Saveetha Inst Med & Tech Sci, Saveetha Sch Engn, Dept Biomed Engn, Chennai 602105, Tamil Nadu, India
[2] Saveetha Univ, Saveetha Inst Med & Tech Sci, Saveetha Sch Engn, Dept English & Commun Studies, Chennai 602105, Tamil Nadu, India
来源
CARDIOMETRY | 2022年 / 25期
关键词
Innovative Proliferative Diabetic Retinopathy Detection; Machine Learning; Watershed Algorithm; K-Means Clustering Algorithm; MATLAB Programming; Peak Signal to Noise Ratio (PSNR);
D O I
10.18137/cardiometry.2022.25.852857
中图分类号
R446 [实验室诊断]; R-33 [实验医学、医学实验];
学科分类号
1001 ;
摘要
Aim: The aim of this research work is for the presence of Innovative Proliferative Diabetic Retinopathy Detection, using modern algorithms, and comparing the Peak Signal to Noise Ratio (PSNR) between Watershed Algorithms and K-Means Clustering Algorithm. Materials and methods: The sample images were taken from kaggle's website. Samples were considered as (N=24) for Watershed Algorithm and (N=24) for K-means clustering algorithm in accordance with total sample size calculated using clinicalc.com by keeping alpha error-threshold value 0.05, enrollment ratio as 0.1, 95% confidence interval, G power as 80%. The PSNR was calculated by using the MATLAB Programming with a standard data set. Results: Comparison of PSNR is done by independent sample test using SPSS software. There is a statistical significant difference between Watershed Algorithm and K-means clustering algorithm with p<0.001, p<0.05 (PSNR=10.8205) using Watershed Algorithm showed better results in comparison to K-Means Clustering Algorithm (PSNR=9.7350). Conclusion: Watershed Algorithms were found to give higher PSNR than in K-Means Clustering Algorithms for the Innovative Proliferative Diabetic Retinopathy Detection.
引用
收藏
页码:852 / 857
页数:6
相关论文
共 50 条
  • [1] Detection and comparison of Diabetic Maculopathy using C-Means Clustering Algorithm and Watershed Algorithm
    Naz, Farheen
    Rani, Jenila D.
    Rajakumari, R.
    CARDIOMETRY, 2022, (25): : 845 - 851
  • [2] Detection and comparison of Diabetic Glaucoma using K-means Algorithm and Thresholding Algorithm
    Naz, Farheen
    Rani, Jenila D.
    CARDIOMETRY, 2022, (25): : 858 - 864
  • [3] Detection and Comparison of Diabetic Retinopathy using Thresholding Algorithm and C- Means Clustering Algorithm
    Naz, Farheen
    JenilaRani, D.
    JOURNAL OF PHARMACEUTICAL NEGATIVE RESULTS, 2022, 13 : 203 - 209
  • [4] Detection and Comparison of Diabetic Retinopathy using Thresholding Algorithm and C-Means Clustering Algorithm
    Naz, Farheen
    JenilaRani, D.
    JOURNAL OF PHARMACEUTICAL NEGATIVE RESULTS, 2022, 13 : 203 - 209
  • [5] Comparison and Detection Analysis of Network Traffic Datasets Using K-Means Clustering Algorithm
    Al-Sanjary, Omar Ismael
    Bin Roslan, Muhammad Aiman
    Helmi, Rabab Alayham Abbas
    Ahmed, Ahmed Abdullah
    JOURNAL OF INFORMATION & KNOWLEDGE MANAGEMENT, 2020, 19 (03)
  • [6] Improving Intrusion Detection Using PCA And K-Means Clustering Algorithm
    Khaoula, Radi
    Mohamed, Moughit
    2022 9TH INTERNATIONAL CONFERENCE ON WIRELESS NETWORKS AND MOBILE COMMUNICATIONS, WINCOM, 2022, : 19 - 23
  • [7] An Efficient Global K-means Clustering Algorithm
    Xie, Juanying
    Jiang, Shuai
    Xie, Weixin
    Gao, Xinbo
    JOURNAL OF COMPUTERS, 2011, 6 (02) : 271 - 279
  • [8] Research on Improved K-means Clustering Algorithm
    Zhang, Yinsheng
    Shan, Huilin
    Li, Jiaqiang
    Zhou, Jie
    MEMS, NANO AND SMART SYSTEMS, PTS 1-6, 2012, 403-408 : 1977 - 1980
  • [9] Detection of Ginseng Leaf Cicatrices Base on K-means Clustering Algorithm
    Liu, Yuan-yuan
    Zhou, Shi-yu
    Sun, Jia-hui
    2017 10TH INTERNATIONAL CONGRESS ON IMAGE AND SIGNAL PROCESSING, BIOMEDICAL ENGINEERING AND INFORMATICS (CISP-BMEI), 2017,
  • [10] The new k-windows algorithm for improving the k-means clustering algorithm
    Vrahatis, MN
    Boutsinas, B
    Alevizos, P
    Pavlides, G
    JOURNAL OF COMPLEXITY, 2002, 18 (01) : 375 - 391