Keywords

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

1 Introduction

An integration method is a mechanism which takes input as a number n of data and combines them to form a value representative of the information, methods exist which combine information from different sources which can be aggregation operators as arithmetic mean, geometric mean, ordered weighted averaging (OWA) [1], and inter alia.

Artificial neural networks were introduced by W.S. McCullogh and W. Pitts in 1943 [2] and can be used in a variety of applications; however, there are problems that cannot be processed in a single network either because of their complexity or the amount of information they have; in these cases, a modular neural network (MNN) is used so that each of the modules is responsible for a sub-task or a part of the problem [37]. Therefore, it is necessary to have a mechanism to integrate information from different modules to provide the general solution to the problem.

In a MNN, it is common to use some methods such as fuzzy logic type 1 and type 2 [810], the fuzzy Sugeno integral [11], interval type 2 fuzzy logic Sugeno integral [12], a probabilistic sum integrator [13], a Bayesian learning method [14], among others, as shown in Fig. 1.

Fig. 1
figure 1

Methods for combining information from different sources

The Choquet integral is an aggregation operator, which has been successfully used in various applications [1517]. In this paper, the fuzzy Sugeno measures are represented by an interval type 2 fuzzy system in combination with the Choquet integral.

This paper is organized as follows: Sect. 2 shows the concepts of fuzzy measures, interval type 2 fuzzy measures, and Choquet integral which is the technique that was applied for the combination of the several information sources. Section 3 shows edge detection based on Sobel and morphological gradient with interval type 2 fuzzy system. Section 4 shows the modular neural network proposal, and in Sect. 5, the simulation results are shown. Finally, Sect. 6 shows the Conclusions.

2 Fuzzy Measures and Choquet Integral

Initially, Michio Sugeno defined the concept of “fuzzy measures and fuzzy integral” in 1974 [18]. A fuzzy measure is a non-negative monotone function of defined values in “classical sets.” Currently, when referring to this topic, the term “fuzzy measures” has been replaced by the term “monotonic measures,” “non-additive measures,” or “generalized measures” [1921]. When fuzzy measures are defined on fuzzy sets, we speak about monotonous fuzzified measures [21].

2.1 Fuzzy Measure

If \(x = \left\{ {x_{ 1} ,x_{ 2} , \ldots ,x_{n} } \right\}\) is a finite set, a fuzzy measure μ with respect to the data set X is a function \(\mu :2^{x} \to [0,1]\) that must satisfy the following conditions:

  1. (1)

    \(\mu\)(X) = 1; \(\mu\)(∅) = 0

  2. (2)

    If A ⊆ B, then \(\mu\)(A) ≤ \(\mu\)(B)

where in the second condition, A and B are subsets of X.

A fuzzy measure is a Sugeno measure or λ-fuzzy, if it satisfies condition (1) of addition for some λ > −1.

$$\mu (A \cup B) = \mu \left( A \right) + \mu \left( B \right) + \lambda \mu \left( A \right)\mu \left( B \right)$$
(1)

where \(\lambda\) can be calculated with (2):

$$f\left( \lambda \right) = \left\{ {\mathop \prod \limits_{i = 1}^{n} (1 + M_{i} (x_{i} )\lambda )} \right\} - (1 + \lambda )$$
(2)

The value of the λ parameter is determined by the conditions of the Theorem 1.

Theorem 1

Let \(\mu \left( {\left\{ x \right\}} \right) < 1\) for each x ∈ X and let \(\mu \left( {\left\{ x \right\}} \right) > 0\) for at least two elements of X, then ( 2 ) determines a unique parameter \(\lambda\) in the following way:

  • If \(\sum\limits_{x \in X} \mu \left( {\{ x\} } \right) < 1,\;then\;is\;in\;the\;interval\;(0,\infty ).\)

  • \(If\; \mathop \sum \limits_{x \in X} \mu \left( {\{ x\} } \right) = 1,\,then\;\lambda = 0;\) That is the unique root of the equation.

  • If \(\sum\limits_{x \in X} \mu \left( {\{ x\} } \right) > 1,\;then\;\lambda \;is\;in\;the\;interval\;( - 1,0).\)

The fuzzy measure represents the importance or relevance of the sources when computing the aggregation [ 22 ], and the method to calculate Sugeno measures is performed recursively using ( 3 ) and ( 4 ).

$$\mu (A_{1} ) = \mu (M_{1} )$$
(3)
$$\mu (A_{i} ) = \mu (A_{(i - 1)} ) + \mu (M_{i} ) + \left( {\lambda \mu (M_{i} ) *\mu (A_{{\left( {i - 1} \right)}} )} \right)$$
(4)

where \(A_{i}\) represents the fuzzy measure and \(M_{i}\) represents the fuzzy density determined by an expert, where \(1 < M_{i} \le \ldots \le n\) should be permuted with respect to the descending order of their respective \(\mu (A_{i} ).\)

2.2 Fuzzy Measures for Interval Type 2 Fuzzy Sets

For the estimation of the fuzzy densities of each information source, we take the maximum value of each X i , where an interval of uncertainty is added.

You need to add an uncertainty footprint or FOU which will create an interval based on the fuzzy density. Equation (5) can be used to approximate the center of the interval for each fuzzy density, and Eqs. (6) and (7) are used to estimate left and right values of the interval for each fuzzy density. Note that the domain for \(\mu_{L} (x_{i} )\) and \(\mu_{U} (x_{i} )\) is given in Theorem 1 [23].

Calculation of the fuzzy densities:

$$\mu_{c} \left( {x_{i} } \right) = \hbox{max} \left( {X_{i} } \right)$$
(5)
$$\mu_{L} \left( {x_{i} } \right) = \left\{ {\begin{array}{*{20}l} {\mu_{c} \left( {x_{i} } \right) - {\text{FOU}}_{\mu } /2;} \hfill & {{\text{if}}\;\mu_{c} \left( {x_{i} } \right) > {\text{FOU}}_{\mu } /2} \hfill \\ {0.0001} \hfill & {\text{otherwise}} \hfill \\ \end{array} } \right.$$
(6)
$$\mu_{U} \left( {x_{i} } \right) = \left\{ {\begin{array}{*{20}l} {\mu_{c} \left( {x_{i} } \right) + {\text{FOU}}_{\mu } /2;} \hfill & {{\text{if}}\;\mu_{c} \left( {x_{i} } \right) < (1 - {\text{FOU}}_{\mu } /2)} \hfill \\ {0.9999} \hfill & {\text{otherwise}} \hfill \\ \end{array} } \right.$$
(7)

Calculating the parameters \(\lambda_{L}\) and \(\lambda_{U}\) for each side of the interval with (8) and (9)

$$\lambda_{L} + 1 = \mathop \prod \limits_{i = 1}^{n} (1 + \lambda_{L} \mu_{L} \left( {\left\{ {x_{i} } \right\}} \right))$$
(8)
$$\lambda_{U} + 1 = \mathop \prod \limits_{i = 1}^{n} (1 + \lambda_{U} \mu_{U} \left( {\left\{ {x_{i} } \right\}} \right))$$
(9)

Once the λ U , λ L are obtained, parameters can be calculated fuzzy measures left and right by extending the recursive formulas (10, 11) (12, 13):

$$\mu_{L} \left( {A_{1} } \right) = \mu_{L} \left( {x_{1} } \right)$$
(10)
$$\mu_{L} \left( {A_{i} } \right) = \mu_{L} \left( {x_{i} } \right) + \mu_{L} \left( {A_{i - 1} } \right) + \lambda_{L} \mu_{L} \left( {x_{i} } \right)\mu_{L} \left( {A_{i - 1} } \right)$$
(11)
$$\mu_{U} \left( {A_{1} } \right) = \mu_{U} \left( {x_{1} } \right)$$
(12)
$$\mu_{U} \left( {A_{i} } \right) = \mu_{U} \left( {x_{i} } \right) + \mu_{U} \left( {A_{i - 1} } \right) + \lambda_{U} \mu_{U} \left( {x_{i} } \right)\mu_{U} \left( {A_{i - 1} } \right)$$
(13)

There are two types of integral that performed the calculation of Sugeno measures: the integral of Sugeno and Choquet Integral.

2.3 Choquet Integral

The Choquet integral can be calculated using (14) or an equivalent expression (15)

$${\text{Choquet}} = \mathop \sum \limits_{i = 1}^{n} \left\{ {\left[ {A_{i} - A_{(i - 1)} } \right]*D_{i} } \right\}$$
(14)

with A 0 = 0,

or also

$${\text{Choquet}} = \mathop \sum \limits_{i = 1}^{n} A_{i} *\left\{ {\left[ {D_{i} - D_{(i + 1)} } \right]} \right\}$$
(15)

with D (n+1) = 0,

where \(A_{i}\) represents the fuzzy measurement associated with data \(D_{i}\).

3 Edge Detection

Edge detection can be defined as a method consisting of identifying changes that exist in the light intensity, which can be used to determine certain properties or characteristics of the objects in the image.

We used the ORL Database of Faces [24] to perform the training of the modular neural network, which has images of 40 people with 10 samples of each individual. To each of the images was applied to a preprocessing by making use of Sobel edge detector and morphological gradient with type 1 and type 2 fuzzy logic system [25] in order to highlight features, some of the images can be displayed in Fig. 5b, d.

3.1 The Morphological Gradient

To perform the method of morphological gradient, we need to calculate every one of the four gradients as commonly done in the traditional method using (1620), see Fig. 2; however, the addition of the gradients is performed by a type 1 and type 2 fuzzy system [25]; in Fig. 3, the membership functions of the fuzzy system are shown, and the resulting image can be viewed in Fig. 5b, d.

Fig. 2
figure 2

Calculation of the gradient in the four directions

Fig. 3
figure 3

Variables for the edge detector of morphological gradient the type 2

$$D1 = \sqrt {\left( {z5 - z2} \right)^{2} + \left( {z5 - z8} \right)^{2} }$$
(16)
$$D2 = \sqrt {\left( {z5 - z4} \right)^{2} + \left( {z5 - z6} \right)^{2} }$$
(17)
$$D3 = \sqrt {\left( {z5 - z1} \right)^{2} + \left( {z5 - z9} \right)^{2} }$$
(18)
$$D4 = \sqrt {\left( {z5 - z7} \right)^{2} + \left( {z5 - z3} \right)^{2} }$$
(19)
$$G = D1 + D2 + D3 + D4$$
(20)

3.2 Sobel

The Sobel operator is applied to a digital image in gray scale is a pair of 3 × 3 convolution masks, one estimating the gradient in the x-direction (columns) (21) and the other estimating the gradient in the y-direction (rows) (22) [26].

$${\text{sobel}}_{x} = \left[ {\begin{array}{*{20}c} { - 1} & 0 & 1 \\ { - 2} & 0 & 2 \\ { - 1} & 0 & 1 \\ \end{array} } \right]$$
(21)
$${\text{sobel}}_{y} = \left[ {\begin{array}{*{20}c} 1 & 2 & 1 \\ 0 & 0 & 0 \\ { - 1} & { - 2} & { - 1} \\ \end{array} } \right]$$
(22)

If we have I m,n as a matrix of m rows and r columns, where the original image is stored, then g x and g y are matrices having the same dimensions as I, which at each element contains the horizontal and vertical derivative approximations and are calculated by (23) and (24) [25].

$$g_{x} = \mathop \sum \limits_{i = 1}^{i = 3} \mathop \sum \limits_{j = 1}^{j = 4} {\text{Sobel}}_{x,ij} *I_{r + i - 2,c + j - 2} \quad \begin{array}{*{20}c} {{\text{for}} = 1,2, \ldots ,m} \\ {{\text{for}} = 1,2, \ldots ,n} \\ \end{array}$$
(23)
$$g_{y} = \mathop \sum \limits_{i = 1}^{i = 3} \mathop \sum \limits_{j = 1}^{j = 4} {\text{Sobel}}_{y,i,j} *I_{r + i - 2,c + j - 2} \quad \begin{array}{*{20}c} {{\text{for}} = 1,2, \ldots ,m} \\ {{\text{for}} = 1,2, \ldots ,n} \\ \end{array}$$
(24)

In the Sobel method, the gradient magnitude g is calculated by (25).

$$g = \sqrt {g_{x}^{2} + g_{y}^{2} }$$
(25)

For the type 1 and type 2 fuzzy inference systems, 3 inputs can be used, in which 2 of them are the gradients with respect to the x-axis and y-axis, calculated with (23) and (24), which we call DH and DV, respectively. The third variable m is the image after the application of a low-pass filter hMF in (26); this filter allows to detect image pixels belonging to regions of the input where the mean gray level is lower. These regions are proportionally more affected by noise, which it is supposed to be uniformly distributed over the whole image [26]. The membership functions of interval type 2 system are shown in Fig. 4.

Fig. 4
figure 4

Variables for the edge detector with the type 2 fuzzy Sobel

$${\text{hMF}} = \frac{1}{25}*\left[ {\begin{array}{*{20}c} {\begin{array}{*{20}c} 1 & 1 & 1 \\ 1 & 1 & 1 \\ \end{array} } & {\begin{array}{*{20}c} 1 & 1 \\ 1 & 1 \\ \end{array} } \\ {\begin{array}{*{20}c} 1 & 1 & 1 \\ 1 & 1 & 1 \\ 1 & 1 & 1 \\ \end{array} } & {\begin{array}{*{20}c} 1 & 1 \\ 1 & 1 \\ 1 & 1 \\ \end{array} } \\ \end{array} } \right]$$
(26)

After applying the type 1 and type 2 edge detector with Sobel Method, the resulting image can be viewed in Fig. 5c, e.

Fig. 5
figure 5

a Original image, b image with edge detector type 1 morphological gradient, c image with edge detector type 1 Sobel, d image with interval type 2 morphological gradient, e image with edge detector interval type 2 Sobel

4 Modular Neural Networks

We trained a MNN of 3 modules with the data set of ORL. To each image, a methodology of edge detector was applied as described in Sect. 3 and then the image was divided into three horizontal sections, each of which was used as training data in each of the modules, as shown in Fig. 6.

Fig. 6
figure 6

Proposed architecture of the modular neural network

The integration of the modules of the MNN was performed with the Choquet integral (14) and (15). In Table 1, we can appreciate the data distribution of the database.

Table 1 Procedure performed in the experiment

4.1 Training Parameters

  • Training method: gradient descendent with momentum and adaptive learning rate back-propagation (Traingdx).

  • Each module of the MNN has two hidden layers [200 200].

  • Error goal: 0.00001.

  • Epochs: 500.

In Table 2, the distribution of the training data in the MNN is shown; 70 % of data are used for training, 15 % for validation, and the other 15 % for testing.

Table 2 Distribution of the training data

4.2 The Experiment Consists of a Modular Neural Network Recognition System and Choquet Integral for the Modules Fusion

The experiment consist on apply a preprocessing at the images through an edge detector on  database of faces ORL to obtain a data set with which we train a modular neural network, this with the purpose of compare the recognition rate obtained using the k-fold cross validation method [27], see Table 3.

Table 3 Procedure performed in the experiment

In the experiments, we performed 27 tests in each simulation of the trainings with each edge detector making variations in fuzzy densities and performing the calculation of the parameter λ U and λ L with the bisection method.

In Table 4, the parameters shown are used for the integration of information; the first column shows the tests number performed, the second shows the diffuse density associated with each information source—in this case each one of the 3 modules—and the third and fourth columns show the value of lambda for the upper λ U and lower λ L intervals calculated from the fuzzy densities.

Table 4 Parameters of the fuzzy densities, λ U and λ L

5 Simulation Results

In Table 5, are shown an example of the results obtained for face recognition. For this case, the preprocessing of the image is done with the interval type-2 morphological gradient edge detector, and the aggregation method used for the MNN is the interval type-2 Choquet integral.

Table 5 Results obtained in the experiment

In Table 6, the percentage of recognition of the Choquet integral with each interval edge detector is displayed, and a higher percentage of recognized with the usage of the type 2 edge detector with the gradient morphological was obtained with a 0.9549 %.

Table 6 Results with the Choquet integral using type 1 and type 2 edge detector

In Table 7, the percentage of recognition of the Choquet integral using interval fuzzy measures presents a small increase with respect to Choquet integral without interval fuzzy measures.

Table 7 Results with the Choquet integral using type 2 edge detector with interval fuzzy measures

6 Conclusions

The use of Choquet integral as an integration method of responses of a modular neural network applied to face recognition has yielded favorable results when performing the aggregation process of the preprocessed images with the detectors type 1 and type 2 of Sobel edges and morphological gradient; the use of the Sugeno measure by intervals allowed increase of the percentage of data recognition; however, it is still necessary to use a method that optimizes the value of the Sugeno measure assigned to each source of information, and also how to calculate the interval because these were designated arbitrarily. Future work could be considering the optimization of the proposed method, as in [2830].

7 Future Works

Although good results were obtained by applying the Choquet integral as an aggregation operator of the MNN, more testing is needed on other benchmark databases to verify results obtained also to find another way to generate an interval of uncertainty among the data, fuzzy measures, value of lambda, and fuzzy densities.