# Algorithm for Target Recognition Based on Interval-Valued Intuitionistic Fuzzy Sets with Grey Correlation

Authors: Xuan Huang; Lihong Guo; Jiang Li; Yang Yu
Journal: Mathematical Problems in Engineering
 (2016)

---

## Abstract

In order to improve exact recognition ratios for aerial targets, this paper presents a novel algorithm for target recognition based on interval-valued intuitionistic fuzzy sets with grey correlation. Drawbacks of some previously proposed methods are analyzed, and then a novel algorithm is presented. Recognition matrix of an aerial target is established first. Every entry associated with the matrix is an interval-valued intuitionistic fuzzy number, which is composed of interval-valued membership and nonmembership, representing the relation of the target to one category in terms of one characteristic parameter. Then grey correlation theory is used to analyze the recognition matrix to obtain the grey correlation degree of this unknown target to every category. 200 sets of target recognition data are used to compare the proposed algorithm with traditional methods. Experimental results verify that the correct recognition ratio can be up to 99.5% that satisfies the expectations, which shows the proposed algorithm can solve the target recognition problems better. The proposed algorithm can be used to solve the uncertain inference problems, such as target recognition, threat assessment, and decision making.


---

## Body

## 1. Introduction

Target recognition is the recognition and classification for the identity and characteristics of one target. Typically, it is in the first class level of JDL information fusion model. Whether the ground defense systems can recognize aerial targets quickly, reliably, and accurately, would directly affect the situation evaluation and threat assessment and finally has an influence on the allocation of defense power.Target recognition is to confirm the category and identity of an unknown target according to its feature parameters. Due to the uncertainties in feature values, most of target recognition methods were developed typically based on the uncertainty theory, for example, D-S evidence [1, 2], Bayesian inference [3, 4], attribute measure [5], and fuzzy set [6]. However, these methods describe uncertainty information with drawbacks that resulted in the errors. Also, they may highly depend on the a priori knowledge. Therefore these methods may lead to low recognition accuracy in inference results.Correlation analysis is a method that typically has a low requirement in the size of samples. It does not need any classical distribution laws in computation. Its results can match quite well the qualitative analysis. Therefore applying grey correlation theory in target recognition can guarantee the accuracy and real-time characteristics. In [7, 8], grey correlation analysis is used for target recognition by adopting the normalization of feature parameters to construct grey correlation coefficients and then giving a grey correlation sequence. The results show that the fairly accurate recognition ratios are obtained. But this method needs to compare the unknown target with the data chosen from the database. If some data in the database is not accurate enough, the recognition results would be incorrect.In recent times, intuitionistic fuzzy set (IFS) [9, 10] is widely used in various areas, such as multiple feature decisions [11], information fusion [12], and image processing [13]. On the basis of Zadeh’s fuzzy set (ZFS), nonmembership function is added in IFS, such that the utility of membership, nonmembership, and intuitionistic exponential can, respectively, signify the supportive, objective, and neutral characteristics. Thus IFS is able to describe the uncertainty information more flexibly and superiorly. In [14], IFS is introduced to accomplish target recognition through establishing a series of intuitionistic fuzzy inference rules. While IFS has quite high confidence, the issue becomes significantly difficult if there are numerous feature parameters. The likelihood of “combination explosion” enables the process complicated and impractical on real-world problems.Due to the complexity and uncertainty in practice, the values of membership and nonmembership mostly could not be represented by the real values. Consequently Atanassov extended the intuitionistic fuzzy sets to the interval-valued intuitionistic fuzzy sets [15, 16], using an interval to express the membership and nonmembership. The nature of uncertainty and fuzzy sets in objective things is described in more detail by using this new method. Interval-valued intuitionistic fuzzy set is also applied to various areas, for example, characteristic decision [17], logistic programming [18], and pattern recognition [19].Therefore, in order to improve exact recognition ratios for aerial targets and avoid the “combination explosion” problem caused by intuitionistic fuzzy inference, this paper proposes a new method based on the interval-valued intuitionistic fuzzy sets with grey correlation.Then the rest of paper is set out as follows. In Section2, target recognition problem is described, and limitations of known approaches to target recognition are analyzed. In Section 3, a novel algorithm based on interval-valued intuitionistic fuzzy sets with grey correlation is proposed, which is free of these limitations. Recognition matrix of an aerial target is established first, and then grey correlation theory is used to analyze the recognition matrix. In Section 4, the proposed algorithm is adopted in different target recognition experimentally and compared with other previous algorithms. Finally, the concluding section summarizes the paper.


## 2. Description of Target Recognition

Assuming that there aren categories of recognized targets for each of which k feature parameters are gained by using multiple sensors. All k feature parameters would be combined to form a feature vector that describes the target. In this paper, U
1
=
u
1
,
u
2
,
…
,
u
n and U
2
=
a
1
,
a
2
,
…
,
a
k are used to represent the target category set and target feature parameter set, respectively. Via measuring unknown target X, the measurements of X
=
x
1
,
x
2
,
…
,
x
k can be obtained. The so-called target recognition is actually that the feature parameter vector formed by measurements can be clustered to the most associated similar target category. Hence, the target recognition issue can be seen as a decision issue. By computing and analyzing the feature parameter X, the most matching target category u
i is directly chosen from target category set as the decisive result.Note that the targets investigated in this paper are aerial targets. In order to make recognizing targets typicality and to enhance the recognition efficiency, target categories are, respectively, bomber (B, asu
1), gunship (G, as u
2), tactical ballistic missile (TBM, as u
3), cruise missile (CM, as u
4), and air-to-ground guided missile (AGM, as u
5). In these five target categories, the bomber has a large volume of missiles and significantly high attacking capability, while gunship is of low penetration and speed even if with high attacking capability. The tactical ballistic missile can have a very fast speed and should be intercepted in a very short time. Also, the cruise missile has a low speed during the time of cruise, while the air-to-ground guided missile can be significantly fast with a small radar cross section area.As every target selected in this paper has its own prominent characteristics, the target feature parameter set can be set as follows:(1)
U
2
=
S
,
H
,
V
H
,
V
V
,
A
,where S represents the radiation cross section area of radar, H is the height of target, V
H indicates the cruise speed, V
V indicates the vertical speed, and A represents the acceleration of target.Recognizing an aerial target means the access to the feature parameters such as radiation cross section area, height of target, speed, and acceleration from sensors, and via the analyses and comparisons of these parameters, the membership of this target to each category is identified, resulting in suggesting the specific category the target should belong to.Grey correlation analysis method is applied to solve the target recognition problems. Guan and He [7] use this method to solve the radar emitter recognition problems, and Lin et al. [8] solve the radiation source recognition problems based on its improved method.The observing vector of one unknown target in terms of each characteristic parameter can be denoted byX
0
=
X
0
j
∣
j
=
1,2
,
…
,
5. Let M data sets that are known in the target recognition database be X
m
=
X
m
j
∣
j
=
1,2
,
…
,
5
m
=
1,2
,
…
,
M. Using grey correlation method to recognize target, the grey correlation degree between unknown target X
0 and each known data X
m should be calculated as follows:(2)
ξ
m
j
=
m
i
n
m
m
i
n
j
X
0
j
-
X
m
j
+
ρ
m
a
x
m
m
a
x
j
X
0
j
-
X
m
j
X
0
j
-
X
m
j
+
ρ
m
a
x
m
m
a
x
j
X
0
j
-
X
m
j
,where ρ is the resolution coefficient.Then the known data with highest grey correlation degree can be correlated with the unknown targetX
0.This approach using grey correlation is simple and effective to resolve the issue of some default characteristic parameters. This method, however, needs a lot of data in the target recognition database, such that the final recognition results heavily depend on the existing knowledge. Therefore, if some data in the database is not accurate enough, the recognition results would be incorrect.Another common method applied in target recognition problems is intuitionistic fuzzy inference, which is proposed by Lei et al. [14]. They first applies IFS to describe each characteristic parameter. The membership function and nonmembership function are chosen, based on which the inference rules can be established. Then, combining all inference rules terminally yields the target recognition results. The inference rules are established as follows:(3)
I
f
,
…
,
a
n
d
,
…
,
T
h
e
n
,
…
.Using the membership function and nonmembership function, IFS can describe uncertain information quite well. And the credible inference rules can be used to recognize target accurately. Thus more credible inference rules lead to more accurate recognition results. However, large numbers of categories of target characteristic parameters and intuition fuzzy sets result in the multiple increasing on the fuzzy inference rules, such that the issue of “combinatorial explosion” correspondingly comes out. Moreover, in practice, the membership or nonmembership may not be denoted by real values, which is a constraint of the proposed method. For solving this drawback, the interval-valued intuitionistic fuzzy sets can be applied to describe the uncertain information.Therefore, in order to combine the advantages of these two methods while improving their drawbacks, a novel algorithm or method should be proposed. The new method should describe uncertain feature and uncertain information just like the IFS method. Furthermore, interval-valued intuitionistic fuzzy sets can describe uncertain information better. On the other hand, the new method should have the ability to analyze uncertain information as grey correlation analysis method. So the algorithm for target recognition based on interval-valued intuitionistic fuzzy sets with grey correlation is proposed.


## 3. Algorithm of Interval-Valued Intuitionistic Fuzzy Sets with Grey Correlation

This section presents an algorithm for target recognition by combining interval-valued intuitionistic fuzzy sets with grey correlation. When using the proposed algorithm to recognize an unknown target, one should first establish a target recognition matrix composed of interval-valued intuitionistic fuzzy numbers. Each interval-valued intuitionistic fuzzy number represents the interval-valued membership and nonmembership of the unknown target to one category in terms of one characteristic parameter. In order to realize the recognition of this target, grey correlation method is used to analyze the target recognition matrix. Then grey correlation sequence is subsequently obtained. Figure1 shows the flow chart of the proposed algorithm.Figure 1
Flowchart of algorithm for target recognition.


### 3.1. Interval-Valued Intuitionistic Fuzzy Numbers

Assuming thatX is a constant domain, we say that(4)
A
=
x
,
μ
A
x
,
γ
A
x
∣
x
∈
Xis an intuitionistic fuzzy set on X. In this set, μ
A
:
X
→
0,1 and γ
A
:
X
→
0,1, respectively, represent the membership and nonmembership functions from x to A. Moreover, for all x
∈
X in A, 0
⩽
μ
A
(
x
)
+
γ
A
(
x
)
⩽
1 holds true.Due to the uncertainty of objective things, it is really difficult thatμ
A
(
x
) and γ
A
(
x
) can be expressed by exact real values. Therefore the interval values are introduced, which means that μ
A
(
x
) and γ
A
(
x
) are given by the interval values in the interval of [
0,1
]. Furthermore, for any x
∈
X, 0
⩽
sup
⁡
μ
A
x
+
sup
⁡
γ
A
x
⩽
1 holds true.Therefore, the sequential intervals formed by membership and nonmembership intervals are called interval-valued intuitionistic fuzzy number, which isa
,
b
,
c
,
d, where [
a
,
b
]
⊂
0,1 and [
c
,
d
]
⊂
0,1, b
+
d
⩽
1.


### 3.2. Interval-Valued Intuitionistic Fuzzy Recognition Matrix

The target recognition matrix of an unknown target is constructed as follows:(5)
R
=
α
i
j
n
×
k
i
=
1,2
,
…
,
n
;
j
=
1,2
,
…
,
k
,where α
i
j is an interval-valued intuitionistic fuzzy number, which is composed of the interval-valued membership and the interval-valued nonmembership of the unknown target to category u
i in terms of parameter a
j. It is shown that(6)
α
i
j
=
inf
⁡
μ
i
j
,
sup
⁡
μ
i
j
,
inf
⁡
γ
i
j
,
sup
⁡
γ
i
j
,where inf
⁡
μ
i
j and sup
⁡
μ
i
j, respectively, represent the lower bound and upper bound of membership interval of an unknown target to category u
i in terms of parameter a
j and inf
⁡
γ
i
j and sup
⁡
γ
i
j, respectively, represent the lower bound and upper bound of nonmembership interval of the target to category u
i in terms of parameter a
j.For instance,α
i
j
=
0.6,0.8
,
0.1,0.2 indicates via the feature parameter a
j the likelihood of recognizing an unknown target as u
i is between 60% and 80%, while the likelihood that the target does not belong to u
i is between 10% and 20%.The selection of upper and lower bounds is a significantly key part for the construction of target matrix. For example,μ
T
B
M
(
V
H
) represents the membership of an unknown target to TBM in terms of the cruise speed V
H, and γ
T
B
M
V
H represents the nonmembership of the unknown target to TBM in terms of the cruise speed V
H. Let V
H lie in [
0,3000
m
/
s
] as the speed of TBM is very fast, which is typically 4–6 times the speed of sound. By considering the nonlinearity of membership and nonmembership functions, the piecewise functions are applied to solve the upper bound and lower bound of μ
T
B
M
V
H and γ
T
B
M
V
H as follows:(7)
inf
⁡
μ
T
B
M
V
H
=
V
H
5000
,
V
H
⩽
1000
m
/
s
V
H
-
1000
1000
+
0.2
,
1000
m
/
s
<
V
H
⩽
1400
m
/
s
V
H
-
1400
1500
+
0.6
,
1400
m
/
s
<
V
H
⩽
1700
m
/
s
1700
-
V
H
1000
+
0.8
,
1700
m
/
s
<
V
H
⩽
2000
m
/
s
2000
-
V
H
2500
+
0.5
,
2000
m
/
s
<
V
H
⩽
3000
m
/
s
,
sup
⁡
μ
T
B
M
V
H
=
V
H
10000
+
0.2
,
V
H
⩽
1000
m
/
s
V
H
-
1000
1000
+
0.3
,
1000
m
/
s
<
V
H
⩽
1400
m
/
s
V
H
-
1400
1500
+
0.7
,
1400
m
/
s
<
V
H
⩽
1700
m
/
s
1700
-
V
H
1000
+
0.9
,
1700
m
/
s
<
V
H
⩽
2000
m
/
s
2000
-
V
H
2500
+
0.6
,
2000
m
/
s
<
V
H
⩽
3000
m
/
s
,
inf
⁡
γ
T
B
M
V
H
=
-
V
H
10000
+
0.7
,
V
H
⩽
1000
m
/
s
1000
-
V
H
1000
+
0.6
,
1000
m
/
s
<
V
H
⩽
1400
m
/
s
1400
-
V
H
1500
+
0.2
,
1400
m
/
s
<
V
H
⩽
1700
m
/
s
V
H
-
1700
1000
,
1700
m
/
s
<
V
H
⩽
2000
m
/
s
V
H
-
2000
2500
+
0.3
,
2000
m
/
s
<
V
H
⩽
3000
m
/
s
,
sup
⁡
γ
T
B
M
V
H
=
-
V
H
5000
+
0.9
,
V
H
⩽
1000
m
/
s
1000
-
V
H
1000
+
0.7
,
1000
m
/
s
<
V
H
⩽
1400
m
/
s
1400
-
V
H
1500
+
0.3
,
1400
m
/
s
<
V
H
⩽
1700
m
/
s
V
H
-
1700
1000
+
0.1
,
1700
m
/
s
<
V
H
⩽
2000
m
/
s
V
H
-
2000
2500
+
0.4
,
2000
m
/
s
<
V
H
⩽
3000
m
/
s
.When the cruise speed of one aerial target is known, based on it, the membership and nonmembership interval can be calculated according to (7). For example, when V
H
=
2000
m
/
s, (8) is obtained as follows:(8)
α
T
B
M
-
V
H
=
0.5,0.6
,
0.3,0.4
.Therefore, when the cruise speed is 2000 m/s, according to (8), the likelihood of recognizing this target as TBM via V
H is between 50% and 60%, while the impossibility is between 30% and 40%.Besides that, the TBM has the significant characteristics of small radiation cross section area, high vertical speed, and large height and acceleration. According to those characteristics, the upper and lower bounds of memberships and nonmemberships ofα
TBM-
S,  α
TBM-
H, α
TBM-
V
V and α
TBM-
A can be found typically.Also, the piecewise functions are applied to establish the upper bound and lower bound ofμ
A
G
M
H and γ
A
G
M
H as(9)
inf
⁡
μ
A
G
M
H
=
0
H
⩽
3000
m
H
-
3000
10000
3000
m
<
H
⩽
11000
m
11000
-
H
30000
+
0.8
11000
m
<
H
⩽
17000
m
17000
-
H
60000
+
0.6
H
⩾
17000
m
,
sup
⁡
μ
A
G
M
H
=
0.1
H
⩽
3000
m
H
-
3000
10000
+
0.1
3000
m
<
H
⩽
11000
m
11000
-
H
30000
+
0.9
11000
m
<
H
⩽
17000
m
17000
-
H
60000
+
0.7
H
⩾
17000
m
,
inf
⁡
γ
A
G
M
H
=
0.8
H
⩽
3000
m
3000
-
H
10000
+
0.8
3000
m
<
H
⩽
11000
m
H
-
11000
40000
11000
m
<
H
⩽
17000
m
H
-
17000
60000
+
0.15
H
>
17000
m
,
sup
⁡
γ
A
G
M
H
=
0.9
H
⩽
3000
m
3000
-
H
10000
+
0.9
3000
m
<
H
⩽
11000
m
H
-
11000
40000
+
0.1
11000
m
<
H
⩽
17000
m
H
-
17000
60000
+
0.25
H
>
17000
m
.Similarly, the memberships and nonmemberships of other categories can be established by the same method. This section would not present the details due to the paper space. Hence, all of the obtained interval-valued intuitionistic fuzzy numbers form the target recognition matrices of the unknown target.


### 3.3. Grey Correlation

In this part, grey correlation theory is used to analyze the recognition matrix established above.First, positive desired recognition strategy and negative desired recognition strategy of an unknown target are, respectively, built up. The positive desired recognition strategy is composed of the maximal number of each column of the recognition matrix, and the negative desired recognition strategy is composed of the minimal number of every column of the recognition matrix. So the score function and accuracy function are used to compare the interval-valued intuitionistic fuzzy numbers.Second, grey correlation coefficient matrix of the unknown target is built up. Each grey correlation coefficient is the relationship between each entry in the recognition matrix and each entry of desired recognition strategy. According to grey correlation analysis method, the grey correlation coefficient of every entry of the recognition matrix is calculated.Finally, grey correlation sequence of the unknown target is built up. Grey correlation sequence is composed of grey correlation degrees. Via the grey correlation coefficient matrix, the grey correlation degree of the unknown target to each category is calculated. The category which has the maximal grey correlation degree should be selected as the optimal recognition category.


#### 3.3.1. Desired Recognition Strategy

Definition 1 (score function and accuracy function).
Letα
=
a
,
b
,
c
,
d be an interval-valued intuitionistic fuzzy number. Its score function is defined as Δ
α
=
a
-
c
+
b
-
d
/
2, while the so-called accuracy function is H
α
=
a
+
c
+
b
+
d
/
2.Definition 2.
Assume thatα
1 and α
2 are two interval-valued intuitionistic fuzzy numbers. If Δ
α
1
<
Δ
α
2, then α
1
<
α
2. In particular, when Δ
α
1
=
Δ
α
2, if H
α
1
<
H
α
2, then α
1
<
α
2 holds.Definition 3 (positive and negative desired recognition strategies).
The interval-valued intuitionistic fuzzy vectors are as follows:(10)
x
+
=
α
1
+
,
α
2
+
,
…
,
α
k
+
,
x
-
=
α
1
-
,
α
2
-
,
…
,
α
k
-
,which are, respectively, positive and negative desired recognition strategies of the target recognition matrix α
i
j
n
×
k, if and only if(11)
α
j
+
=
m
a
x
i
α
i
j
j
=
1,2
,
…
,
k
,
α
j
-
=
m
i
n
i
α
i
j
j
=
1,2
,
…
,
khold true.From the definitions above, the scales of two interval-valued intuitionistic fuzzy numbers can be determined directly by the score and accuracy functions. It is typical that the associated fuzzy number would be larger with the larger score function, while if the score functions of two fuzzy numbers are equal, then the larger fuzzy sets are is only dependent on the larger accuracy function.Based on the determined rules described above, to solve the positive or negative desired strategy is necessarily to extract the maximal or minimal interval-valued intuitionistic fuzzy number in each column from the target recognition matrix.


#### 3.3.2. Grey Correlation Coefficient Matrix

After obtaining the positive and negative desired recognition strategies, this part calculates the grey correlation coefficient between each entry in the target recognition matrix and each entry of the strategy.Each grey correlation coefficient represents the proximity between each entry in the target recognition matrix and each entry of the strategy. The closerα
i
j and α
j
+ are, the farther α
i
j and α
j
- are, and the better will be.AsX
0
j
-
X
m
j in (2), the proximity between α
i
j and α
j
+ (α
j
-) should be calculated first. Let D
i
j
+
D
i
j
- represent the distance. Use the norms of interval values to calculate the distance as follows:(12)
D
i
j
+
=
D
i
j
+
α
i
j
,
α
j
+
=
1
4
inf
⁡
v
-
inf
⁡
μ
j
+
+
sup
⁡
μ
i
j
-
sup
⁡
μ
j
+
+
inf
⁡
γ
i
j
-
inf
⁡
γ
j
+
+
sup
⁡
γ
i
j
-
sup
⁡
γ
j
+
,
D
i
j
-
=
D
i
j
-
α
i
j
,
α
j
-
=
1
4
inf
⁡
μ
i
j
-
inf
⁡
μ
j
-
+
sup
⁡
μ
i
j
-
sup
⁡
μ
j
-
+
inf
⁡
γ
i
j
-
inf
⁡
γ
j
-
+
sup
⁡
γ
i
j
-
sup
⁡
γ
j
-
.Then distance matrixD
i
j
+
n
×
k consists of all of the distance D
i
j
+ between α
i
j and α
j
+. D
i
j
-
n
×
k consists of all of the distance D
i
j
- between α
i
j and α
j
-.And then,ξ
i
j
+ is defined as grey correlation coefficient between α
i
j and α
j
+. And ξ
i
j
- is coefficient between α
i
j and α
j
-. Using grey system theory and the distance matrices, the formula of grey correlation coefficients can be obtained as follows:(13)
ξ
i
j
+
=
m
i
n
i
,
j
D
i
j
+
+
ρ
m
a
x
i
,
j
D
i
j
+
D
i
j
+
+
ρ
m
a
x
i
,
j
D
i
j
+
,
(14)
ξ
i
j
-
=
m
i
n
i
,
j
D
i
j
-
+
ρ
m
a
x
i
,
j
D
i
j
-
D
i
j
-
+
ρ
m
a
x
i
,
j
D
i
j
-
,where ρ is the recognition coefficient that is typically 0.5.In (13), m
a
x
i
,
j
D
i
j
+ and m
i
n
i
,
j
D
i
j
+, respectively, represent the maximal and minimal element of the distance matrix D
i
j
+
n
×
k. In (14), m
a
x
i
,
j
D
i
j
- and m
i
n
i
,
j
D
i
j
-, respectively, represent the maximal and minimal element of the distance matrix D
i
j
-
n
×
k.All of grey correlation coefficients would form the grey correlation coefficient matrices; namely, that areξ
i
j
+
n
×
k and ξ
i
j
-
n
×
k.


#### 3.3.3. Grey Correlation Sequence

In this part, the grey correlation degree between each target categoryu
i and the positive or the negative desired strategy is calculated. By using the grey correlation coefficient matrices, the grey correlation degrees, λ
i
+ and λ
i
-, are calculated, respectively, as follows:(15)
λ
i
+
=
∑
j
=
1
k
ξ
i
j
+
a
j
,
λ
i
-
=
∑
j
=
1
k
ξ
i
j
-
a
j
,where a
j represents the weight of the feature parameter, and it follows the properties of a
j
⩾
0 and ∑
j
=
1
k
a
j
=
1.The special case is thata
j is 1
/
k, when the importance of each feature parameter is treated to be equal, which is naturally the averaged case. In practice, the selection of weights, however, enables the sum of errors to be minimal between the grey correlation degree of each target category and the grey correlation degree of desired recognition strategy, namely, which follows the optimization model:(16)
min
⁡
F
a
=
∑
i
=
1
n
∑
j
=
1
k
1
-
ξ
i
j
+
a
j
2
,
s.t.
∑
j
=
1
k
a
j
=
1
,
a
j
⩾
0
.By solving this model, we have(17)
a
j
=
∑
j
=
1
k
∑
i
=
1
n
1
-
ξ
i
j
+
2
-
1
-
1
∑
i
=
1
n
1
-
ξ
i
j
+
2
.Via (15)~(17), the grey correlation degree of each target category can be obtained. While λ
i
+ becomes larger and λ
i
- becomes smaller, the target category u
i is closer to the positive desired recognition strategy and more keeping away from the negative desired recognition strategy.Introduce another definition associated with comprehensive grey correlation degree as follows:(18)
d
i
=
λ
i
+
2
λ
i
+
2
+
λ
i
-
2
,which is typically used to represent the level that u
i belongs to the positive and negative desired recognition strategies. This comprehensive grey correlation degree also indicates that the target category u
i belongs to the positive desired recognition strategy with the level of d
i, while belonging to the negative desired recognition strategy with the level of 1
-
d
i. It is furthermore seen that the confidence increases that the target is recognized as u
i, when d
i increases.Then the grey correlation sequence of the unknown target can be obtained by descending the comprehensive grey correlation degrees. According to the maximal correlation recognition, the category which has the maximal comprehensive grey correlation would be recognized as the target category associated with the unknown target.


## 3.1. Interval-Valued Intuitionistic Fuzzy Numbers

Assuming thatX is a constant domain, we say that(4)
A
=
x
,
μ
A
x
,
γ
A
x
∣
x
∈
Xis an intuitionistic fuzzy set on X. In this set, μ
A
:
X
→
0,1 and γ
A
:
X
→
0,1, respectively, represent the membership and nonmembership functions from x to A. Moreover, for all x
∈
X in A, 0
⩽
μ
A
(
x
)
+
γ
A
(
x
)
⩽
1 holds true.Due to the uncertainty of objective things, it is really difficult thatμ
A
(
x
) and γ
A
(
x
) can be expressed by exact real values. Therefore the interval values are introduced, which means that μ
A
(
x
) and γ
A
(
x
) are given by the interval values in the interval of [
0,1
]. Furthermore, for any x
∈
X, 0
⩽
sup
⁡
μ
A
x
+
sup
⁡
γ
A
x
⩽
1 holds true.Therefore, the sequential intervals formed by membership and nonmembership intervals are called interval-valued intuitionistic fuzzy number, which isa
,
b
,
c
,
d, where [
a
,
b
]
⊂
0,1 and [
c
,
d
]
⊂
0,1, b
+
d
⩽
1.


## 3.2. Interval-Valued Intuitionistic Fuzzy Recognition Matrix

The target recognition matrix of an unknown target is constructed as follows:(5)
R
=
α
i
j
n
×
k
i
=
1,2
,
…
,
n
;
j
=
1,2
,
…
,
k
,where α
i
j is an interval-valued intuitionistic fuzzy number, which is composed of the interval-valued membership and the interval-valued nonmembership of the unknown target to category u
i in terms of parameter a
j. It is shown that(6)
α
i
j
=
inf
⁡
μ
i
j
,
sup
⁡
μ
i
j
,
inf
⁡
γ
i
j
,
sup
⁡
γ
i
j
,where inf
⁡
μ
i
j and sup
⁡
μ
i
j, respectively, represent the lower bound and upper bound of membership interval of an unknown target to category u
i in terms of parameter a
j and inf
⁡
γ
i
j and sup
⁡
γ
i
j, respectively, represent the lower bound and upper bound of nonmembership interval of the target to category u
i in terms of parameter a
j.For instance,α
i
j
=
0.6,0.8
,
0.1,0.2 indicates via the feature parameter a
j the likelihood of recognizing an unknown target as u
i is between 60% and 80%, while the likelihood that the target does not belong to u
i is between 10% and 20%.The selection of upper and lower bounds is a significantly key part for the construction of target matrix. For example,μ
T
B
M
(
V
H
) represents the membership of an unknown target to TBM in terms of the cruise speed V
H, and γ
T
B
M
V
H represents the nonmembership of the unknown target to TBM in terms of the cruise speed V
H. Let V
H lie in [
0,3000
m
/
s
] as the speed of TBM is very fast, which is typically 4–6 times the speed of sound. By considering the nonlinearity of membership and nonmembership functions, the piecewise functions are applied to solve the upper bound and lower bound of μ
T
B
M
V
H and γ
T
B
M
V
H as follows:(7)
inf
⁡
μ
T
B
M
V
H
=
V
H
5000
,
V
H
⩽
1000
m
/
s
V
H
-
1000
1000
+
0.2
,
1000
m
/
s
<
V
H
⩽
1400
m
/
s
V
H
-
1400
1500
+
0.6
,
1400
m
/
s
<
V
H
⩽
1700
m
/
s
1700
-
V
H
1000
+
0.8
,
1700
m
/
s
<
V
H
⩽
2000
m
/
s
2000
-
V
H
2500
+
0.5
,
2000
m
/
s
<
V
H
⩽
3000
m
/
s
,
sup
⁡
μ
T
B
M
V
H
=
V
H
10000
+
0.2
,
V
H
⩽
1000
m
/
s
V
H
-
1000
1000
+
0.3
,
1000
m
/
s
<
V
H
⩽
1400
m
/
s
V
H
-
1400
1500
+
0.7
,
1400
m
/
s
<
V
H
⩽
1700
m
/
s
1700
-
V
H
1000
+
0.9
,
1700
m
/
s
<
V
H
⩽
2000
m
/
s
2000
-
V
H
2500
+
0.6
,
2000
m
/
s
<
V
H
⩽
3000
m
/
s
,
inf
⁡
γ
T
B
M
V
H
=
-
V
H
10000
+
0.7
,
V
H
⩽
1000
m
/
s
1000
-
V
H
1000
+
0.6
,
1000
m
/
s
<
V
H
⩽
1400
m
/
s
1400
-
V
H
1500
+
0.2
,
1400
m
/
s
<
V
H
⩽
1700
m
/
s
V
H
-
1700
1000
,
1700
m
/
s
<
V
H
⩽
2000
m
/
s
V
H
-
2000
2500
+
0.3
,
2000
m
/
s
<
V
H
⩽
3000
m
/
s
,
sup
⁡
γ
T
B
M
V
H
=
-
V
H
5000
+
0.9
,
V
H
⩽
1000
m
/
s
1000
-
V
H
1000
+
0.7
,
1000
m
/
s
<
V
H
⩽
1400
m
/
s
1400
-
V
H
1500
+
0.3
,
1400
m
/
s
<
V
H
⩽
1700
m
/
s
V
H
-
1700
1000
+
0.1
,
1700
m
/
s
<
V
H
⩽
2000
m
/
s
V
H
-
2000
2500
+
0.4
,
2000
m
/
s
<
V
H
⩽
3000
m
/
s
.When the cruise speed of one aerial target is known, based on it, the membership and nonmembership interval can be calculated according to (7). For example, when V
H
=
2000
m
/
s, (8) is obtained as follows:(8)
α
T
B
M
-
V
H
=
0.5,0.6
,
0.3,0.4
.Therefore, when the cruise speed is 2000 m/s, according to (8), the likelihood of recognizing this target as TBM via V
H is between 50% and 60%, while the impossibility is between 30% and 40%.Besides that, the TBM has the significant characteristics of small radiation cross section area, high vertical speed, and large height and acceleration. According to those characteristics, the upper and lower bounds of memberships and nonmemberships ofα
TBM-
S,  α
TBM-
H, α
TBM-
V
V and α
TBM-
A can be found typically.Also, the piecewise functions are applied to establish the upper bound and lower bound ofμ
A
G
M
H and γ
A
G
M
H as(9)
inf
⁡
μ
A
G
M
H
=
0
H
⩽
3000
m
H
-
3000
10000
3000
m
<
H
⩽
11000
m
11000
-
H
30000
+
0.8
11000
m
<
H
⩽
17000
m
17000
-
H
60000
+
0.6
H
⩾
17000
m
,
sup
⁡
μ
A
G
M
H
=
0.1
H
⩽
3000
m
H
-
3000
10000
+
0.1
3000
m
<
H
⩽
11000
m
11000
-
H
30000
+
0.9
11000
m
<
H
⩽
17000
m
17000
-
H
60000
+
0.7
H
⩾
17000
m
,
inf
⁡
γ
A
G
M
H
=
0.8
H
⩽
3000
m
3000
-
H
10000
+
0.8
3000
m
<
H
⩽
11000
m
H
-
11000
40000
11000
m
<
H
⩽
17000
m
H
-
17000
60000
+
0.15
H
>
17000
m
,
sup
⁡
γ
A
G
M
H
=
0.9
H
⩽
3000
m
3000
-
H
10000
+
0.9
3000
m
<
H
⩽
11000
m
H
-
11000
40000
+
0.1
11000
m
<
H
⩽
17000
m
H
-
17000
60000
+
0.25
H
>
17000
m
.Similarly, the memberships and nonmemberships of other categories can be established by the same method. This section would not present the details due to the paper space. Hence, all of the obtained interval-valued intuitionistic fuzzy numbers form the target recognition matrices of the unknown target.


## 3.3. Grey Correlation

In this part, grey correlation theory is used to analyze the recognition matrix established above.First, positive desired recognition strategy and negative desired recognition strategy of an unknown target are, respectively, built up. The positive desired recognition strategy is composed of the maximal number of each column of the recognition matrix, and the negative desired recognition strategy is composed of the minimal number of every column of the recognition matrix. So the score function and accuracy function are used to compare the interval-valued intuitionistic fuzzy numbers.Second, grey correlation coefficient matrix of the unknown target is built up. Each grey correlation coefficient is the relationship between each entry in the recognition matrix and each entry of desired recognition strategy. According to grey correlation analysis method, the grey correlation coefficient of every entry of the recognition matrix is calculated.Finally, grey correlation sequence of the unknown target is built up. Grey correlation sequence is composed of grey correlation degrees. Via the grey correlation coefficient matrix, the grey correlation degree of the unknown target to each category is calculated. The category which has the maximal grey correlation degree should be selected as the optimal recognition category.


### 3.3.1. Desired Recognition Strategy

Definition 1 (score function and accuracy function).
Letα
=
a
,
b
,
c
,
d be an interval-valued intuitionistic fuzzy number. Its score function is defined as Δ
α
=
a
-
c
+
b
-
d
/
2, while the so-called accuracy function is H
α
=
a
+
c
+
b
+
d
/
2.Definition 2.
Assume thatα
1 and α
2 are two interval-valued intuitionistic fuzzy numbers. If Δ
α
1
<
Δ
α
2, then α
1
<
α
2. In particular, when Δ
α
1
=
Δ
α
2, if H
α
1
<
H
α
2, then α
1
<
α
2 holds.Definition 3 (positive and negative desired recognition strategies).
The interval-valued intuitionistic fuzzy vectors are as follows:(10)
x
+
=
α
1
+
,
α
2
+
,
…
,
α
k
+
,
x
-
=
α
1
-
,
α
2
-
,
…
,
α
k
-
,which are, respectively, positive and negative desired recognition strategies of the target recognition matrix α
i
j
n
×
k, if and only if(11)
α
j
+
=
m
a
x
i
α
i
j
j
=
1,2
,
…
,
k
,
α
j
-
=
m
i
n
i
α
i
j
j
=
1,2
,
…
,
khold true.From the definitions above, the scales of two interval-valued intuitionistic fuzzy numbers can be determined directly by the score and accuracy functions. It is typical that the associated fuzzy number would be larger with the larger score function, while if the score functions of two fuzzy numbers are equal, then the larger fuzzy sets are is only dependent on the larger accuracy function.Based on the determined rules described above, to solve the positive or negative desired strategy is necessarily to extract the maximal or minimal interval-valued intuitionistic fuzzy number in each column from the target recognition matrix.


### 3.3.2. Grey Correlation Coefficient Matrix

After obtaining the positive and negative desired recognition strategies, this part calculates the grey correlation coefficient between each entry in the target recognition matrix and each entry of the strategy.Each grey correlation coefficient represents the proximity between each entry in the target recognition matrix and each entry of the strategy. The closerα
i
j and α
j
+ are, the farther α
i
j and α
j
- are, and the better will be.AsX
0
j
-
X
m
j in (2), the proximity between α
i
j and α
j
+ (α
j
-) should be calculated first. Let D
i
j
+
D
i
j
- represent the distance. Use the norms of interval values to calculate the distance as follows:(12)
D
i
j
+
=
D
i
j
+
α
i
j
,
α
j
+
=
1
4
inf
⁡
v
-
inf
⁡
μ
j
+
+
sup
⁡
μ
i
j
-
sup
⁡
μ
j
+
+
inf
⁡
γ
i
j
-
inf
⁡
γ
j
+
+
sup
⁡
γ
i
j
-
sup
⁡
γ
j
+
,
D
i
j
-
=
D
i
j
-
α
i
j
,
α
j
-
=
1
4
inf
⁡
μ
i
j
-
inf
⁡
μ
j
-
+
sup
⁡
μ
i
j
-
sup
⁡
μ
j
-
+
inf
⁡
γ
i
j
-
inf
⁡
γ
j
-
+
sup
⁡
γ
i
j
-
sup
⁡
γ
j
-
.Then distance matrixD
i
j
+
n
×
k consists of all of the distance D
i
j
+ between α
i
j and α
j
+. D
i
j
-
n
×
k consists of all of the distance D
i
j
- between α
i
j and α
j
-.And then,ξ
i
j
+ is defined as grey correlation coefficient between α
i
j and α
j
+. And ξ
i
j
- is coefficient between α
i
j and α
j
-. Using grey system theory and the distance matrices, the formula of grey correlation coefficients can be obtained as follows:(13)
ξ
i
j
+
=
m
i
n
i
,
j
D
i
j
+
+
ρ
m
a
x
i
,
j
D
i
j
+
D
i
j
+
+
ρ
m
a
x
i
,
j
D
i
j
+
,
(14)
ξ
i
j
-
=
m
i
n
i
,
j
D
i
j
-
+
ρ
m
a
x
i
,
j
D
i
j
-
D
i
j
-
+
ρ
m
a
x
i
,
j
D
i
j
-
,where ρ is the recognition coefficient that is typically 0.5.In (13), m
a
x
i
,
j
D
i
j
+ and m
i
n
i
,
j
D
i
j
+, respectively, represent the maximal and minimal element of the distance matrix D
i
j
+
n
×
k. In (14), m
a
x
i
,
j
D
i
j
- and m
i
n
i
,
j
D
i
j
-, respectively, represent the maximal and minimal element of the distance matrix D
i
j
-
n
×
k.All of grey correlation coefficients would form the grey correlation coefficient matrices; namely, that areξ
i
j
+
n
×
k and ξ
i
j
-
n
×
k.


### 3.3.3. Grey Correlation Sequence

In this part, the grey correlation degree between each target categoryu
i and the positive or the negative desired strategy is calculated. By using the grey correlation coefficient matrices, the grey correlation degrees, λ
i
+ and λ
i
-, are calculated, respectively, as follows:(15)
λ
i
+
=
∑
j
=
1
k
ξ
i
j
+
a
j
,
λ
i
-
=
∑
j
=
1
k
ξ
i
j
-
a
j
,where a
j represents the weight of the feature parameter, and it follows the properties of a
j
⩾
0 and ∑
j
=
1
k
a
j
=
1.The special case is thata
j is 1
/
k, when the importance of each feature parameter is treated to be equal, which is naturally the averaged case. In practice, the selection of weights, however, enables the sum of errors to be minimal between the grey correlation degree of each target category and the grey correlation degree of desired recognition strategy, namely, which follows the optimization model:(16)
min
⁡
F
a
=
∑
i
=
1
n
∑
j
=
1
k
1
-
ξ
i
j
+
a
j
2
,
s.t.
∑
j
=
1
k
a
j
=
1
,
a
j
⩾
0
.By solving this model, we have(17)
a
j
=
∑
j
=
1
k
∑
i
=
1
n
1
-
ξ
i
j
+
2
-
1
-
1
∑
i
=
1
n
1
-
ξ
i
j
+
2
.Via (15)~(17), the grey correlation degree of each target category can be obtained. While λ
i
+ becomes larger and λ
i
- becomes smaller, the target category u
i is closer to the positive desired recognition strategy and more keeping away from the negative desired recognition strategy.Introduce another definition associated with comprehensive grey correlation degree as follows:(18)
d
i
=
λ
i
+
2
λ
i
+
2
+
λ
i
-
2
,which is typically used to represent the level that u
i belongs to the positive and negative desired recognition strategies. This comprehensive grey correlation degree also indicates that the target category u
i belongs to the positive desired recognition strategy with the level of d
i, while belonging to the negative desired recognition strategy with the level of 1
-
d
i. It is furthermore seen that the confidence increases that the target is recognized as u
i, when d
i increases.Then the grey correlation sequence of the unknown target can be obtained by descending the comprehensive grey correlation degrees. According to the maximal correlation recognition, the category which has the maximal comprehensive grey correlation would be recognized as the target category associated with the unknown target.


## 3.3.1. Desired Recognition Strategy

Definition 1 (score function and accuracy function).
Letα
=
a
,
b
,
c
,
d be an interval-valued intuitionistic fuzzy number. Its score function is defined as Δ
α
=
a
-
c
+
b
-
d
/
2, while the so-called accuracy function is H
α
=
a
+
c
+
b
+
d
/
2.Definition 2.
Assume thatα
1 and α
2 are two interval-valued intuitionistic fuzzy numbers. If Δ
α
1
<
Δ
α
2, then α
1
<
α
2. In particular, when Δ
α
1
=
Δ
α
2, if H
α
1
<
H
α
2, then α
1
<
α
2 holds.Definition 3 (positive and negative desired recognition strategies).
The interval-valued intuitionistic fuzzy vectors are as follows:(10)
x
+
=
α
1
+
,
α
2
+
,
…
,
α
k
+
,
x
-
=
α
1
-
,
α
2
-
,
…
,
α
k
-
,which are, respectively, positive and negative desired recognition strategies of the target recognition matrix α
i
j
n
×
k, if and only if(11)
α
j
+
=
m
a
x
i
α
i
j
j
=
1,2
,
…
,
k
,
α
j
-
=
m
i
n
i
α
i
j
j
=
1,2
,
…
,
khold true.From the definitions above, the scales of two interval-valued intuitionistic fuzzy numbers can be determined directly by the score and accuracy functions. It is typical that the associated fuzzy number would be larger with the larger score function, while if the score functions of two fuzzy numbers are equal, then the larger fuzzy sets are is only dependent on the larger accuracy function.Based on the determined rules described above, to solve the positive or negative desired strategy is necessarily to extract the maximal or minimal interval-valued intuitionistic fuzzy number in each column from the target recognition matrix.


## 3.3.2. Grey Correlation Coefficient Matrix

After obtaining the positive and negative desired recognition strategies, this part calculates the grey correlation coefficient between each entry in the target recognition matrix and each entry of the strategy.Each grey correlation coefficient represents the proximity between each entry in the target recognition matrix and each entry of the strategy. The closerα
i
j and α
j
+ are, the farther α
i
j and α
j
- are, and the better will be.AsX
0
j
-
X
m
j in (2), the proximity between α
i
j and α
j
+ (α
j
-) should be calculated first. Let D
i
j
+
D
i
j
- represent the distance. Use the norms of interval values to calculate the distance as follows:(12)
D
i
j
+
=
D
i
j
+
α
i
j
,
α
j
+
=
1
4
inf
⁡
v
-
inf
⁡
μ
j
+
+
sup
⁡
μ
i
j
-
sup
⁡
μ
j
+
+
inf
⁡
γ
i
j
-
inf
⁡
γ
j
+
+
sup
⁡
γ
i
j
-
sup
⁡
γ
j
+
,
D
i
j
-
=
D
i
j
-
α
i
j
,
α
j
-
=
1
4
inf
⁡
μ
i
j
-
inf
⁡
μ
j
-
+
sup
⁡
μ
i
j
-
sup
⁡
μ
j
-
+
inf
⁡
γ
i
j
-
inf
⁡
γ
j
-
+
sup
⁡
γ
i
j
-
sup
⁡
γ
j
-
.Then distance matrixD
i
j
+
n
×
k consists of all of the distance D
i
j
+ between α
i
j and α
j
+. D
i
j
-
n
×
k consists of all of the distance D
i
j
- between α
i
j and α
j
-.And then,ξ
i
j
+ is defined as grey correlation coefficient between α
i
j and α
j
+. And ξ
i
j
- is coefficient between α
i
j and α
j
-. Using grey system theory and the distance matrices, the formula of grey correlation coefficients can be obtained as follows:(13)
ξ
i
j
+
=
m
i
n
i
,
j
D
i
j
+
+
ρ
m
a
x
i
,
j
D
i
j
+
D
i
j
+
+
ρ
m
a
x
i
,
j
D
i
j
+
,
(14)
ξ
i
j
-
=
m
i
n
i
,
j
D
i
j
-
+
ρ
m
a
x
i
,
j
D
i
j
-
D
i
j
-
+
ρ
m
a
x
i
,
j
D
i
j
-
,where ρ is the recognition coefficient that is typically 0.5.In (13), m
a
x
i
,
j
D
i
j
+ and m
i
n
i
,
j
D
i
j
+, respectively, represent the maximal and minimal element of the distance matrix D
i
j
+
n
×
k. In (14), m
a
x
i
,
j
D
i
j
- and m
i
n
i
,
j
D
i
j
-, respectively, represent the maximal and minimal element of the distance matrix D
i
j
-
n
×
k.All of grey correlation coefficients would form the grey correlation coefficient matrices; namely, that areξ
i
j
+
n
×
k and ξ
i
j
-
n
×
k.


## 3.3.3. Grey Correlation Sequence

In this part, the grey correlation degree between each target categoryu
i and the positive or the negative desired strategy is calculated. By using the grey correlation coefficient matrices, the grey correlation degrees, λ
i
+ and λ
i
-, are calculated, respectively, as follows:(15)
λ
i
+
=
∑
j
=
1
k
ξ
i
j
+
a
j
,
λ
i
-
=
∑
j
=
1
k
ξ
i
j
-
a
j
,where a
j represents the weight of the feature parameter, and it follows the properties of a
j
⩾
0 and ∑
j
=
1
k
a
j
=
1.The special case is thata
j is 1
/
k, when the importance of each feature parameter is treated to be equal, which is naturally the averaged case. In practice, the selection of weights, however, enables the sum of errors to be minimal between the grey correlation degree of each target category and the grey correlation degree of desired recognition strategy, namely, which follows the optimization model:(16)
min
⁡
F
a
=
∑
i
=
1
n
∑
j
=
1
k
1
-
ξ
i
j
+
a
j
2
,
s.t.
∑
j
=
1
k
a
j
=
1
,
a
j
⩾
0
.By solving this model, we have(17)
a
j
=
∑
j
=
1
k
∑
i
=
1
n
1
-
ξ
i
j
+
2
-
1
-
1
∑
i
=
1
n
1
-
ξ
i
j
+
2
.Via (15)~(17), the grey correlation degree of each target category can be obtained. While λ
i
+ becomes larger and λ
i
- becomes smaller, the target category u
i is closer to the positive desired recognition strategy and more keeping away from the negative desired recognition strategy.Introduce another definition associated with comprehensive grey correlation degree as follows:(18)
d
i
=
λ
i
+
2
λ
i
+
2
+
λ
i
-
2
,which is typically used to represent the level that u
i belongs to the positive and negative desired recognition strategies. This comprehensive grey correlation degree also indicates that the target category u
i belongs to the positive desired recognition strategy with the level of d
i, while belonging to the negative desired recognition strategy with the level of 1
-
d
i. It is furthermore seen that the confidence increases that the target is recognized as u
i, when d
i increases.Then the grey correlation sequence of the unknown target can be obtained by descending the comprehensive grey correlation degrees. According to the maximal correlation recognition, the category which has the maximal comprehensive grey correlation would be recognized as the target category associated with the unknown target.


## 4. Application of the Proposed Algorithm

### 4.1. Target Recognition Processing Software

Based on the proposed algorithm presented before, a target recognition processing software is established by plugging the membership and nonmembership functions into the software. Then defining the feature parameters of targets as inputs the target recognition matrices, positive and negative desired recognition strategies, grey correlation coefficient matrices, and grey correlation degrees can be subsequently calculated. And after that the final output is the grey correlation sequence of each target category. The final recognition strategy is the maximal grey correlation sequence that is the tool to determine the target category. Figure2 shows the flow chart of the proposed software.Figure 2
Flowchart of software for target recognition.In order to validate the efficacy and stability of the proposed algorithm this paper uses 200 sets of feature parameters selected randomly according to the uniform distribution from the database as inputs to testify the processing capability of the software. These 200 sets of feature parameters correspond, respectively, to the proposed 5 target categories, which means every 40 sets of data would be for each target category. Part of measured raw data is shown in Table1.Table 1
Part of original data.
S (m2)
H (m)
V
V (m/s)
V
H (m/s)
A (m/s2)
Recognition result
1
0.5
35000
1800
2000
350
u
3
2
0.6
40000
2000
1950
420
u
3
3
10
15000
250
8
0.5
u
1
4
15
12000
270
10
0.7
u
1
5
0.44
90
340
0
0.2
u
4
6
0.67
75
300
0
0.15
u
4
7
5
3000
70
10
0.5
u
2
8
3
2000
60
12
0.4
u
2
9
0.7
10000
1400
1500
400
u
5
10
0.8
11000
1500
1300
390
u
5Consider the 1st feature parameter vector as an example in Table1 as follows:(19)
0.5,35000,1800,2000,350which represents that the radiation cross section area of this target is 0.5 m2; the height of the target is 35000 m; its cruise speed is 1800 m/s; its vertical speed is 2000 m/s; and acceleration is 350 m/s2. This section uses this vector as an example to illustrate the algorithm process of the target recognition processing software.(1) Target Recognition Matrix. Using the mentioned membership and nonmembership interval-valued intuitionistic fuzzy functions, the target recognition matrix of relevance is constructed as follows:(20)
R
=
0.05,0.15
,
0.6,0.7
0.35,0.45
,
0.4,0.5
0.11,0.21
,
0.69,0.79
0.1,0.2
,
0.7,0.8
0.1,0.2
,
0.7,0.8
0,0.1
,
0.65,0.75
0.1,0.2
,
0.7,0.8
0.05,0.15
,
0.7,0.8
0.02,0.12
,
0.78,0.88
0.1,0.2
,
0.65,0.75
0.55,0.65
,
0.1,0.2
0.7,0.8
,
0.1,0.2
0.7,0.8
,
0.1,0.2
0.7,0.8
,
0.1,0.2
0.7,0.8
,
0.1,0.2
0.65,0.75
,
0,0.1
0,0.1
,
0.7,0.8
0.17,0.27
,
0.58,0.68
0,0.1
,
0.75,0.85
0,0.1
,
0.7,0.8
0.6,0.7
,
0.05,0.15
0.3,0.4
,
0.45,0.55
0.5,0.6
,
0.3,0.4
0.6,0.7
,
0.2,0.3
0.8,0.9
,
0,0.1
.(2) Desired Recognition Strategies.
0.65,0.75
,
0,0.1 is the maximal entries of the first column of the target recognition matrix. And 0.7,0.8
,
0.1,0.2, 0.7,0.8
,
0.1,0.2, 0.7,0.8
,
0.1,0.2, and 0.8,0.9
,
0,0.1 are, respectively, the maximal entries of other four columns.0,0.1
,
0.65,0.75 is the minimal entries of the first column of the target recognition matrix. And 0,0.1
,
0.7,0.8, 0.05,0.15
,
0.7,0.8, 0.02,0.12
,
0.78,0.88, and 0,0.1
,
0.7,0.8 are, respectively, the minimal entries of other four columns.Therefore the positive and negative desired recognition strategies can be gained by adopting score function and accuracy function as follows:(21)
x
+
=
0.65,0.75
,
0,0.1
,
0.7,0.8
,
0.1,0.2
,
0.7,0.8
,
0.1,0.2
,
0.7,0.8
,
0.1,0.2
,
0.8,0.9
,
0,0.1
,
x
-
=
0,0.1
,
0.65,0.75
,
0,0.1
,
0.7,0.8
,
0.05,0.15
,
0.7,0.8
,
0.02,0.12
,
0.78,0.88
,
0,0.1
,
0.7,0.8
.(3) Grey Correlation Coefficient Matrix. Then (12) are applied to compute the distance matrices:(22)
D
+
=
D
i
j
+
n
×
k
=
0.6
0.325
0.59
0.6
0.7
0.65
0.6
0.625
0.68
0.675
0.1
0
0
0
0.1
0
0.65
0.505
0.675
0.7
0.05
0.375
0.2
0.1
0
,
D
-
=
D
i
j
-
n
×
k
=
0.05
0.325
0.035
0.08
0.05
0
0.05
0
0
0.075
0.55
0.65
0.625
0.68
0.65
0.65
0
0.12
0.025
0
0.6
0.275
0.425
0.58
0.75
.From (22), the maximal entry of the distance matrix D
+ is 0.7, and the minimal entry is 0. So m
a
x
i
,
j
D
i
j
+
=
0.7 and m
i
n
i
,
j
D
i
j
+
=
0. On the other hand, m
a
x
i
,
j
D
i
j
-
=
0.75 and m
i
n
i
,
j
D
i
j
-
=
0.The distance matrices and grey correlation coefficients yield the grey correlation coefficient matrices of the target as follows:(23)
ξ
+
=
ξ
i
j
+
n
×
k
=
0.3684
0.5185
0.3723
0.3684
0.3333
0.35
0.3684
0.3590
0.3398
0.3415
0.7778
1
1
1
0.7778
1
0.35
0.4094
0.3415
0.3333
0.875
0.4828
0.6364
0.7778
1
,
ξ
-
=
ξ
i
j
-
n
×
k
=
0.8824
0.5357
0.9146
0.8242
0.8824
1
0.8824
1
1
0.8333
0.4054
0.3659
0.375
0.3555
0.3659
0.3659
1
0.7576
0.9375
1
0.3846
0.5769
0.4688
0.3927
0.3333
.(4) Grey Correlation Sequence. By substituting the correlation coefficient matrix (23) into (17), the weights of feature parameters are represented by the following vector:(24)
a
=
a
1
,
a
2
,
a
3
,
a
4
,
a
5
T
=
0.2718
0.1824
0.1874
0.1828
0.1756
T
.By substituting (24) into (15), the grey correlation degree between each target category and the positive desired recognition strategy is(25)
λ
+
=
λ
i
+
n
×
1
=
0.3903
0.3517
0.9006
0.5333
0
.
7629
T
,and the grey correlation degree between each target category and the negative desired recognition strategy is(26)
λ
-
=
λ
i
-
n
×
1
=
0.8146
0.9493
0.3764
0.7708
0.4279
T
.Using (18), the comprehensive correlation degree of each target category can be calculated as follows:(27)
d
=
d
i
n
×
1
=
0.1867
0.1206
0.8513
0.3237
0.8180
T
.Hence, the sequence isd
3
>
d
5
>
d
4
>
d
1
>
d
2. The comprehensive correlation degree d
3 corresponding to the target category u
3 is maximal. It means that according to the five feature parameters the unknown target is closest to the feature parameters of TBM. It also demonstrates that the strategy of recognizing the unknown target as the TBM is the best.The radiation reflection cross section area of this target is 1 to 2 magnitudes smaller than that of the airplane, while the cruise and vertical speeds are comparatively bigger. Moreover, the height is in a very high degree and acceleration is approximately 1 mach. Each feature parameter of the unknown target matches quite well the feature parameters of TBM. The category of this target in the target recognition database is consistent with the recognition result by the interval-valued intuitionistic fuzzy sets with grey correlation algorithm. Such result also signifies that the proposed algorithm in this paper has good accuracy and high adaptation.Table1 lists each recognition result for each target. All of recognition results are consistent with the categories in the target recognition database. Therefore this proposed algorithm can be of stability in multiple target recognition problems.


### 4.2. Comparisons with Other Algorithms

Using the selected 200 data sets, the proposed algorithm in this paper is, respectively, compared to target recognition algorithms based on grey correlation [7] and intuitionistic fuzzy inference [14].For intuitionistic fuzzy inference algorithm, the five parameters in (1) are similarly selected as the feature parameters. The numbers of membership functions are, respectively, 3, 5, 6, 4, and 4. Therefore in this algorithm, the number of inference rules is up to 3
×
5
×
6
×
4
×
4
=
1440.Table2 displays the experimental results by using three algorithms.Table 2
Comparison of recognition results.
Number
Algorithm
Correct recognition ratio (%)
Algorithm 1
Grey correlation
92.5
Algorithm 2
Intuitionistic fuzzy inference
96.5
Algorithm 3
The proposed algorithm
99.5According to Table2, for the target recognition issue, the proposed algorithm in this paper based on interval-valued intuitionistic fuzzy sets with grey correlation has a higher recognition ratio than that of algorithm 1 and algorithm 2. This experiment also typically verifies that the algorithm is capable of dealing with the target recognition problems with uncertain information. The recognition results are closer to the practical cases.Moreover, due to the numerous inference rules in algorithm 2, while the number of feature parameters increases, the number of inference rules will correspondingly increase in times. In such a case the issue of combination explosion easily comes up. However, for the proposed algorithm in this paper, only 25 membership and 25 nonmembership functions are needed. These functions are used for constructing a target recognition matrix, and the rest of algorithm processing is just element extractions and matrices computation for the target recognition matrix. Therefore, comparing with algorithm 2, algorithm 3 is more concise and simpler in algorithm construction and software compiling and as well can effectively avoid the issue of combination explosion.According to the examples shown above, the novel method can describe the uncertain feature or uncertain information quite well. On the other hand, it has a good ability to analyze the uncertain information. Therefore the proposed method can be used to deal with the uncertain inference problems, such as the target recognition problems, the threat assessment problems, and the decision making problems. It can construct a relation between the feature parameters and the decision results based on the interval-valued intuitionistic fuzzy sets with grey correlation method.


## 4.1. Target Recognition Processing Software

Based on the proposed algorithm presented before, a target recognition processing software is established by plugging the membership and nonmembership functions into the software. Then defining the feature parameters of targets as inputs the target recognition matrices, positive and negative desired recognition strategies, grey correlation coefficient matrices, and grey correlation degrees can be subsequently calculated. And after that the final output is the grey correlation sequence of each target category. The final recognition strategy is the maximal grey correlation sequence that is the tool to determine the target category. Figure2 shows the flow chart of the proposed software.Figure 2
Flowchart of software for target recognition.In order to validate the efficacy and stability of the proposed algorithm this paper uses 200 sets of feature parameters selected randomly according to the uniform distribution from the database as inputs to testify the processing capability of the software. These 200 sets of feature parameters correspond, respectively, to the proposed 5 target categories, which means every 40 sets of data would be for each target category. Part of measured raw data is shown in Table1.Table 1
Part of original data.
S (m2)
H (m)
V
V (m/s)
V
H (m/s)
A (m/s2)
Recognition result
1
0.5
35000
1800
2000
350
u
3
2
0.6
40000
2000
1950
420
u
3
3
10
15000
250
8
0.5
u
1
4
15
12000
270
10
0.7
u
1
5
0.44
90
340
0
0.2
u
4
6
0.67
75
300
0
0.15
u
4
7
5
3000
70
10
0.5
u
2
8
3
2000
60
12
0.4
u
2
9
0.7
10000
1400
1500
400
u
5
10
0.8
11000
1500
1300
390
u
5Consider the 1st feature parameter vector as an example in Table1 as follows:(19)
0.5,35000,1800,2000,350which represents that the radiation cross section area of this target is 0.5 m2; the height of the target is 35000 m; its cruise speed is 1800 m/s; its vertical speed is 2000 m/s; and acceleration is 350 m/s2. This section uses this vector as an example to illustrate the algorithm process of the target recognition processing software.(1) Target Recognition Matrix. Using the mentioned membership and nonmembership interval-valued intuitionistic fuzzy functions, the target recognition matrix of relevance is constructed as follows:(20)
R
=
0.05,0.15
,
0.6,0.7
0.35,0.45
,
0.4,0.5
0.11,0.21
,
0.69,0.79
0.1,0.2
,
0.7,0.8
0.1,0.2
,
0.7,0.8
0,0.1
,
0.65,0.75
0.1,0.2
,
0.7,0.8
0.05,0.15
,
0.7,0.8
0.02,0.12
,
0.78,0.88
0.1,0.2
,
0.65,0.75
0.55,0.65
,
0.1,0.2
0.7,0.8
,
0.1,0.2
0.7,0.8
,
0.1,0.2
0.7,0.8
,
0.1,0.2
0.7,0.8
,
0.1,0.2
0.65,0.75
,
0,0.1
0,0.1
,
0.7,0.8
0.17,0.27
,
0.58,0.68
0,0.1
,
0.75,0.85
0,0.1
,
0.7,0.8
0.6,0.7
,
0.05,0.15
0.3,0.4
,
0.45,0.55
0.5,0.6
,
0.3,0.4
0.6,0.7
,
0.2,0.3
0.8,0.9
,
0,0.1
.(2) Desired Recognition Strategies.
0.65,0.75
,
0,0.1 is the maximal entries of the first column of the target recognition matrix. And 0.7,0.8
,
0.1,0.2, 0.7,0.8
,
0.1,0.2, 0.7,0.8
,
0.1,0.2, and 0.8,0.9
,
0,0.1 are, respectively, the maximal entries of other four columns.0,0.1
,
0.65,0.75 is the minimal entries of the first column of the target recognition matrix. And 0,0.1
,
0.7,0.8, 0.05,0.15
,
0.7,0.8, 0.02,0.12
,
0.78,0.88, and 0,0.1
,
0.7,0.8 are, respectively, the minimal entries of other four columns.Therefore the positive and negative desired recognition strategies can be gained by adopting score function and accuracy function as follows:(21)
x
+
=
0.65,0.75
,
0,0.1
,
0.7,0.8
,
0.1,0.2
,
0.7,0.8
,
0.1,0.2
,
0.7,0.8
,
0.1,0.2
,
0.8,0.9
,
0,0.1
,
x
-
=
0,0.1
,
0.65,0.75
,
0,0.1
,
0.7,0.8
,
0.05,0.15
,
0.7,0.8
,
0.02,0.12
,
0.78,0.88
,
0,0.1
,
0.7,0.8
.(3) Grey Correlation Coefficient Matrix. Then (12) are applied to compute the distance matrices:(22)
D
+
=
D
i
j
+
n
×
k
=
0.6
0.325
0.59
0.6
0.7
0.65
0.6
0.625
0.68
0.675
0.1
0
0
0
0.1
0
0.65
0.505
0.675
0.7
0.05
0.375
0.2
0.1
0
,
D
-
=
D
i
j
-
n
×
k
=
0.05
0.325
0.035
0.08
0.05
0
0.05
0
0
0.075
0.55
0.65
0.625
0.68
0.65
0.65
0
0.12
0.025
0
0.6
0.275
0.425
0.58
0.75
.From (22), the maximal entry of the distance matrix D
+ is 0.7, and the minimal entry is 0. So m
a
x
i
,
j
D
i
j
+
=
0.7 and m
i
n
i
,
j
D
i
j
+
=
0. On the other hand, m
a
x
i
,
j
D
i
j
-
=
0.75 and m
i
n
i
,
j
D
i
j
-
=
0.The distance matrices and grey correlation coefficients yield the grey correlation coefficient matrices of the target as follows:(23)
ξ
+
=
ξ
i
j
+
n
×
k
=
0.3684
0.5185
0.3723
0.3684
0.3333
0.35
0.3684
0.3590
0.3398
0.3415
0.7778
1
1
1
0.7778
1
0.35
0.4094
0.3415
0.3333
0.875
0.4828
0.6364
0.7778
1
,
ξ
-
=
ξ
i
j
-
n
×
k
=
0.8824
0.5357
0.9146
0.8242
0.8824
1
0.8824
1
1
0.8333
0.4054
0.3659
0.375
0.3555
0.3659
0.3659
1
0.7576
0.9375
1
0.3846
0.5769
0.4688
0.3927
0.3333
.(4) Grey Correlation Sequence. By substituting the correlation coefficient matrix (23) into (17), the weights of feature parameters are represented by the following vector:(24)
a
=
a
1
,
a
2
,
a
3
,
a
4
,
a
5
T
=
0.2718
0.1824
0.1874
0.1828
0.1756
T
.By substituting (24) into (15), the grey correlation degree between each target category and the positive desired recognition strategy is(25)
λ
+
=
λ
i
+
n
×
1
=
0.3903
0.3517
0.9006
0.5333
0
.
7629
T
,and the grey correlation degree between each target category and the negative desired recognition strategy is(26)
λ
-
=
λ
i
-
n
×
1
=
0.8146
0.9493
0.3764
0.7708
0.4279
T
.Using (18), the comprehensive correlation degree of each target category can be calculated as follows:(27)
d
=
d
i
n
×
1
=
0.1867
0.1206
0.8513
0.3237
0.8180
T
.Hence, the sequence isd
3
>
d
5
>
d
4
>
d
1
>
d
2. The comprehensive correlation degree d
3 corresponding to the target category u
3 is maximal. It means that according to the five feature parameters the unknown target is closest to the feature parameters of TBM. It also demonstrates that the strategy of recognizing the unknown target as the TBM is the best.The radiation reflection cross section area of this target is 1 to 2 magnitudes smaller than that of the airplane, while the cruise and vertical speeds are comparatively bigger. Moreover, the height is in a very high degree and acceleration is approximately 1 mach. Each feature parameter of the unknown target matches quite well the feature parameters of TBM. The category of this target in the target recognition database is consistent with the recognition result by the interval-valued intuitionistic fuzzy sets with grey correlation algorithm. Such result also signifies that the proposed algorithm in this paper has good accuracy and high adaptation.Table1 lists each recognition result for each target. All of recognition results are consistent with the categories in the target recognition database. Therefore this proposed algorithm can be of stability in multiple target recognition problems.


## 4.2. Comparisons with Other Algorithms

Using the selected 200 data sets, the proposed algorithm in this paper is, respectively, compared to target recognition algorithms based on grey correlation [7] and intuitionistic fuzzy inference [14].For intuitionistic fuzzy inference algorithm, the five parameters in (1) are similarly selected as the feature parameters. The numbers of membership functions are, respectively, 3, 5, 6, 4, and 4. Therefore in this algorithm, the number of inference rules is up to 3
×
5
×
6
×
4
×
4
=
1440.Table2 displays the experimental results by using three algorithms.Table 2
Comparison of recognition results.
Number
Algorithm
Correct recognition ratio (%)
Algorithm 1
Grey correlation
92.5
Algorithm 2
Intuitionistic fuzzy inference
96.5
Algorithm 3
The proposed algorithm
99.5According to Table2, for the target recognition issue, the proposed algorithm in this paper based on interval-valued intuitionistic fuzzy sets with grey correlation has a higher recognition ratio than that of algorithm 1 and algorithm 2. This experiment also typically verifies that the algorithm is capable of dealing with the target recognition problems with uncertain information. The recognition results are closer to the practical cases.Moreover, due to the numerous inference rules in algorithm 2, while the number of feature parameters increases, the number of inference rules will correspondingly increase in times. In such a case the issue of combination explosion easily comes up. However, for the proposed algorithm in this paper, only 25 membership and 25 nonmembership functions are needed. These functions are used for constructing a target recognition matrix, and the rest of algorithm processing is just element extractions and matrices computation for the target recognition matrix. Therefore, comparing with algorithm 2, algorithm 3 is more concise and simpler in algorithm construction and software compiling and as well can effectively avoid the issue of combination explosion.According to the examples shown above, the novel method can describe the uncertain feature or uncertain information quite well. On the other hand, it has a good ability to analyze the uncertain information. Therefore the proposed method can be used to deal with the uncertain inference problems, such as the target recognition problems, the threat assessment problems, and the decision making problems. It can construct a relation between the feature parameters and the decision results based on the interval-valued intuitionistic fuzzy sets with grey correlation method.


## 5. Conclusion

The paper introduces a target recognition algorithm based on interval-valued intuitionistic fuzzy sets with grey correlation. Using interval-valued intuitionistic fuzzy numbers, the target recognition matrix of an unknown target is established, from which the positive and negative desired recognition strategies are extracted. According to grey system theory, the grey correlation degree between the unknown target and each category is built up to obtain the optimal recognition strategies. In order to validate this proposed algorithm, the target recognition software is compiled, in which 5 typical target categories and 200 data sets are combined to testify. The results show that by this proposed algorithm the correct recognition ratio is up to 99.5%, which is higher than ratios attained by only using grey correlation algorithm or intuitionistic fuzzy inference algorithm, namely, that are 92.5% and 96.5%, respectively. It means that by adopting this proposed algorithm the anticipated expectation can be reached. And furthermore the combination explosion issue, which possibly exists in fuzzy inference algorithm, can be effectively avoided during the time of target recognition.Therefore the target recognition algorithm based on interval-valued intuitionistic fuzzy sets with grey correlation has comparatively better recognition results. It can accomplish the target recognition quite well and makes up the drawbacks caused by only using grey correlation or fuzzy inference method. Because of the abilities to describe and analyze the uncertain information, this method can be applied in the target recognition problems, the threat assessment problems, and the decision making problems.In future research, the selection of upper and lower bounds of the membership and nonmembership function should be considered deeply. It is the significantly key part for the construction of target matrix. The membership and nonmembership function should be more close to the actual situation. If the target matrix is established quite well, the recognition results will be more accuracy.



---

*Source: 3408191-2016-05-17.xml*