1 Introduction

Color medical images provide much more information than gray-level ones. As consequence of the increasing computer power, storage capacities and low-cost systems for capturing images, color images are extensively analyzed in Medicine. Thus, new techniques for digital image processing for correcting, segmenting, measuring and/or quantifying the structures present in color images represent a challenge as clinical information about the anatomic structures could provide a more accurate diagnosis. In this way, the theoretical and technological developments that allow the biomedical image interpretation are fundamental for making better diagnoses, in order to get the most out of the information they contain.

The analysis of blood cell images is an important task in the pathological laboratories for the detection of diseases such as infections, hemorrhage, leukemia, anemia, inflammation, among others. Shape and number of white blood cells (WBC), also called leukocytes, in the cell images are a very important characteristic for the detection of leukemia. Also, there are immature red blood cells when there is a major demand of red blood cells released by the bone marrow. The abnormal WBC, i.e., immature red blood cells, are surrounded with red blood cells and platelets. Therefore, the abnormal WBC are very difficult to identify. In a slide of dyed normal blood cells, it is possible to find red blood cells, WBC, platelets and plasma as a background. The separation of WBC, immature red blood cells or any other abnormal cell is a critical task. The texture, the color or the shape of the kernel are the features that differentiate them. In smear blood images, there are more red blood cells than WBC. Thus, it is necessarily a precise cell segmentation that gives the quantitative diagnosis information. Pathologists used to manually count them by putting the portal objects with the sample blood under the microscope. This is a very tedious task and can sometimes give inexact results. Nowadays, using the automated techniques, the analysis is done more quickly and it gives more precise results. Blood cell segmentation is an essential step for separating the WBC of the kernel and the plasma region [12].

Atanassov’s intuitionistic fuzzy sets give a flexible mathematical framework to manipulate the uncertainty and imprecision in the images. These sets consider not only the membership degree but also the uncertainty that the membership degree called hesitance measure implies. We propose to study the color characteristics, expressed in the color space HSV, as images descriptors through the imprecision and vagueness of the pixels color values. Hue and value are two characteristics color that allow to construct fuzzy intuitionistic sets.

For all that has been discussed, in this paper we propose the use of Atanassov’s intuitionistic fuzzy sets for modeling blood cell color images and develop a new segmentation method for this kind of images.

The paper is organized as follows. Section 2 presents a brief of the related works. Section 3 provides all the theoretical concepts necessaries for the development of the method. In Sect. 4, the proposed method is described. Section 5 provides the different metrics used to validate the results. Section 6 shows the experimental results. Finally, conclusions are discussed in Sect. 7.

2 Related works

Atanassov’s intuitionistic fuzzy sets [4] (A-IFS) have been extensively used in different domains related to image processing, such as thresholding, edge detection, clustering, image retrieval, segmentation, among others.

A-IFS have been applied in some works [15, 22, 23] for image thresholding. In particular, in [15] A-IFS represent the uncertainty in the assignment of pixels to the different regions in the proposed multilevel color thresholding method. The method is applied separately over each RGB component and then the results of the three components are aggregated. In [22], A-IFS are employed to represent the hesitance of the expert in determining whether the pixel belongs to the background or to the object for a grayscale image. Mushrif et al. [23] uses the concept of A-IFS histon for multithresholding.

With regard to edge detection, in [10] it is developed an edge detector based on A-IFS for gray-level images. In addition, it is proposed a new distance measure, called intuitionistic fuzzy divergence that considers the membership degree, the non-membership degree and the hesitation degree. The results obtained using the new measure outperforms previous approaches. In [6] several interval-valued fuzzy sets construction methods for detecting edges in a grayscale image are proposed. These construction methods are based on considering information related to the neighborhood of each point. In [26], the sinogram of low-dose X-ray computed tomography is regarded as an IFS. Then, the intuitionistic fuzzy entropy of the sinogram is calculated in order to distinguish edges and flat areas.

Image clustering is other topic where A-IFS are valuable. In [11], a novel intuitionistic fuzzy C means clustering based on intuitionistic fuzzy sets is proposed. This new algorithm considers the hesitation degree to define the membership function that allows cluster centers to converge faster than the cluster centers obtained by the traditional fuzzy C means algorithm. This method is applied in grayscale CT scan brain image to identify the abnormalities present in the brain. In [12] a color cell image clustering algorithm using intuitionistic fuzzy sets and different color models was proposed. In [14] a novel method for medical image segmentation using kernel-based Atanassov’s intuitionistic fuzzy clustering was proposed to overcome the limitations of the euclidean distance. The results show that tumors and lesion images were clustered accurately, especially in a noisy environment.

In [1] a color image retrieval was developed. The image represented in HSV space was partitioned, and then the intuitionistic fuzzy joint of the features was calculated. The color image contents were used as the image descriptors through the introduction of fuzziness, which naturally arises from the imprecision of the pixel color values and human perception. In addition, fuzzy quantities as similarity measure for two intuitionistic fuzzy sets were used instead of a just real number.

As it can be observed, A-IFS are extremely important for processing leukocyte images. In [24] a review on leukocyte image segmentation, their advantages and flaws are presented. In this work, different approaches are revised, such as methods based on iterative thresholding, adaptative thresholding and the use of OTSU threshold. Also, methods based on clustering algorithms (K-means and C-means) or on mathematical morphology were revised. Finally, several fuzzy divergence and membership functions have been developed with promising results on grayscale image leukocyte segmentation. The conclusions of this review are that there is not a standard automatic leukocyte segmentation method and fuzzy logic may lead to more promising results. In [18], it is proposed a robust approach to automatic segmentation of leukocyte’s nucleus from microscopic blood smear image under normal as well as noisy environment by employing a new exponential intuitionistic fuzzy divergence based on thresholding technique. The methodology involves transforming the color image into gray scale and then minimization of intuitionistic fuzzy divergence between the current image and the ideal threshold image. Moreover, a neighborhood-based membership function has been formulated to cope up with noisy images. In [2], a method to segment leukocytes in blood smear images using interval-valued intuitionistic fuzzy sets is presented. In the method proposed, two thresholds are determined to segment the image. Generally, these values are not presented in the image. Also, the use of an ideally segmented image is necessary. The results are compared to other existing IFS and T2FS based methods [13], K-means (KM) [30] and GVF [19]. In [13], an automatic leukocyte segmentation is proposed using intuitionistic fuzzy and interval Type II fuzzy set theory. The author declares that as the images are considered fuzzy due to imprecise gray levels, advanced fuzzy set theories may be expected to give better result. In [30], a color space decomposition and k-means clustering were combined for WBC segmentation. Finally, in [19], a WBC image segmentation method using stepwise merging rules based on mean-shift clustering and boundary removal rules with a gradient vector flow (GVF) snake is proposed.

Recently, deep learning has been applied to segmentation and classification of leukocytes. Some of the most recent methods are mentioned below. In [16], an end-to-end leukocyte localization and segmentation method is proposed. Pixel-level prior information is used for supervisor training of a deep convolutional neural network which is then employed to locate the region of interests (ROI) of leukocyte and finally segmentation mask of leukocyte is obtained based on the extracted ROI by forward propagation of the network. In this work, authors compare the results of their technique with others three most recent methods described in [3, 25, 27] using the first one watershed and the others two deep learning, respectively. In [3], an unsupervised approach is developed. Authors propose to model color and shape characteristics of WBC by defining two transformations and introduce an efficient use of these transformations in a marker-controlled watershed algorithm. In [27], a fully convolutional network (FCN) that take input of arbitrary size and produce correspondingly-sized output with efficient inference and learning is built. A skip architecture that combines semantic information from a deep, coarse layer with appearance information from a shallow, fine layer to produce accurate and detailed segmentations is defined. Last, in [25] a U-Net is developed based on FCN. This architecture is modified and extended such that it works with very few training images and yields more precise segmentations.

In this work, a new method to leukocyte segmentation is proposed. The method is based on a similarity measure used to segment the objects of interest in an image. The model developed here overcomes several drawbacks of other approaches. In particular, our method is able to evaluate the images automatically using just the information of the image itself, without having to create a threshold, which surely is not a value belonging to the original image. In addition, the method developed here works directly over the image, without considering the associated grayscale image.

3 Preliminaries

3.1 Color model

A color model is a mathematical model describing the way colors can be represented as tuples of numbers. There are different types of color models such as RGB, HSV, CIELab. RGB is the most common representation of color image due to its simple representation. It is device-dependent and it is not a perceptual model [12]. However, due to the high correlation between the three components red, green and blue, it is considered more beneficial working in the HSV space because it is a more intuitive and user-oriented color space [15, 17, 21]. Therefore, the use of the HSV space is convenient when color characterization by only one dimension is desired. In this approach, the HSV color space is selected due to these facts.

3.2 Atanassov’s intuitionistic fuzzy sets

Intuitionistic fuzzy sets introduce uncertainty in the membership degree (known as the hesitance degree). It is well known that traditional fuzzy set theory assigns a membership degree to each element and the non-membership degree is automatically computed as one minus the membership degree. However, human thinking often involves uncertainty or imprecision and sometimes the standard fuzzy sets are not enough because the presence of hesitance or uncertainty or the unknowledge in the membership definition [10].

Taking into account this fact, Atanassov [4] introduced the concept of intuitionistic fuzzy set, which aims to reflect the fact that the degree of non-membership is not always equal to one minus the membership degree due to the presence of some hesitation.

Given a referential set X, an intuitionistic fuzzy set A [4] is defined as:

$$\begin{aligned} A = \{(x,\mu _{A}(x),\nu _{A}(x))/x \in X\} \end{aligned}$$
(1)

where \(\mu _{A}(x)\rightarrow [0,1]\) and \(\nu _{A}(x)\rightarrow [0,1]\) are the membership degree and the non-membership degree of an element \(x \in X\), satisfying:

$$\begin{aligned} 0\le \mu _{A}(x) + \nu _{A}(x) \le 1. \end{aligned}$$
(2)

An intuitionistic or hesitation degree is also introduced by Atanassov (\(\pi _{A}(x)\)), which arises due to the lack of knowledge about the membership degree. The hesitation degree \(\pi _{A}(x)\) is given by:

$$\begin{aligned} \pi _{A}(x) = 1 - \mu _{A}(x) - \nu _{A}(x). \end{aligned}$$
(3)

Atanassov’s intuitionistic fuzzy index represents the ignorance or intuition in the construction of the fuzzy sets [15]. Atanassov’s intuitionistic index in the context of image segmentation indicates the knowledge/ignorance of the expert when assigning a pixel either to the background or to the object. The Atanassov’s intuitionistic index value associated with a pixel has the value zero when the expert is absolutely sure that the pixel belongs either to the background or to the object. The Atanassov’s intuitionistic index value increases with respect to the ignorance/intuition of the expert as to whether the pixel belongs to the background or to the object. If the expert does not know if a pixel belongs to the background or to the object, its membership to both must be represented with the value 0.5 (the greatest ignorance/intuition) resulting in an Atanassov’s intuitionistic fuzzy index maximum value. However, the ignorance/intuition should have the least possible influence on the choice of the membership degree [15].

3.3 Intuitionistic fuzzy generator

In order to construct Atanassov’s intuitionistic fuzzy sets from fuzzy sets, intuitionistic fuzzy generators are used. According to Bustince et al. [9], an intuitionistic fuzzy generator is a function \(\varphi : [0,1] \rightarrow [0,1]\) satisfying:

$$\begin{aligned} \varphi (x)\le 1 - x, \forall x \in [0,1] \end{aligned}$$
(4)

Therefore, \(\varphi (0) \le 1\) and \(\varphi (1) =0\).

Intuitionistic fuzzy generators have been deeply studied. For example, Sugeno [29] employs a generating function to create the intuitionistic fuzzy generator or fuzzy complement. The fuzzy complement functional is defined as:

$$\begin{aligned} N(\mu (x)) = g^{-1}(g(1)-g(\mu (x))) \end{aligned}$$
(5)

where \(g: [0,1] \rightarrow [0,1]\) is an increasing function.

Sugeno class can be generated by using the following function:

$$\begin{aligned} g(\mu (x))=\frac{1}{\lambda }\log (1+\lambda \mu (x)) \end{aligned}$$
(6)

and the Sugeno-type intuitionistic fuzzy generator is written as:

$$\begin{aligned} N(\mu (x)) = \frac{1 - \mu (x)}{1 + \lambda \mu (x)}, \lambda >0 \end{aligned}$$
(7)

where \(N(0)=1\) and \(N(1) = 0\).

As a consequence, using the Sugeno-type intuitionistic fuzzy generator, the fuzzy intuitionistic set is given by:

$$\begin{aligned} A \displaystyle _{\lambda } ^\mathrm{IFS} = \left\{ \left( x,\mu _{A}(x), \frac{1 - \mu _{A}(x)}{1 + \lambda \mu _{A} (x)}\right) / x \in X\right\} \end{aligned}$$
(8)

The hesitation degree or intuitionistic fuzzy index is:

$$\begin{aligned} \pi _{A}(x) = 1 - \mu _{A}(x) - \frac{1 - \mu _{A}(x)}{1 + \lambda \mu _{A}(x)} \end{aligned}$$
(9)

Since the denominator \(1 + \lambda \mu _{A}(x)\) is greater than 1, so \(\frac{1 - \mu _{A}(x)}{1 + \lambda \mu _{A}(x)}\) is less than 1. When this hesitancy factor is zero, the intuitionistic fuzzy set becomes a normal fuzzy set in which \(\mu _{A}(x) + \nu _{A}(x)=1\).

Sugeno-type intuitionistic fuzzy generator is used in this work to create an intuitionistic fuzzy image for modeling a color image.

3.4 Intuitionistic fuzzy divergence

Li and Cheng [20] propose a new similarity measure for intuitionistic fuzzy sets. Although many measures of similarity between fuzzy sets have been proposed in the literature, those measures cannot deal with the similarity measures between intuitionistic fuzzy sets. In this section, some similarity measures for intuitionistic fuzzy sets are presented.

Let IFS(X) be the set of all intuitionistic fuzzy sets over a referential set X and \(S:IFS(X) \times IFS(X) \rightarrow [0,1]\) a mapping. S(AB) is said to be the degree of similarity between \(A \in IFS(X)\) and \(B \in IFS(X)\) if S(AB) satisfies the following conditions:

  1. 1.

    \(S(A,B) \in [0,1]\)

  2. 2.

    \(S(A,B)=1\) if \(A=B\)

  3. 3.

    \(S(A,B)=S(B,A)\)

  4. 4.

    \(S(A,C) \le S(A,B)\) and \(S(A,C) \le S(B,C)\) if \(A \subset B \subset C\), \(C \in IFS(X)\)

The intuitionistic fuzzy divergence (IFD) between two intuitionistic fuzzy sets measures to what extent the two sets are different one to each other [18].

Let \(\scriptstyle A = \{(x,\mu _{A}(x),\nu _{A}(x)) / x \in X\}\) and \(\scriptstyle B = \{(x,\mu _{B}(x),\nu _{B}(x)) / x \in X \}\) two intuitionistic fuzzy sets. Taking into account the hesitation degree, the membership degree range of two intuitionistic fuzzy sets can be represented by

$$\begin{aligned} (\mu _{A}(x),\mu _{A}(x)+ \pi _{A}(x))&(\mu _{B}(x),\mu _{B}(x)+\pi _{B}(x)), \end{aligned}$$

where \(\mu _{A}(x)\) and \(\mu _{B}(x)\) are the membership degree and \(\pi _{A}(x)\) and \(\pi _{B}(x)\) are the hesitance. The interval is due to the hesitation or lack of knowledge in the assignment of the membership values.

Hence, the intuitionistic fuzzy divergence (IFD) between two intuitionistic fuzzy sets A and B that takes into account this hesitance is defined as [14]:

$$\begin{aligned} \scriptstyle \text {IFD}(A,B)= & {} \sum _{i} 2 - [1-\mu _{AB}(x_{i})] e^{\mu _{AB}(x_{i})} \\&- [1+\mu _{AB}(x_{i})] e ^{-\mu _{AB}(x_{i})} \\&+ 2 -[1-\mu _{AB}(x_{i})-\pi _{AB}(x_{i})] e^{\mu _{AB}(x_{i})-\pi _{AB}(x_{i})} \\&- [1+\pi _{AB}(x_{i})+\mu _{AB}(x_{i})] e^{-\pi _{AB}(x_{i})-\mu _{AB}(x_{i})}\\ \end{aligned}$$

being \(\mu _{AB}(x_{i})=\mu _{A}(x_{i})-\mu _{B}(x_{i})\) and \(\pi _{AB}(x_{i})=\pi _{A}(x_{i})-\pi _{B}(x_{i}).\)

3.5 Fuzzy mathematical morphology

Fuzzy mathematical morphology (FMM) is a different approach for the extension of the mathematical morphology (MM) as binary operators to gray-level images, by redefining the set operations as fuzzy set operations, based on fuzzy set theory [5, 8]. FMM is based on a solid theoretical framework and it is proved to be able to solve several problems in image processing and segmentation problems with high texture content. Although these techniques have been widely studied and applied to grayscale images, currently the use of color medical imaging is growing, due to the additional information they present and the increased computing power available.

However, the extension to color or multispectral images is not simple, due to the nature of the data vector and the difficulty of finding a proper order for it. In Bouchet et al. [7], the authors presented the basic operators of the FMM for color images from the definition of a fuzzy order based on fuzzy preference relations. In this approach, a color image is considered as a function \(f : D_{f} \subseteq \mathbb {R}^2 \rightarrow \tau \subseteq \mathbb {R}^3\), where \(D_{f}\) is the domain of the function and \(\tau \) is a color space. The basic operators of the MM for a color image are the dilation and erosion. After, combining these operators another more complex can be defined. The basic operators are defined as follows.

Let \(\tau \subseteq \mathbb {R}^{3}\) be a color space with a structure of complete lattice provided by a total order \(\le _{\tau }\). Let B be a structuring element, the basic operators, dilation (\(\delta \displaystyle _{B} ^{\le _{\tau }}\)) and erosion (\(\varepsilon \displaystyle _{B} ^{\le _{\tau }}\)), associated to a color image f are defined as:

$$\begin{aligned} \delta \displaystyle {_B ^{\le _\tau }} (f) = \sup _{x\in B} \{ f\circ T_{-x}\}\qquad \epsilon \displaystyle {_B ^{\le _\tau }} (f) = \inf _{x\in B} \{ f\circ T_x\} \end{aligned}$$
(10)

being \(T_x: \mathbb {R}^{2} \rightarrow \mathbb {R}^{2}\) the translation function by the element \(x \in \mathbb {R}^{2}\), that is, \(T_x(s)=s+x\). Note that for any color image f, any dilation \(\delta \displaystyle _{B} ^{\le _{\tau }}\) and any erosion \(\varepsilon \displaystyle _{B} ^{\le _{\tau }}\) are new color image. In this work, FMM have been used to make automatic the proposed method.

4 Hue intuitionistic-based method

In this section, the proposed method is developed. This method first considers the hue component of a HSV image and model this component as an A-IFS. Then select a pixel from the image as reference to compute the similarity and compute the IFD between each element and the pixel selected as reference. If the IFD for a point is less or equal than a fixed value, the point is conserved, otherwise discarded. Figure 1 shows a block diagram of the proposed algorithm.

Fig. 1
figure 1

Block diagram of the proposed method

The method to segment the leukocytes can be summarized in the following six steps:

  • Step 1 HSV color model is used for representing the color image. Let f be a color image, three components are extracted according to the hue (H ), saturation (S) and value (V) components.

  • Step 2 In this step, the image is modeled with A-IFS. Let H the hue component of the image with size \(M\times N\). The component H is defined as an intuitionistic fuzzy set as follows:

    1. 1.

      The first coordinate represents the degree: \(h_{ij} \in [0^{\circ },360^{\circ }), 0\le i \le M, 0\le j \le N\).

    2. 2.

      The second coordinate is the normalized value of h. It is obtained applying the membership function:

      $$\begin{aligned} \mu _{A} (h_{ij}) = \frac{h_{ij}}{360^{\circ }} \end{aligned}$$
      (11)
    3. 3.

      The non-membership function is applied over the value obtained in the above step. The non-membership function is computed by using the Sugeno-type intuitionistic fuzzy generator as follows:

      $$\begin{aligned} \nu _{A} (h_{ij}) = \frac{1-\mu _{A} (h_{ij})}{1+\lambda \mu _{A} (h_{ij})} \end{aligned}$$
      (12)

    Therefore, the intuitionistic fuzzy set for the hue component is defined as:

    $$\begin{aligned} A \displaystyle _{\lambda } ^\mathrm{IFS} = \left\{ \left( h_{ij},\mu _{A} (h_{ij}), \frac{1-\mu _{A} (h_{ij})}{1+\lambda \mu _{A} (h_{ij})}\right) / h_{ij} \in H \right\} \end{aligned}$$
    (13)

    In this paper, we have \(\lambda = 0.5\).

  • Step 3 The hesitance degree is calculated for each pixel of the image:

    $$\begin{aligned} \pi _{A} (h_{ij})= 1 - \mu _{A} (h_{ij}) - \frac{1 - \mu _{A} (h_{ij})}{1+ \lambda \mu _{A} (h_{ij})} \end{aligned}$$
    (14)
  • Step 4 For leukocytes, segmentation is necessary one point as a reference to measure the similarity between this point and the image to analyze. Therefore, a fixed pixel corresponding to the object to segment is selected. This selection is made using FMM. For this, a successive fuzzy color erosion given by Eq.  10 is applied over the original image with the goal of obtaining the fixed point, called \(\overline{p}\). As the image is eroded, the objects in the image are disappearing until there is only one point belonging to one of the leukocytes. This point is represented by their intuitionistic coordinates and their hesitance degree as

    $$\begin{aligned} \overline{p} = (p, \mu _{A} (p), \frac{1-\mu _{A} (p)}{1+ \lambda \mu _{A} (p)}). \end{aligned}$$
  • Step 5 The similarity measure between the fixed pixel and each pixel in the image is calculated in the following way. Let \(A_{\lambda }^\mathrm{IFS}\) the intuitionistic fuzzy set, given by Eq. 13, corresponding to the hue component H of the image, which their dimension is \(M\times N\). The IFD between each element of H and \(\overline{p}\), using Eq. 10, is given by:

    $$\begin{aligned}&\hbox {IFD}(h_{ij},p)\\&\quad = 2 - [1- \mu _{A_{h_{ij},p}}] e^{\mu _{A_{h_{ij},p}}} -[1+ \mu _{A_{h_{ij},p}}] e ^{- \mu _{A_{h_{ij},p}}} \\&\quad \quad + 2 -[1-\mu _{A_{h_{ij},p}}+\pi _{A_{h_{ij},p}}] e^{\mu _{A_{h_{ij},p}} -\pi _{A_{h_{ij},p}}} \\&\quad \quad - [1-\pi _{A_{h_{ij},p}}+\mu _{A_{h_{ij},p}}] e^{\pi _{A_{h_{ij},p}}-\mu _{A_{h_{ij},p}}} \end{aligned}$$

    where \(h_{ij}\) represented each pixel in H with \(1 \le i \le M\) and \(1 \le j \le N\), \(\mu _{A_{h_{ij},p}}=\mu _{A}(h_{ij})-\mu _{A} (p)\) and \(\pi _{A_{h_{ij},p}}=\pi _{A}(p)-\pi _{A}(h_{ij})\) Therefore, IFD is a matrix of size \(M\times N\) in which each number represents the similarity between \(h_{ij}\) and the fixed point \(\overline{p}\).

  • Step 6 In this step, a decision is taken. If the similarity measure \(\hbox {IFD}(h_{ij},p)\) is less or equal than a fixed value, denoted by \(\theta \), then the point \(h_{ij}\) is conserved; else discarded. As a consequence, the segmented leukocytes image is obtained, i.e., for all i and j, \(0 \le i \le M\), \(0 \le j\le N\):

    $$\begin{aligned}&\hbox {If}\ \text {IFD}(h_{ij},p) \le \theta \Rightarrow \hbox {Result}(i,j) = h_{ij}\\&\hbox {If}\ \text {IFD}(h_{ij},p) > \theta \Rightarrow \hbox {Result}(i,j) = 0 \end{aligned}$$

    where \(\hbox {Result}(i,j)\) represents the result image to pixel (ij).

5 Validation

To evaluate the performance of the proposed algorithm, some well-known metrics in classification and information retrieval have been used [28]. These metrics are accuracy, precision, recall, Dice and Jaccard coefficients. Accuracy is a metric normally used for computing the overall classification grade. Precision computes the percentage of positive prediction made by the classifier that is correct while recall computes the percentage of positive patterns that are correctly detected by the classifier. On the other hand, the Dice coefficient is a statistic used for comparing the similarity of two samples and the Jaccard coefficient measure the similarity degree between two sets.

6 Experimental results and discussion

In this section, some experiments are conducted to show the results of the application of the proposed method. The dataset consists of one hundred \(300\times 300\) color images, which were collected from the CellaVision blog.Footnote 1 The cell images are generally purple and may contain many red blood cells around the white blood cells. Also, the area related to the nuclei and cytoplasm was manually segmented by an expert.

As an example, Fig. 2 shows the results of the proposed method applied to three images of the dataset. Original images are showed from (a) to (c), their segmentations are showed from (d) to (f) and finally the expert’s segmentation are showed from (g) to (i).

Fig. 2
figure 2

Results of the proposed method. ac Original Images. df Segmentation obtaining by the proposed method. gi Segmentation given by the experts

Table 1 shows the average classification error as a confusion matrix [28], for the proposed method applied to the dataset. We can see that true positives and true negatives are both high values. These values are \(99.41\%\) and \(99.23\%\), respectively. Also, we can see that higher values are obtained for false negatives than for false positives, \(0.77\%\) and \(0.59\%\), respectively.

Table 1 Confusion matrix

Table 2 shows the mean and the standard deviation of the accuracy, precision, recall, Dice coefficient and Jaccard coefficient for the images processed. It can be seen that the values obtained for the means are high, while the values obtained for the standard deviation are low, showing the good performance of the proposed method.

Table 2 Mean and standard deviation (SD) of the metrics used for the validation

Besides the quantitative validation made before, a description and comparison against the state-of-the-art methods in the literature is developed. There are two important works mentioned in the introduction which used intuitionistic fuzzy sets as our proposed method. This is the fact that we compare these techniques. In the first one [18], Jati method (J-M) is applied on a ROI but not on the complete RGB image, working efficiently. The main contribution of our proposal is that it does not need the definition of a ROI as it works on the whole image. Furthermore, the result of our method on a ROIs has a better performance than Jati method. In [2], an improve segmentation accuracy of Jati method is proposed. The basic idea of Ananthi method (A-M) is to find a threshold for which the similarity between ideally segmented image and the segmented image using the determined threshold is maximum. Therefore, this method requires an ideally segmented image but it is not always available. Table 3 shows the accuracy rate and the Dice coefficient average for our proposal, Jati and Ananthi methods for the images of the dataset. The table includes the values obtained with the techniques mentioned in Sect. 2: IFS- and T2FS-based methods [13], K-means (KM) [30] and GVF [19].

Table 3 Accuracy rate (1st row) and Dice coefficient average (2nd row) of IFS, T2FS, K-means, GVF, J-M, A-M and the proposed method (P-M) for the images of the dataset

Also, the segmentation performances of our proposed method are compared with the most recent methods mentioned in Sect. 2: LeukocyteMask without data augmentation (LM) [16], watershed-based method (W) [3] and two deep learning-based methods FCN [27] and U-Net [25]. Table 4 shows the precision rate and the average value of Dice coefficient between all these methods, considering the complete cell instead of only the nuclei.

Table 4 Precision rate (1st row) and Dice coefficient average (2nd row) of W, FCN, U-Net, LM and the proposed method (P-M) for the images of the dataset

7 Conclusions

In this work, it is proposed a new method for color image segmentation of leukocytes based on Atanassov’s intuitionistic fuzzy sets and fuzzy mathematical morphology. A similarity measure is used as tool to segment the objects of interest in an image. The algorithm works directly on color images without the need to transform them to grayscale images. Thus, it avoids the associated loss of information produced by this transformation. Another advantage of this approach is that, because of the use of the fuzzy color image operators in the detection of the reference point, no false colors are created in the process, and the resulting point contains exactly the same color present in the original image. As we can see in the results, the performance of the proposed algorithm is high.