On Parametric Picture Fuzzy Information Measure

in Pattern Recognition Problem

Arsh Aryan Tiwari Himanshu Dhumras Rakesh K Bajaj
Department of ECE Department of Mathematics Department of Mathematics
Jaypee University of Information Jaypee University of Information Jaypee University of Information
Technology, Waknaghat Technology, Waknaghat Technology, Waknaghat
Solan, H.P., INDIA Solan, H.P., INDIA Solan, H.P., INDIA
Email: 201012@juitsolan.in Email: 216851@juitsolan.in Email: rakesh.bajaj@gmail.com

Abstract—Various similarity/distance information measures
for the extensions of fuzzy sets have been proposed and utilized
in different fields such as data science, clustering techniques,
medical diagnosis, econometrics, decision-making, etc. In the
present communication, we propose a new kind of parametric
distance measure for the picture fuzzy sets and study various
set-theoretic binary operations and properties related to the
measure along with their mathematical validation. The
parametrization feature of this measure provides additional
flexibility in processing the information. Further, for a given
unknown pattern, based on the proposed parametric picture
fuzzy distance measure and the methodology of minimum
discriminant information, we classify it into a set of known
patterns. A numerical example to show the implementation has
also been provided for clarity and better readability.
Keywords—Picture Fuzzy Set, Distance Measure,
Information Measure, Pattern Recognition
I. INTRODUCTION
The researchers have investigated the general framework
of fuzzy sets to make the computational structure more
realistic in connection with the real-world challenges in order
to deal with the participation of ambiguity in decision-
making problems. Entropy is a notion that has been shown to
be crucial and useful for studying the uncertainty present in
the data. Also, the idea of a picture fuzzy set and its
attributes, among other generalisations of fuzzy sets, have
drawn a lot of interest from the academic community since
they add a linear component of additional uncertainty. It
should be emphasised that the concept of PFSs encompasses
all four types of uncertainty components - divergence measures Joshi and Kumar that are accessible in
membership/belongingness, non-membership/non-
belongingness, abstention, & refusal which may be clearly
comprehended with the aid of the election voting system
example given by [1]. The applications addressed by
numerous researchers around the world are then
demonstrated by the introduction of picture fuzzy entropy.
These discussions provide the authors with sufficient
motivation to present new information based on PFSs from
their perspective and then apply it to the field of electric car
charging station [2], image processing [3], machine learning
[4], clustering [5], etc. Recently, some significant operational
laws with regard to interval-valued picture fuzzy sets
(IVPFSs) and interval-valued picture fuzzy soft sets were
proposed by Khalil et al (IVPFSSs).  • To exhibit a numerical illustration containing a problem of
II. LITERATURE REVIEW
Ashraf et al. [6] presented some novel aggregation
operators for resolving the issues of MADM in the picture
fuzzy framework on the basis of t-norm and t-conorm. A new
automatic clustering method was presented by Thong and
Son [7] using picture fuzzy information in conjunction with
hybrid enumerability and particle swarm optimization.
Similarly, Jana et al. [8] devised a new technique for
handling the decision-making problem under picture fuzzy
information, Dombi t-norm/ t-conorm and offered several
aggregation operations. Kumar et al. [9] studied Interval
Valued Intuitionistic Fuzzy Assignment Problem proposing
similarity measure and score function. Further, Bajaj et al.
[10] provided R-norm intuitionistic fuzzy information
measures with some computational applications. Guleria and
Bajaj [11] presented a bi-parametric Pythagorean fuzzy
information measure for decision science problems.
Additionally, Tian et al. [12] developed some picture fuzzy
weighted operators for solving MCDM issues in order to
investigate the criteria vs. influence interactions.
Additionally, some aggregation operators known as Einstein
weighted/ordered weighted operators [13] and Archimedean
picture fuzzy languages [14] have been created to address
multi-attribute group decision-making issues in image fuzzy
environments. The role of discriminant measures becomes
crucial in real-world issues where computational applications
are involved. There is an obvious necessity to look for newly
offered parametric information measures for Picture fuzzy
sets that gives the decision-makers further variability in order
to meet the additional requirements and efficiency in the
performance. To satisfy the demands of real-world
applications, however, generalisation and parametrization of
the existing information measures play a vital role and offer
extra flexibility.
It should be mentioned that there are a number of
the literature, each of which has its own restrictions and is
unable to handle the issues that picture fuzzy information
measures face. However, despite the fact that numerous
studies on picture fuzzy sets and their applications have been
conducted by numerous authors, no investigations on the
parameterized form of the discriminant information measure
have been done. This contribution's main goals are to:
• define and propose a new distance measure for the picture
fuzzy information.
• discuss various set-theoretic binary operations and
properties of the proposed distance measure along with their
proofs of validity.
pattern recognition based on the significant properties and
monotonicity of the proposed distance measure.
The contributions that are communicated has been
arranged as follows. In Section II, some related fundamental
ideas and terminology are provided in light of the issues
covered in the manuscript. A new parametric picture fuzzy
distance measure has been suggested in Section III, along

XXX-X-XXXX-XXXX-X/XX/$XX.00 ©20XX IEEE

with several key characteristics, findings, and a justification
for its validity given the pre-existing axioms. Additionally,
various binary operations and set-theoretic properties have
been proposed and proved with regard to the relevant
parameters. By solving a numerical example based on the
proposed measure in Section IV, we present a thorough
illustration of the newly given parametric discriminant
measure in field of pattern recognition. In Section V, the
manuscript has been finally concluded with a scope of future
work.
III. PRELIMINARIES
Here, we present the fundamental preliminaries readily
available in the literature. These preliminary definitions
would aid researchers in understanding the presented
notions of picture fuzzy set and increase the readability.
Definition 1: Intuitionistic Fuzzy Sets (IFS) [15]
“Let X = (z1, z2, …., zn) be a finite universe of discourse. An
intuitionistic fuzzy set (IFS) in X is defined as:
e) Intersection: U∩V = {< x, ρ U (x) ∧ ρ V (x), τ U ( x) ∨
τ V ( x), ω U (x) ∨ ω V (x) >|x ∈ X}.”
In order to check the validity of the proposed information
measure, we shall make use of the two axioms proposed by
Guiwu Wei [16] as follows:
if and only if
IV. NOTION OF PICTURE FUZZY DISTANCE MEASURE &
METHODOLOGY
In this section, we propose a new kind of parametric
information measure for the picture fuzzy sets along with its
proof of validity.
Consider two PFSs over the universe of discourse X, say, A,
B ∈ PFS(X). We propose picture fuzzy distance measure
given by

I = {< x, ρ I (x),ω I (x) >|x ∈ X};

where ρ I : X → [0,1] and ω I : X →[0,1]represents the

;
membership function and the membership degree of x ∈ X
meeting the condition,
0 ≤ ρ I (x) + ω I (x) ≤ 1;
( 1)
while the degree of indeterminacy for any IFS I and x ∈ X is Because it is not constrained by the range [0, 1]. So, we
given by πI(x) = 1 - ρ I (x) - ω I (x).” multiplied the distance measure divide by its highest value
to normalize it.
Definition 2: Picture Fuzzy Sets (PFS) [1]
“A picture fuzzy set U in a finite universe of discourse is 2
1
n
1+ ρ A ( x i )
defined as:
U = {< x, ρU (x), τ U ( x),ω U (x) >|x ∈ X};
D N ( A , B )= ∑
2 n log (2) j=1
2 2
¿( ρ ¿ ¿ A ( x i ) −ρB ( x i ) ) log 2
1+ ρ B ( xi )
+
where . (2)
ρU : X → [ 0,1 ] , τ U : X → [ 0,1 ] ∧ω U : X → [ 0,1 ]represent
s the degree of positive, neutral and non – membership Theorem 1: The axioms of metric conditions stated in
respectively for all x ∈ X which satisfy, definition are satisfied by the distance measure 𝐷N (A, B)
between two PFSs A and B defined on 𝑋= {𝑥1, 𝑥2,..., 𝑥n}.
0 ≤ ρ U (x ) +τ U ( x) + ω U (x) ≤ 1
and the degree of refusal for the picture set U and x ∈ X is Proof: The equation may be rewritten as follows:
given by θ U = 1 - ρU (x) -τ U ( x) - ω U (x).
From here onwards, FS(X) and IFS(X) will, respectively,
denote the set of all FSs and the set of all IFSs on the finite
universe of discourse X = (z1, z2, …., zn).”
(3)
Definition 3 Binary Operations on PFSs [1]: “If U, V ∈
PFS(X), the some of the important binary operations can be Consider the below-mentioned function for (𝑥, 𝑦) belonging
defined as given to [0, 1] × [0, 1] to simplify the proof.

a) Complement: Ū = {< x,ω U (x) , τ U ( x ) , ρU (x) >|x ∈ X };

b)Subsethood: U ⊆ V iff ∀x ∈ X, .
ρU ( x ) ≤ ρV ( x ) , τ U ( x ) ≥ τ V ( x ) and ω U ( x ) ≥ ω V ( x ) ;
(I) One may derive the partial derivative of V (x, y) with
c) Containment: U ⊇ V iff ∀x ∈ X, , respect to x and y as
ρU ( x ) ≥ ρV ( x ) , τ U ( x ) ≤ τ V ( x ) and ω U ( x ) ≤ ω V ( x ) .
d) Union: U∪ V = {< x, ρ U (x) ∨ ρ V (x), τ U ( x) ∧ τ V ( x) ,
(4)
ω U (x) ∧ ω V ( x)>|x ∈ X };
 2
1 1+ ρ A ( x i )
(5) 2 log ⁡(2)
{ ρ A ( xi ) −τ A ( x i ) ) log
2 2
2
1+τ A ( x i )
+ ¿(
2
2 2 1+ ρ A ( x i )
If we suppose that x ≥ y, then V (x, y) = V (y, x) follows ρ ( x i ) −τ ( x i ) ¿ log
A A 2
}=1
without any loss of generality. 1+τ A ( x i )

The monotonic nature of V (x, y) with regard to x is exactly

2 1+ ρ2A ( x i )
the opposite of the monotonic nature w.r.t. y, as shown by
∂V ∂V
⇒ { ρ ( x ) −τ A ( xi ) ) log 1+τ 2 x }=1
2
2 log ⁡(2) A i
2

the result ≥ 0 and ≤ 0. In other words, the A ( i)

∂x ∂y
maximum value of V (x, y) is obtained at (1,0), and the 2
1+ ρ A ( xi )
maxm. value is log2. Furthermore, x ≥ y implies that ⇒ { ρ A ( x i )−τ A ( x i ) ) log
2 2
2
}=log ⁡2
1+ x
2
1+ τ A ( x i)
≥1 . This suggests that V (x, y) ≥ 0.
1+ y 2
Comparing on both sides, we get
Since log2 is F (x, y)'s highest score, therefore, the greatest
2
value of DN (A, B) is then obtained as 1.
2 2 1+ ρ A ( x i)
⇒ ρ A ( xi ) −τ A ( x i ) =1∨ 2
=2
Therefore, 0 ≤ DN (A, B) ≤ 1. 1+ τ A ( x i )

(II) Let DN (A, B) = 0. This implies that, based on equation, ⇒either , ρ A ( x i ) =1, τ A ( xi ) =0∨ρ A ( x i )=0 , τ A ( xi ) =1
2
2 2 1+ x ⇒ A is a crisp set .
V ( x , y )=( x − y ) log 2
=0.
1+ y
Now, let A be a crisp set. Then either
1+ x
2 ρ A ( x i ) =1, τ A ( xi ) =0∨ρ A ( x i )=0 , τ A ( x i ) =1
This implies that either x 2− y 2 or log 2
=0
1+ y
Using Eq. (5), the distance between A and AC is
⟹ x= y , since ( x , y ) ∈ [ 0,1 ] × [ 0,1 ] .
1 1+ ρ2A ( x i )
DN(A,A ) = C
{ ρ ( x ) τ ( x ) ) log 1+τ 2 x +¿(
2
2 log ⁡(2) A i A i
2

A ( i)
It indicates that
ρ A ( x i ) =ρ B ( x i ) , τ A ( x i )=τ B ( x i )∧ω A ( x i) =ω B ( x i ) , 2
1+τ A ( x i )
2 2
∀ x ∈ X ⟹ A=B τ ( xi ) −ρ ( x i ) ¿ log
A A 2
}.Substituting the value
1+ ρ A ( x i )
Conversely, let A = B. That means, ρ A ( x i ) =1, τ A ( xi ) =0∨ρ A ( x i )=0 , τ A ( x i ) =1, we obtain
ρ A ( x i ) =ρ B ( x i ) , τ A ( x i )=τ B ( x i ) ¿ ω A ( x i )=ω B ( x i ) , ∀ x ∈ X . D N (A, AC) = 1

Then, DN (A, B) = 0. (V) Let the three PFSs A, B and C be defined in X with
relation A  B  C.
(III) We know that V (x, y) = V (y, x), which quickly
implies DN (A, B) = DN (B, A) Then, we have ρ A(𝑥𝑖) ≤ ρ B(𝑥𝑖) ≤ ρ C(𝑥𝑖) and τ A(𝑥𝑖) ≥ τ
B(𝑥𝑖) ≥ τ C(𝑥𝑖), ∀𝑥 ∈ 𝑋.
(IV) Let A = ∂V ∂V
We conclude that “for x ≥ y , we get ≥ 0 and ≤0
{¿ x , ρ A ( x ) , τ A ( x ) , ω>¿ x ∈ X }∧A C
= {¿ x , τ A ( x ) , ρ A ( x ) >¿ x ∈ X } ∂x ∂y
which represent that V increases as x increases and decreases
Let DN (A, A ) = 1, then from equation (4)
C ∂V ∂V
as y decreases & when y ≤ x , we get ≤ 0 and ≥0
∂x ∂y
2 which implies that V decreases as x decreases and increases
2
1 1+ ρ A ( x i ) 2 1+ τ A ( x i )
2 log ⁡(2)
{ ρ 2
A ( i)
x −τ A ( i ))
2
x log 2
1+τ A ( x i )
+ τ A ( i)
x − ρ 2
A ( i)
x ¿ as
logy increases.”
1+ ρ2A ( x i )
+}=1

. On the basis of above analysis, we conclude that:

V( ρ A(𝑥𝑖), ρ B (𝑥𝑖)) ≤ V( ρ A(𝑥𝑖), ρ C(𝑥𝑖))

Arranging the terms after this can be written as

V(τ A (𝑥𝑖), τ B(𝑥𝑖)) ≤ V(τ A (𝑥𝑖), τ C (𝑥𝑖))

 V(ω A(𝑥𝑖), ω B (𝑥𝑖)) ≤ V(ω A(𝑥𝑖), ω C(𝑥𝑖)) 𝐷N (A∩B,A∪B) =
2
1
n
1+ ρ B ( xi )
V( ρ B(𝑥𝑖), ρ C(𝑥𝑖)) ≤ V( ρ A(𝑥𝑖), ρ C(𝑥𝑖)) ∑
2nlog (2) i=1
2 2
{(ρ ¿ ¿ B ( xi ) −ρ A ( x i ) ) log 2
1+ ρ A ( x i )
2
+( τ ¿ ¿ A ( x i)

V(τ B(𝑥𝑖), τ C (𝑥𝑖)) ≤ V(τ A (𝑥𝑖), τ C (𝑥𝑖)) after arranging the terms, we can write

V(ω B (𝑥𝑖), ω C(𝑥𝑖)) ≤ V(ω A(𝑥𝑖), ω C(𝑥𝑖)) 𝐷N (A∩B,A∪B) =

1
n
1+ ρ 2A ( xi )
That is 𝐷N (A, B) ≤ 𝐷N (A, C) and 𝐷N (B, C) ≤ 𝐷N (A, C). ∑
2nlog(2) i=1
{(ρ ¿ ¿ A2 ( x i )−ρ2B ( xi ) ) log 2
1+ ρB ( x i )
+( τ ¿ ¿ B2 ( x i )−

For the PFSs A and A𝑐, 𝐷𝑁 (A, A𝑐) =0 ⇔ ρ A(𝑥) = τ A (𝑥)=

⇒ 𝐷N (A ∩ B, A ∪ B) = 𝐷N (A, B) (from equation (13))
ω A (x ).
Similarly, we can obtain (I), (III), and (IV) with the help of
Theorem 2. Let A, B and C be three PFSs. The distance the above conditions.
measure 𝐷𝑁 satisfies the following:
Theorem 3. The distance measure 𝐷N between two PFSs A
(I). 𝐷𝑁 (A, B) = 𝐷𝑁 (A∩B, A∪B) and B satisfies
(I). 𝐷𝑁 (A, B𝑐) = 𝐷𝑁 (A𝑐, B)
(II). 𝐷𝑁 (A, A∩B) = 𝐷𝑁 (B, A∪B) (II). 𝐷 (A, B) = 𝐷 (A𝑐, B𝑐)

(III). 𝐷𝑁 (A, A∪B) = 𝐷𝑁 (B, A∩B) Proof. Let A= {⟨𝑥, 𝜇A(𝑥), τ A(𝑥), ω A(𝑥)⟩|𝑥∈𝑋}, B= {⟨𝑥,
𝜇B(𝑥), τ B(𝑥), ω B(𝑥)⟩|𝑥∈𝑋}
(IV). 𝐷𝑁 (A∪B, C) +𝐷𝑁 (A∩B, C) =𝐷𝑁 (A, C) +𝐷𝑁 (B, C)

and A𝑐 ={⟨𝑥, ω (x), τ (𝑥), ρ (𝑥)⟩|𝑥∈𝑋} and B𝑐 ={⟨𝑥,

ω (x) , τ (𝑥), ρ (𝑥)⟩|𝑥∈𝑋}
Proof. (I). Let A = {⟨𝑥, ρ A(𝑥), τ A (𝑥), ω A ¿)⟩|𝑥∈𝑋} and B =
{⟨𝑥, ρ B(𝑥), τ B(𝑥), ω B ( x )⟩|𝑥∈𝑋}. Now from equation (13) the distance measured between A
and BC is
We know that
DN (A,BC) =
𝑃 ∩ 𝑄 = {𝑥, 𝑚𝑖𝑛 ( ρ A(𝑥), ρ B (𝑥)), 𝑚𝑎𝑥 τ A (𝑥), τ B (𝑥) |𝑥 ∈ 1
n 2
1+ ρ A ( x i)
𝑋}
∑
2nlog(2) i=1
{(ρ ¿ ¿ A2 ( x i )−τ 2B ( x i ))log 2
1+τ B ( x i )
+( τ ¿ ¿ A 2 ( xi ) −

and 𝑃 ∪ 𝑄 = {𝑥, 𝑚𝑎𝑥 ρ A (𝑥), ρ B (𝑥), 𝑚𝑖𝑛 τ A (𝑥), τ B (𝑥) .

|𝑥 ∈ 𝑋}
After arranging the terms, we can write
Case-I If A ⊆ B then, ρ B(𝑥) ≥ ρ A(𝑥), τ B(𝑥) ≤ τ A(𝑥) and
⇒
ω B ¿) ≥ ω A ¿) 2
1
n
1+ ρ A ( x i)
∑
2nlog (2) i=1
2 2
{( τ ¿ ¿ A ( x i )− ρB ( x i ))log 2
1+τ B ( x i )
2
+( ρ¿ ¿ A ( x i )
⇒ A ∩ B = {𝑥, ρ A (𝑥), τ A (𝑥), ω A ¿)|𝑥 ∈ 𝑋} = A and A ∪ B
= {𝑥, ρ B (𝑥), τ B (𝑥), ω B ¿)|𝑥 ∈ 𝑋} = B 𝐷𝑁(A𝑐,B).

𝐷N (A∩B,A∪B) = (I) 𝐷 (A𝑐,B𝑐)=

2 2 2
1
n
1+ ρ ( xi ) 1+τ ( x i ) ( xi ) A (
ρ2A1+ω
2 ¿ A ( x 2)−ω ( x )1+
nA
∑
2nlog (2) i=1
2 2
{(ρ ¿ ¿ A ( x i )−ρ B ( xi ) )log
A
2
1+ ρ ( x i )
2 2
1
+( τ ¿ ¿ A ( x i )−τ B ( x i ) ) log 2
+(ω ¿
2 2
i ) log
∑ {(τ ¿ ¿ A ( x i )− ρB ( x i) )log 1+ τ 21+x ω+(
i B 2
B 2nlog (1+ 2) τ ( xi )
B
i=1 B
B(
( i)
After arranging the terms, we can write
Case-II if B ⊆ A then ρ A(𝑥) ≥ ρ B(𝑥) and τ A(𝑥) ≤ τ B(𝑥)
2
1
n
1+ ρ A ( xi )
⇒ A ∩ B = {𝑥, ρ B (𝑥), τ B, ω B(𝑥)|𝑥 ∈ 𝑋} = B and A ∪ B = ¿ ∑
2nlog (2) i=1
{(τ ¿ ¿ A 2 ( x i )− ρ2B ( x i ))log 2
1+τ B ( x i )
+( ρ ¿ ¿ A 2 ( x
{𝑥, ρ A (𝑥), τ A (𝑥), ω A |𝑥 ∈ 𝑋} = A

= 𝐷𝑁 (A,B)
 V. NUMERICAL ILLUSTRATION
Utilising various fuzzy measures to achieve classification in
the unidentified pattern B with the prior identified patterns
Aj (j = 1, 2,...,n). Let's say we take into account three
patterns known as A1, A2 and A3. The fuzzy representation
of these patterns in the equation X = {x1, x2, x3} is shown as
follows:
A1   = {(x1, 0.4, 0.3, 0.1), (x2, 0.5, 0.3, 0.2), (x3, 0.4, 0.3, 0)
, (x4, 0.7, 0, 0.2), (x5, 0.6, 0.1, 0.1)};
A2   = {(x1, 0.7, 0.1, 0.1), (x2, 0.2, 0.3, 0.4), (x3, 0.2, 0.1,
0.5),
(x 4, 0.1, 0.5, 0.2), (x5, 0.3, 0.3,
0.3)};
A3   = {( x1, 0.1, 0.3, 0.4), (x2, 0.4, 0.3, 0.1), (x3, 0.3, 0.4,
0.2),
(x 4, 0.2, 0.5, 0.3), (x5, 0.5, 0.3,
0.1)}.
Let us assume that there is a sample pattern B that is not
identified and is presented in the picture fuzzy
representation as follows:
B = {( x1, 0.6, 0.2, 0.1), (x2, 0.3, 0.4, 0.2), (x3, 0.4, 0.3, 0.2),
(x4, 0.7, 0.1, 0.0), (x5, 0.4, 0.2, 0.2)}.
Now, we will apply the idea of minimum discriminant
information as provided by [17] to discover the pattern to
which the unknown pattern B belongs. The process for
allocating B to Aj is established by
j =arg min ( I R ( A j , B ) ) .
¿ S
j
Now, using proposed discriminant measure (2), we get the
values of arg min j I ( ( A j , B ) )as shown in the following
S
R process”, Applied Soft Computing, 74, pp. 99-109, (2019).
table:
S [9] G. Kumar, R. K. Bajaj, “On Solution of Interval Valued
Table 1: Values of I R ( A j , B ) with j ∈ {1,2,3}
A1 A2 A3
B 0.0422 0.1471 0.1633
Therefore, based on the values obtained by the above
explained computations, it is observed that that the totally
unknown pattern B is grouped to the known pattern A1.
VI. CONCLUSIONS AND SCOPE FOR FUTURE WORK
The role and implementation of the proposed picture fuzzy
distance measure in the pattern recognition problem is found
to be very important and decisive. We could successfully
validate the axioms for the proposed ones. Further, based on
the proposed picture fuzzy distance measure and the
methodology of minimum discriminant information, we
found that the given unknown pattern could be allocated to
one of the known patterns with a significant deterministic
value. In future, the proposed parametric discriminant
measure may further be utilized in case of spherical fuzzy
information for the wider coverage of the information and
generalized comprehensiveness.
ACKNOWLEDGMENT
The authors are very much thankful to the anonymous
reviewers and organizers of the conference for providing us
the opportunity to showcase our work and the necessary
suggestions for the improvement.
REFERENCES
[1]   B. C. Cuong, V. Kreinovich, “Picture fuzzy sets-a new
concept for computational intelligence problems”, In the
Proceedings of 3rd World Congress on Information and
Communication Technologies (WICT), pp. 1-6, (2012). 
[2]   Y. Ju, D. Ju, D.R. Ernesto, S. Gonzalez, M. Giannakis,
A. Wang, “Study of site selection of electric vehicle
charging station based on extended GRP method under
picture fuzzy environment”, Comput Ind Eng, 135, pp.
1271-1285, (2019). 
[3]   J. E. Koss, F.D. Newman, T.K. Johnson, D.L. Kirch,
“Abdominal organ segmentation using texture transforms
and a Hopfield neural network”, IEEE Transactions on
Medical Imaging, 18(7), pp. 640-648, (1999). 
[4]   N. R. Pal, S.K. Pal, “A review on image segmentation
techniques”, Pattern Recognition, 26(9), pp. 1277-1294,
(1993). 
[5]   L. H. Son, P.H. Thong, “Some novel hybrid forecast
methods based on picture fuzzy clustering for weather now
casting from satellite image sequences”, Applied
Intelligence, (46), pp. 1-15, (2017).
[6]   S. Ashraf, T. Mahmood, S. Abdullah, Q. Khan,
“Different approaches to multi-criteria group decision-
making problems for picture fuzzy environment”, Bulletin
of Brazilian Mathematical Society, 50, pp. 373-397, (2019). 
[7]   P. H. Thong, L.H. Son, “A novel automatic picture
fuzzy clustering method based on particle swarm
optimization and picture composite cardinality”, Knowledge
Based Systems, 109, pp. 48-60, (2016). 
[8]   C. Jana, T. Senapati, M. Pal, R. R. Yager, “Picture fuzzy
Dombi aggregation operators: application to MADM
Intuitionistic Fuzzy Assignment Problem Using Similarity
Measure and Score Function”, Inter. Journal of Math &
Computational Sciences, 8(4), pp.715 – 720 (2014).
[10] R. K. Bajaj, T. Kumar, N. Gupta, “R-norm Intuitionistic
Fuzzy Information Measures and Its Computational
Applications” In: Mathew, J., Patra, P., Pradhan, D.K.,
Kuttyamma, A.J. (eds)., Communications in Computer and
Information Science, 305 (2012).
[11] A. Guleria, R. K. Bajaj (2018), "Pythagorean Fuzzy –
(R, S) Norm Information Measure for Multicriteria
Decision-Making Problem", Advances in Fuzzy Systems,
vol. 2018, Article ID 8023013, 11 pages, (2018).
[12]   C. Tian, J. Peng, S. Zhang, W. Zhang, J. Wang,
“Weighted picture fuzzy aggregation operators and their
application to multicriteria decision-making problems”,
Computational Industrial Engg., 237, p.106037, (2019). 
[13] S. Khan, S. Abdullah, S. Ashraf, “Picture fuzzy
aggregation information based on Einstein operations and
their application in decision-making”, Mathematical
Sciences, 13, pp. 213-229, (2019). 
[14] P. Liu, X. Zhang, “A novel picture fuzzy linguistic
aggregation operator and its application to group decision-
making”, Cognitive Computation, 10, pp. 242-259, (2018).
[15] K. T. Atanassov, “Intuitionistic fuzzy sets”, Fuzzy Sets
and Systems vol. 20(1), pp. 87-96, (1986).
[16] G. Wei, “Picture fuzzy cross-entropy for multiple
attribute decision making problems'', Journal of Business
Economics & Mgmt., 17(4), pp. 491-502, (2016).
[17] J. E. Shore, R. M. Gray, “Minimization cross-entropy
pattern classification and cluster analysis”, IEEE Trans.
Pattern Analysis & Machine Intell., 4(1), pp. 11-17, (1982).