OCE-NGC: A neutrosophic graph cut algorithm using optimized clustering estimation algorithm for dermoscopic skin lesion segmentation

被引:15
|
作者
Hawas, Ahmed Refaat [1 ]
Guo, Yanhui [2 ]
Du, Chunlai [3 ]
Polat, Kemal [4 ]
Ashour, Amira S. [1 ]
机构
[1] Tanta Univ, Dept Elect & Elect Commun Engn, Fac Engn, Tanta, Egypt
[2] Univ Illinois, Dept Comp Sci, Springfield, IL 62703 USA
[3] North China Univ Technol, Sch Comp, Beijing, Peoples R China
[4] Abant Izzet Baysal Univ, Dept Elect & Elect Engn, Fac Engn & Architecture, TR-14280 Bolu, Turkey
关键词
Dermoscopic images; Skin lesion; Genetic algorithm; Neutrosophic c-means; Neutrosophic graph cut; GREY WOLF OPTIMIZER; FUZZY;
D O I
10.1016/j.asoc.2019.105931
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Automated skin lesion segmentation is one of the most crucial stages in dermoscopic images based diagnosis. To guarantee efficient unsupervised clustering-based segmentation, a histogram-based clustering estimation (HBCE) algorithm can be used to obtain the initial number of clusters with their corresponding centroids. Accordingly, the present work introduced a novel skin lesion segmentation algorithm, called optimized clustering estimation for neutrosophic graph cut algorithm (OCE-NGC). Firstly, the genetic algorithm (GA) is used to optimize the HBCE procedure by finding its optimal threshold values which are functions of a factor, called beta to be optimized. This optimization process guarantees the optimal determination of the initial number of clusters and their corresponding centroids for further use in the proposed clustering process. Thus, the skin lesion dermoscopic images are then mapped into the neutrosophic set (NS) domain which is computed by the neutrosophic c-means (NCM). The NCM groups the pixels in the dermoscopic images using the pre-determined optimal number of clusters obtained by the optimized HBCE. Finally, a cost function of the graph cut (GC) algorithm is defined in the NS domain for the segmentation process. The experimental results established the superiority of the proposed OCE-NGC approach in comparison with the traditional HBCE with NCM only, the traditional HBCE with the NGC, and the typical GC. In a public dataset, the proposed approach achieved 97.12% and 86.28% average accuracy and average Jaccard (JAC) values, respectively. (C) 2019 Elsevier B.V. All rights reserved.
引用
收藏
页数:13
相关论文
共 39 条
  • [1] An Efficient Image Segmentation Algorithm Using Neutrosophic Graph Cut
    Guo, Yanhui
    Akbulut, Yaman
    Sengur, Abdulkadir
    Xia, Rong
    Smarandache, Florentin
    SYMMETRY-BASEL, 2017, 9 (09):
  • [2] Skin Lesion Segmentation in Dermoscopic Images with Combination of YOLO and GrabCut Algorithm
    Unver, Halil Murat
    Ayan, Enes
    DIAGNOSTICS, 2019, 9 (03)
  • [3] Using neutrosophic graph cut segmentation algorithm for qualified rendering image selection in thyroid elastography video
    Guo Y.
    Jiang S.-Q.
    Sun B.
    Siuly S.
    Şengür A.
    Tian J.-W.
    Health Information Science and Systems, 5 (1)
  • [4] Skin lesion segmentation using k-mean and optimized fire fly algorithm
    Shelly Garg
    Balkrishan Jindal
    Multimedia Tools and Applications, 2021, 80 : 7397 - 7410
  • [5] Skin lesion segmentation using k-mean and optimized fire fly algorithm
    Garg, Shelly
    Jindal, Balkrishan
    MULTIMEDIA TOOLS AND APPLICATIONS, 2021, 80 (05) : 7397 - 7410
  • [6] A novel optimized neutrosophic k-means using genetic algorithm for skin lesion detection in dermoscopy images
    Ashour, Amira S.
    Hawas, Ahmed Refaat
    Guo, Yanhui
    Wahba, Maram A.
    SIGNAL IMAGE AND VIDEO PROCESSING, 2018, 12 (07) : 1311 - 1318
  • [7] A novel optimized neutrosophic k-means using genetic algorithm for skin lesion detection in dermoscopy images
    Amira S. Ashour
    Ahmed Refaat Hawas
    Yanhui Guo
    Maram A. Wahba
    Signal, Image and Video Processing, 2018, 12 : 1311 - 1318
  • [8] Dynamic algorithm for graph clustering using minimum cut tree
    Saha, Barna
    Mitra, Pabitra
    ICDM 2006: SIXTH IEEE INTERNATIONAL CONFERENCE ON DATA MINING, WORKSHOPS, 2006, : 667 - 671
  • [9] Dynamic Algorithm for Graph Clustering Using Minimum Cut Tree
    Saha, Barna
    Mitra, Pabitra
    PROCEEDINGS OF THE SEVENTH SIAM INTERNATIONAL CONFERENCE ON DATA MINING, 2007, : 581 - +
  • [10] Graph Cut and Image Segmentation using Mean Cut by Means of an Agglomerative Algorithm
    Chiba, Elaine Ayumi
    Garcia de Carvalho, Marco Antonio
    da Costa, Andre Luis
    PROCEEDINGS OF THE 2014 9TH INTERNATIONAL CONFERENCE ON COMPUTER VISION THEORY AND APPLICATIONS (VISAPP), VOL 1, 2014, : 708 - 712