Introduction

According to the World Health Organization, skin cancer is one of the most common types of cancer worldwide. It ranks \(19\textrm{th}\) among all diseases in men and women, with 324,635 cases reported in the year 2020. With the increased cases, early detection and timely treatment for melanoma are critical for patient survival.

Dermoscopy is a well-known in vivo unobtrusive imaging tool that uses captivated light to help dermatologists inspect pigmented skin sores based on a variety of morphological highlights. In spite of the fact that dermoscopy has been shown to prompt expanded demonstrative exactness, appropriate understanding of dermoscopic images is typically tedious, complex, and costly and depends on the observer’s perception. The traditional approaches are carried out with low-quality image processing methods that fall under image analysis in the medical field. The initial methods carried out in cleaning the raw data are done by pre-processing methods that adjust the intensity, contract, redundant data, scaling, and binarisation [1, 2] in the morphological structure of the image.

Recent advances in information technology have resulted in high-performance results in detecting and diagnosing various types of cancer, particularly skin cancer. The unwanted noises are removed with pre-processing methods proposed by [3]. The quality of the image is enhanced by pre-processing methods, which reduce the processing time and complexity.

Image resizing plays an important role while processing the data. As different datasets have varied sizes of images, it is necessary to resize them to the same size to apply the algorithms. The pre-processing is followed by image segmentation to detect the region of interest (ROI). The ROI may be anything that we need to analyze. In the medical image, ROI could be the diseased region that is separated by the unaffected region [4]. This segments the unaffected tissue, and then the required features are considered from the affected region so that the result will be accurate and clear [5].

The classical way of segmenting is performed by thresholding, clustering, and other edge detection methods, and the ABCDE method is used to diagnose melanoma in the skin during the analysis [6]. Even though many methods are incorporated in detecting and diagnosing cancer, there are still many challenges in dealing with real-time image data. It contained many unexpectedly complex data points, and the image’s ocular emergence in the affected skin area made separating the desired ROI of melanoma with an accurate contour measure from the image difficult. [7].

Automated state-of-the-art techniques have been developed to help dermatologists improve their effectiveness and objectivity in the visual understanding of dermoscopic images[8]. Automatic image segmentation is performed mainly using classification and clustering. Classification is supervised segmentation that requires prior information about the classes to be classified. Clustering is preferred because it is unsupervised and does not require prior information. However, clustering algorithms require initial centroids to obtain clusters. Wrongly chosen clusters can result in local minima producing invalid segmentation regions, deeming the effort unfruitful.

Many researchers proposed automated methods to overcome these challenges. The broad category of these methods includes thresholding, clustering, classification, and contours and snakes, each having its merits and demerits [9].

Skin lesion segmentation based on thresholding namely, Otsu’s[10], fuzzy logic [11], adaptive thresholding [12] are available in literature. The threshold methods lead to irregular edges with varied thresholds. The lesions of a melanoma tend to have fuzzy borders and irregular shapes, leading to uncertainty in identifying the exact lesion from skin images. Researchers have used fuzzy sets and rough sets to address the uncertainty and vagueness in the image. Skin cancer with fuzzy logic approaches are proposed in [13,14,15,16]. Fuzzy-based methods have the advantage of representing the intermediate data in intervals, allowing qualitative analysis of the data [3]. A fuzzy intensity threshold with type2 fuzzy logic proposed in [11] was able to detect the pixel intensity either belongs to ROI or the background. These fuzzy-based methods failed to group lesion pixels with low contrast as lesions.

Garcia et al. used fuzzy classification of pixels and histogram threshold with innovative methods applied on skin images for segmentation in [17]. The method used Otsu’s threshold with fuzzified regions determination and applied morphological operators to extract the tissues in case of artefacts. Castillejos et al. [14] presented predefined cluster selection using fuzzy c-means. This work specifies automatically, the number of clusters needed by an image for segmentation. The clustering algorithms are highly influenced by the initial centroids and the number of clusters needed for clustering.

Many algorithms based on active contours and snakes are proposed for skin lesion segmentation [18,19,20,21,22,23]. These algorithms usually depend on the initial curves and positioning of curves that undergo deformation to detect the boundaries of lesions. An automated method for adapting the contour to skin lesions is proposed in [23], but still, the contour selection is needed.

In recent days, many deep learning models for segmenting skin lesions are proposed in the literature based on convolutional neural networks, generative adversarial models [24, 25], deep autoencoders, stacked autoencoders, convolutional autoencoders, restricted Boltzmann’s machine, and recurrent neural nets are reviewed and analyzed in [26,27,28,29,30,31]. Deep learning methods have the ability to obtain the features from images that are useful in segmentation. The performance of the deep learning models has improved when compared to existing methods. However, Graphics Processing Units (GPU) are used in parallel to analyze the features and to detect the skin lesions[8, 32, 33].

Adrian et al. use the trapezoidal intuitionistic fuzzy method for transferring the data into interval-valued trapezoidal multi-criteria for decision-making [34]. To efficiently handle the data, intuitionistic fuzzy sets(IFS) provide a triple vector to make appropriate decision making. Aribarg has introduced a modified fuzzy ant-miner (MFAM) that employs attributes and case weighting for training [35]. IFS was successfully applied for brain image segmentation for classifying tissues and tumors in presence of noise and artefacts [36, 37]. This motivated to use IFS for segmenting skin lesions in presence of artefacts.

Intuitionistic fuzzy set (IFS) theory for medical images has been proposed to handle images with a lot of uncertainties, as they are badly illumined with fuzzy. Direct segmentation of results often creates unusable results. In [38] Charia et al. used IFS theory to produce accurate diagnosing of diseases using cellular images. FCM clustering method has been proposed by Huang et al. [39] for image segmentation with rough set theory. The segmentation results of various clustering numbers using FCM where the image is distributed into various small regions based on the indistinguishable attributes and their relationship, have reduced error rates and improved segmentation of fuzzy boundary regions.

Advanced fuzzy set-theoretic techniques are very important and play a major role in the area of medical images. Image segmentation is performed on digital pathology images using the IFS method. This method results in strong results compared to other segmentation methods [40, 41]. Shaw et al. show that triangular intuitionistic fuzzy numbers with arithmetic procedures can be used to check the reliability of the fuzzy systems. To calculate imprecise failure, each component failure is taken into considerations by the triangular intuitionistic fuzzy numbers [42, 43].

Tilson et al. use FCM clustering programs for data analysis problems, and this method generate fuzzy classification for any set of given numerical data. The clustering method used to group the subsets and generalized objective with least square method [44] is proposed.

Intuitionistic fuzzy c-means(IFCM) algorithm has been proposed for image segmentation in [45] for Brian images. Verma et al. use IFCM to handle the uncertainty. However, the results show that the method is very sensitive to noise and does not incorporate any local spatial information. From this, IIFCM (improved intuitionistic fuzzy c-means) has been proposed to handle the insensitive to noise and freedom of choosing the parameter when tuning is performed. IIFCM method results in significant performance increase compared to other existing methods [37, 46].

The clustering algorithms are based on IFS also suffer from initial centroid selection. In this paper, a novel algorithm is presented to obtain the melanoma regions from skin images. The proposed method identifies the initial regions using triangular fuzzy sets. The obtained regions are considered for different membership functions for IFS and the centroids are also initialized with mean values of the regions. The updating of the centroids and the membership functions of IFS are iterated until clusters are stable and exactly identify the melanoma regions.

The major contribution of the paper are:

  • The paper has studied and analyzed triangular Intuitionistic Fuzzy Sets and its application to Skin cancer segmentation.

  • Every fuzzy based clustering algorithm depends on initial centroid. In this paper, using the peaks and valleys of the histogram of the input image, the centroids are computed. The successive distance between valleys and peaks are considered for the parameters to define TMF.

  • Applying TMF, the initial regions are computed that in turn are used to compute the initial centroids.

  • TMF helps in identifying the initial clusters and regions and reduce the number of iterations needed for segmentation.

  • TMF converges faster due to the initial centroids selection and the accuracy of the segmentation is increased.

The paper has different sections that explains the background in “Background”, Triangular Intuitionistic Fuzzy C-Means (TIFCM) in “Proposed Methodology”, implementation and experimental results analysis in “Implementation and Experimental Results” and finally conclusions and the future scope in “Conclusion”.

Background

Challenges of Skin Cancer Detection

Skin cancer detection is a challenging task due to numerous artefacts associated with the skin medical images.

Irregular Shape, Size and Shade

Large changes in skin lesions have made accurate detection and segmentation of skin lesions difficult. Numerous factors, like lesion localization, its size, shape, skin hair, bubbles, blood vessels, uneven boundaries with fuzziness, and tone of the skin, need to be handled with preprocessing for accurate segmentation.

Image Acquisition Artefacts

The artefacts related to image acquisition include rule markers, imaging frames, low contrast, and illumination. Figure 1 depicts the artefacts that make skin cancer detection more complex.

Fig. 1
figure 1

Images from HAM10000 data set a skin tone, b irregular shape, c hair, d air bubble images, e fuzzy boundaries f cracked skin tones, g rule markers, h imaging frames

Pre-processing and Post-processing

Preprocessing is performed on the data sets in different ways. The images are first converted to grayscale, and then resized because different data sets contain images of varying sizes.There is no additional pre-processing in this case because intuitionistic sets are used to obtain lesion belonging and non-belonging as well as fuzzy boundaries based on the membership function. Binarization is performed on the lesion-belonging region as part of the post-processing binarization to obtain the lesion region.

Fuzzy Sets and Triangular Fuzzy Membership Function

Definition 1

The definition of fuzzy set is notated by a membership function \({\mu _{\bar{a}}}(e)\) where E is the universe of discourse.This function establishes a mapping between each element \(e \in E\) to a real valued number in the range [0, 1]. This membership function reveals the grade of membership of the element e in \({\mu _{\bar{a}}}(e)\). As the value of the function gets closer to unity, the higher will be the membership grade.

Definition 2

The function \({\mu _{\bar{a}}}(e)\) for a triangular fuzzy number \(\tilde{a} = (a1,a2,a3)\) is established as:

$$\begin{aligned} {\mu _{\bar{a}}}(e) = \left\{ {\begin{array}{*{20}{l}} 0 &{}{\mathrm{{ if }}e< a1 }\\ {\frac{{e - a1}}{{a2- a1}}}&{}{\mathrm{{ if }}a1< e \le a2}\\ {\frac{{a3 - e}}{{a3 - a2}}}&{}{\mathrm{{ if }}a2< e < a3}\\ 0&{}{\mathrm{{ Otherwise }}} \end{array}} \right. \end{aligned}$$
(1)

The values of the triplet (a1, a2, a3) are real numbers that confines to \(a1 \le a2 \le a3\). The value of e at the triplet element a2 is the most likely value of the evaluation data and it is also observed as the supreme grade of \(\mu _{\bar{a}}(e)\). On the other hand, the minimum grade of e at \(\mu _{\bar{a}}(e)\) is the least likely value to be evaluated from the membership function i.e., \(\mu _{\bar{a}}(e) = 0\). The range of evaluation data is bounded between the constants [a1, a3], which is an implication of degree of fuzziness of the evaluation data.

Intuitionistic Fuzzy Sets

Generalization of fuzzy sets is characterised by membership, non-membership and hesitancy values [47]. The degree of belongingness to a cluster determines the membership and non-membership property of the elements. The dilemma of a particular pixel belonging to a specific cluster is determined by the hesitancy. Hesitancy adds precision to the imperfect knowledge obtained from the fuzzy sets.

$$\begin{aligned} A=\{(e,\mu _{A}(e),\pi _{A}(e))\mid e\in E\} \end{aligned}$$
(2)

with \(\gamma _{A}(e)=1-(\mu _{A}(e)+\pi _{A}(e))\) where the functions \(\mu _{A}(e),\pi _{A}(e)\) indicate the degree to which an element belongs or does not belong to the finite set E. The intuitionistic fuzzy index is determined by \(\gamma _{A}(e)\) signifies the degree of hesitation of an element. The necessary conditions to be satisfied by an element \(e \in E\) that is defined as IFS is given by \(0\le \mu _{A}(e),\gamma _{A}(e),\pi _{A}(e)\le 1\). The bias, noise and assignment of an element to a particular cluster is precisely represented by the three functions.

Data Sets

Different data sets available to work with skin cancer algorithms are explained below and are presented in Table 1.

PH2 [48] consists of epiluminoscopy images,also known as dermoscopic images having the size of 765X574 pixel values. There are 200 images in this dataset of melanocytic lesions, including nevi, sensitive nevi, and melanomas.This dataset also contains numerous image descriptors.

ISIC 2019 dataset is categorized into 8 different classes of dermoscopic images for training and testing. The datasets are available with and without metadata and contain a total of 25,331 images. Groundtruths are also available for testing on standard images of lesions.This dataset is derived from the BCN20000, HAM10000, and MSK datasets [46, 49].

HAM10000 [50] as the name indicates, it contains 10,015 images for training that were classified in to different dermatoscopic images in the realm of pigmented lesions collected from varied populations. They were collected, confirmed and stored through different modalities rate [50]. They are available for the research and public use in the ISIC collection.

Table 1 Data sets used for simulation
Fig. 2
figure 2

a, c ISIC sample images, b, d valleys and peaks of the images

Fig. 3
figure 3

a, e, i Images from ISIC data set, b, f, j regions extracted for values \(a1 < e_i \le a2\), c, g, k regions extracted for values \(a2 < e_i \le a3\), d, h, l other region for values \(e_i\le a1\) and \(e_i \ge a3\)

Proposed Methodology

This section mainly concentrates on the flow of segmentation performed on skin images using triangular intuitionistic fuzzy sets.

Triangular Membership Based Fuzzy Region Determination

The fuzzy functions highly impact the segmentation performance as these are necessary for producing clusters. The proposed method presents a novel approach by identifying the initial regions with the triangular membership functions, which act as the input to the intuitionistic fuzzy C-means. The observed image having the size \(m \times n\) is denoted as \(E= \{e_{i} / e_{i}\) represents \(i\textrm{th}\) pixel value in the image \(\}\). To apply triangular membership function ab and c values are needed. These values are calculated from the gray values associated with the peaks and valleys of the histogram of the image [51]. Figure 2 show the ISIC images and their corresponding peaks and valleys. Every sequence of valley, peak and valley will be treated as a1, a2 and a3 that will extract the membership \(\mu _{\bar{ a}}(e)\) for the regions using Eq. 1.

The regions obtained from the triangular membership function are given as input to the intuitionistic fuzzy c-means. Figure 3 shows the regions extracted using triangular membership function.

Triangular Intuitionistic Fuzzy c-Means (TIFCM)

The regions obtained from the triangular membership function are used to find the centroids needed to perform intuitionistic fuzzy c-means. Many image segmentation works based on IFS are proposed in [37, 52, 53]. The image E is correlated to intuitionistic fuzzy with the below equation

$$\begin{aligned} A=\{(e_{i},\mu (e_{i}),\pi (e_{i}))\mid e_{i}\in E\} \end{aligned}$$
(3)

To find \(\mu (e_{i}),\pi (e_{i})\) and \(\gamma (e_{i})\), membership functions, the three regions obtained with abc of triangular membership function is considered as deterministic region \(D(e_i)\),\(H(e_i)\) and other region as indeterminacy region \(I(e_i)\). Compute the mean value of every region to obtain the initial centroids \(C_{j}\) where \(1<j<n\)( n is the 3 for three regions).

The computation of membership value \(\mu (e_{i})\) is performed with the deterministic region \(D(e_i)\) and the centroids with the below Eq. 4.

$$\begin{aligned} \mu (e_{i})=\frac{1}{\sum \limits _{j=1}^n {\left( \frac{{\mid \mid D(e_i)-C_{j} \mid \mid }}{{\sum \limits _{c=1}^{n,c!=j}}{\mid \mid D(e_i)-C_{c} \mid \mid }}\right) }^\frac{2}{m-1}} \end{aligned}$$
(4)

where \(C_{j}\) is the centroid of \(j\textrm{th}\) cluster (here, mean value of \((D(e_i)\)) and \(C_{c}\) is the centroid values of regions other than \(j\textrm{th}\) cluster (here, \(H(e_i), I(e_i)\)) are obtained from triangular membership function). Compute \(\pi (e_{i})\), and \(\gamma (e_{i})\) with the help of \(I(e_i)\) and \(H(e_i)\) by making use of Eqs.(5)-(6).

$$\begin{aligned} \pi (e_{i})&=\frac{1}{\sum \limits _{j=1}^n {\left( \frac{{\mid \mid I(e_i)-C_{j} \mid \mid }}{{\sum \limits _{c=1}^{n,c!=j}}{\mid \mid I(e_i)-C_{c} \mid \mid }}\right) }^\frac{2}{m-1}} \end{aligned}$$
(5)
$$\begin{aligned} \gamma (e_{i})&=\frac{1}{\sum \limits _{j=1}^n {\left( \frac{{\mid \mid H(e_i)-C_{j} \mid \mid }}{{\sum \limits _{c=1}^{n,c!=j}}{\mid \mid H(e_i)-C_{c} \mid \mid }}\right) }^\frac{2}{m-1}} \end{aligned}$$
(6)

The IFS partition matrix \(\mu _{IFS}(e_{i})\) and cluster centroid \(C(\mu (e_{i}))\) are updated using the below equations.

$$\begin{aligned} \mu _{IFS}(e_{i})&=\mu (e_i)+\pi (e_i)+\gamma (e_i) \end{aligned}$$
(7)
$$\begin{aligned} C(\mu (e_{i}))&= \frac{\sum \limits _{e_{i}\in \ E}(\mu (e_{i}))^{m} (e_{i})}{\sum \limits _{e_{i}\in \ E}(\mu (e_{i}))^{m} } \end{aligned}$$
(8)

Find the other centroids using the Eq. 8 for \(\pi (e_{i})\) and \(\gamma (e_{i})\). Here, m indicates the fuzzification constant given by user. The membership function converts to be crisp and binary if the values m nears to 1 otherwise fuzzy and blurred with increased value [54]. Good segmentation results are produced for vast data with \(1.5< m <3\) and generally 2 is considered[55, 56].

Triangular intuitionistic fuzzy c-means is also iterative similar to other clustering algorithms. It finds the three regions using Eqs. 4, 5, 6 and obtains the new centroids using Eq. 8 repeatedly and stops when the clusters are stable. The stability of cluster is computed with the similarity coefficient based on the Hamming distance between the previous clusters \(\mu (e_{i}))^l,\pi (e_{i})^l\) and \(\gamma (e_{i})^l\) and present cluster \(\mu (e_{i}))^{l+1},\pi (e_{i})^{l+1}\) and \(\gamma (e_{i})^{l+1}\). The hamming distance is given with the equation

$$\begin{aligned} \begin{array}{cc} sc=\sum \limits _{i=1}^{M*N} \mid \mu _(e_{i})^l-\mu _(e_{i})^{l+1} \mid \\ + \mid \pi (e_{i})^l-\pi (e_{i})^{l+1} \mid \\ + \mid \gamma (e_{i})^l-\gamma (e_{i})^{l+1} \mid \\ \end{array} \end{aligned}$$
(9)

Triangular Intuitionistic Fuzzy c-Means Clustering Algorithm (TIFCM)

The step-wise algorithm of Triangular intuitionistic fuzzy is listed below.

figure a

Implementation and Experimental Results

Experimental Setup

To find the efficacy of the proposed algorithm TIFCMM, The ISIC 2016, HAM10000 2019 data set [49] and PH2 [48] data set is used. The data set contains the skin images with diagnostic, clinical, technical and database attributes based images. The proposed TIFCM algorithm is worked out with MATLAB software on i5 processor. The total number of clusters n is assigned as 3 in the proposed algorithm to determine the three regions. The centroid values are initialised through the triangular membership functions. The difference between the subsequent clusters is fixed as the exit criteria, which is 0.01.

Fig. 4
figure 4

Segmentation results of proposed algorithm TIFCM for different images of ISIC data set. (Column 1) Original images of ISIC data sets, (Column 2) Deterministic region depicting cancer region, (Column 3) Indeterminacy regions (Column 4) Hesitance regions

Fig. 5
figure 5

Segmentation results of proposed algorithm TIFCM for ISIC_0034329, ISIC_0034332, ISCI_0034337 and ISIC_0034343 of ISIC 2019 data set. (Column 1) Original images of ISIC data sets, (Column 2) Deterministic region depicting cancer region, (Column 3) Indeterminacy regions (Column 4) Hesitance regions

Fig. 6
figure 6

Lesion segmentation of different PH2 data set images.(Row 1) a Malignant melanomas image IMD063, b Ground Truth(GT), c extracted using TIFCM. (Row 2) d Melanoma image IMD058, e GT of IMD058, f extracted using TIFCM. (Row 3) g A typical Nevus image IMD048, h GT of IMD048, (i)extracted using TIFCM. (Row 4) j Common Nevus image ISIC_0012253, k GT of (j), l extracted using TIFCM.(row 5) m Benign melanoma image IMD075, n GT of IMD075, o extracted using TIFCM. (row 6) p Benign melanoma image ISIC_0000125, q GT of p, r extracted using TIFCM

Fig. 7
figure 7

Comparison of Algorithms applied to ISIC_0000006 for Benign nevus detection (Row 1) Segmentation with KM, (Row 2) Segmentation with FCM, (Row 3) Segmentation with RFCM, (Row 4) Segmentation with GRIFCM, (Row 5) Segmentation with TIFCM

As part of pre-processing the images are resized to \(512\times 640\) as the image sizes vary for ISIC, PH2, HAM10000 data sets. In post processing of the proposed algorithm, the deterministic final region is converted to black and white to compare with the ground truths.

The segmentation results of the TIFCM algorithm on various skin images is shown in Fig. 4. Column 1shows the Original images of ISIC data sets. The images (a)ISIC_0000000,(e) ISIC_0000008 (i)ISIC_0000049 (m) ISIC_0000008 (q) ISIC_0000002 (u) ISIC_0000043 are shown in Column 1 and are used to extract malignant region using proposed TIFCM. Column 2 shows the Deterministic region depicting cancer region, Column 3 depicting Indeterminacy regions and Column 4 showing the Hesitance regions extracted from the stable clusters of TIFCM. Further, in Fig. 5 the segmentation results of images ISIC0034329, ISIC0034332, ISCI0034337 and ISIC0034343 of ISIC 2019 data set are presented. The subjective analysis show that the lesion was extracted efficiently using the proposed method.

Figure 6 exhibits the results of TIFCM algorithm for different images like malignant melanoma, melanoma, benign melanoma, common nevus, a typical nevus image that are commonly identified skin diseases of PH2 data set. The lesion detection of these images are compared with their ground truths [7]. The results showed that the proposed algorithm performs very well when compared to other algorithms. The comparative analysis of the proposed algorithms with other state of art techniques namely KM [57], FCM [55], RFCM [58], and GRIFCM [37] is given in Fig 7. The detailed analysis with other segmentation algorithms reveals that the proposed algorithm gives improved cancer region segmentation.

Quantitative Analysis

The segmentation results are analysed quantitatively using the performance measures namely, segmentation accuracy (SA), Jaccard’s coefficient (JC) and Dice coefficient (DC).

$$\begin{aligned}&\text {Jaccard coefficient}= \frac{E1\bigcap E2}{E1\bigcup E2} \end{aligned}$$
(10)
$$\begin{aligned}&\text {Dice coefficient}= \frac{2\mid E1\bigcap E2 \mid }{\mid E1 \mid + \mid E2 \mid } \end{aligned}$$
(11)

where E1 is the ground truth image. E2 is the resultant segmented image,

$$\begin{aligned} \text {Segmentation Accuracy}=\frac{TP+FN}{TP+FN+TN+FN} \end{aligned}$$
(12)

where,

  1. 1.

    True positive (TP): Ratio of sum of true pixels in the E2 detected in E1.

  2. 2.

    True negative (TN): Ratio of sum of true pixels in the E2 falsely segmented as negative in E1.

  3. 3.

    False positive (FP): Ratio of sum of false pixels in E2 falsely segmented as positive in E1.

  4. 4.

    False negative (FN): Ratio of sum of false pixels in E2 detected as negative in E1.

Table 2 Comparisons of performance measures for the images in Fig. 3
Table 3 Comparisons of performance measures for different segmentation algorithms
Table 4 Execution time comparison for different algorithms

The SA, JC, DC, precision, specificity and sensitivity measures are given in Table 2. These performance measures are calculated for different skin disease, namely, malignant melanoma, melanoma, benign melanoma, common nevus, typical nevus images of ISIC data set images. The results proved that the proposed algorithms have efficiently extracted the lesion of an cancerous tissues. The average JC value of 0.85, SA of 0.90 is achieved for with the proposed TIFCM. The quality of segmentation can be assessed by observing the segmentation JC value with 0.8 or above indicating the visual “correctness”. It is observed that for 100 images from ISIC 2019 the observant agreement for JC value is considered as 0.786[49]. It is observed that, the fall in JC value below 0.7, the “correctness” of the segmentation can be debated. With the proposed method,78 out of 100 images fell above JC of 0.7, 10 images fell at or below 0.7, rest images fell below 0.6.

To depict the efficiency and robustness of the proposed TIFCM method, a comparison with the latest methods in the literature, are shown in Table 3. The methods used in the comparison are executed on ISIC 2017 challenge and are ranked based on the Jaccard’s coefficient. It is clear from the table that the JC values produced with the proposed method has an marginal increment over other lesion segmentation algorithms.Also, the improved sensitivity values are observed with the proposed method. In contrast, the deep learning methods have exhibited high segmentation accuracy and specificity. The proposed method dice coefficients are inline with the results of the deep learning methods (Table 3). In Table 4 the execution times of proposed method in comparision to the existing algorithms are presented. The proposed TIFCM method shows improved performace as the initial centroids are chosen with the histrogram peaks and valleys.

The efficacy of the proposed method is also compared with the method FCM classification of pixels with histogram thresholds [59]. The SA, JC and sensitivity values are significantly improved with the proposed methods while the specificity and DC values are less with the proposed method.

Conclusion

Computer-aided detection of malignant melanoma skin cancer with the use of skin images has tremendously assisted clinicians. Skin cancer detection has become more difficult due to a variety of factors such as artefacts in skin images, non-homogeneous intensities, and low contrast images.In this paper, we present a novel TIFCM algorithm for skin image segmentation. The triangular membership function is used to extract the initial regions and centroids. This avoids the initial selection of centroids, which is the drawback of every clustering algorithm. The triangular membership based centroids and regions assist in the faster stability of clusters, reducing the execution time. The regions extracted are used as initial inputs to calculate the membership functions of the intuitionistic fuzzy c-means that effectively handle the uncertainty in the skin images.