CN110647856B - Method for recognizing facial expressions based on theory of axiomatic fuzzy set - Google Patents

Method for recognizing facial expressions based on theory of axiomatic fuzzy set Download PDF

Info

Publication number
CN110647856B
CN110647856B CN201910931641.1A CN201910931641A CN110647856B CN 110647856 B CN110647856 B CN 110647856B CN 201910931641 A CN201910931641 A CN 201910931641A CN 110647856 B CN110647856 B CN 110647856B
Authority
CN
China
Prior art keywords
semantic
concept
expression
fuzzy
semantics
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN201910931641.1A
Other languages
Chinese (zh)
Other versions
CN110647856A (en
Inventor
李泽东
张洪硕
王元刚
樊志东
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Dalian Minzu University
Original Assignee
Dalian Minzu University
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Dalian Minzu University filed Critical Dalian Minzu University
Priority to CN201910931641.1A priority Critical patent/CN110647856B/en
Publication of CN110647856A publication Critical patent/CN110647856A/en
Application granted granted Critical
Publication of CN110647856B publication Critical patent/CN110647856B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06VIMAGE OR VIDEO RECOGNITION OR UNDERSTANDING
    • G06V40/00Recognition of biometric, human-related or animal-related patterns in image or video data
    • G06V40/10Human or animal bodies, e.g. vehicle occupants or pedestrians; Body parts, e.g. hands
    • G06V40/16Human faces, e.g. facial parts, sketches or expressions
    • G06V40/174Facial expression recognition
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06VIMAGE OR VIDEO RECOGNITION OR UNDERSTANDING
    • G06V40/00Recognition of biometric, human-related or animal-related patterns in image or video data
    • G06V40/10Human or animal bodies, e.g. vehicle occupants or pedestrians; Body parts, e.g. hands
    • G06V40/16Human faces, e.g. facial parts, sketches or expressions
    • G06V40/168Feature extraction; Face representation

Abstract

The invention discloses an expression recognition method based on different semantics of a commonalization fuzzy set, which specifically comprises the following steps: step 1, constructing a semantic concept set for each expression according to the similarity in the classes and the difference between the classes; step 2, extracting face characteristic information and converting the face characteristic information into a semantic concept; step 3, making the semantic concepts into corresponding rule sets for distinguishing the categories of the expressions; and 4, providing an optimization criterion for selecting the most suitable semantic concept for each expression. The method can objectively convert the human face features into semantic concepts, and the fuzzy set and the logic operation thereof are determined algorithmically according to the distribution of the original data and the semantics of the fuzzy set. By considering ambiguity and randomness, research on how to convert information in the database into membership functions and fuzzy logic operations thereof is facilitated. The present application does not require the definition of membership functions and initial values because all data is obtained from the original database.

Description

Facial expression recognition method based on axiomatic fuzzy set theory
Technical Field
The invention belongs to the technical field of image classification, and particularly relates to a novel method for recognizing various expressions by using human face semantic knowledge based on a commonalization fuzzy set theory.
Background
Facial expression recognition has attracted a great deal of attention in the last decade, and the most basic expressions have been divided into six types. Many methods have been developed from various perspectives, principal Component Analysis (PCA) and Linear Discriminant Analysis (LDA) being classical subspace methods, generally recognized as distinct expression forms of test criteria. They extract image features in the subspace and match the corresponding expressions according to the distance of different expression feature subspaces, but the illumination effect and texture features affect the final result.
With the development of neural networks, deep learning has been proposed and many achievements have been made in the field of facial expression recovery. After using the neural network, a large number of expressive features can be identified in the convolutional layer, and finally abstract features are extracted and used for identifying various expressions. In essence, these representative methods, regardless of whether they calculate global or local features, achieve their goal by calculating pixel values.
With the introduction of geometric features, face components are gradually attracting a great deal of attention in face recognition. And in particular the face coding system (FACS), provides a standard for the shape of facial components. On the basis of this standard, various expressions are described in detail with semantic concepts, including the eye, nose, mouth, and facial contours. Since subjectively defined semantic concepts are prone to errors in concept interpretation, face coding systems (FACS) are often considered as auxiliary information to provide assistance. The fuzzy method can well explain the facial expression by semantic concepts. However, this approach has the disadvantage of containing rich rules. When the expressive features increase, the fuzzy method may generate a large number of redundant rules, which may interfere with the estimation result of the expressive features.
Disclosure of Invention
Aiming at the defects in the prior art, the application provides an expression recognition method (Axiomatic Fuzzy Set) based on different semantics of a common physics and chemistry Fuzzy Set, which is called AFS for short in the following, and membership functions and initial values are not required to be defined and are obtained from an original database.
In order to achieve the purpose, the expression recognition method based on different semantics of the commonalization fuzzy set specifically comprises the following steps:
step 1, constructing a semantic concept set for each expression according to the similarity in the classes and the difference between the classes;
step 2, extracting face characteristic information and converting the face characteristic information into a semantic concept;
step 3, making the semantic concepts into corresponding rule sets for distinguishing the categories of the expressions;
and 4, providing an optimization criterion for selecting the most suitable semantic concept for each expression.
Further, in step 1, a semantic concept set is constructed according to the distribution of expression data, and the method specifically includes the following steps:
step one, A i =Πm j,k Is a complex concept composed of m j,k E.g. the connection of the M,
Figure BDA0002220414150000021
is a set; the human face has S characteristics, wherein j represents the jth characteristic; if the jth feature consists of L attributes, L represents the ith attribute; if the l attribute has K different descriptions, K is the K description; then call to be->
Figure BDA0002220414150000022
The method is a face simple semantic, wherein M is a face simple semantic set and covers three semantics of large, medium and small;
suppose A i =Πm j,k The representation consists of two or more simple semantics m j,k Combined semantics, the letter pi represents A i All simple semantics m j,k A combination relationship between "and", and A i Two simple semantics m of any j,h And m j,k The described geometric forms are different, then called A i A face complex semantic meaning;
thus, the semantic set is described as follows:
Figure BDA0002220414150000023
here, I is a non-empty index set; at the same time, EM * The equivalence relation R above is defined as follows (R represents a real number set);
to pair
Figure BDA0002220414150000024
There is an equivalence relation
(1)
Figure BDA0002220414150000025
So that>
Figure BDA0002220414150000026
(2)
Figure BDA0002220414150000027
So that>
Figure BDA0002220414150000028
Denoting quotient set by EM, EM = R;
wherein
Figure BDA0002220414150000029
Represents: optionally; />
Figure BDA00022204141500000210
Represents: (ii) present; i: denotes the ith, corresponding to the serial number; h: the h-th feature; j: representing a feature set; j: represents a certain feature in J; ai: representing a subset of semantic concepts; bi: representing a subset of semantic concepts; ak: representing a subset of semantic concepts; />
Figure BDA00022204141500000211
Means Ai contains or is equal to Bi;
step two, the ordered relation has continuity in the membership function describing the fuzzy set, X is a data set, M is a group of fuzzy terms on X, and the definition is as follows:
Figure BDA00022204141500000212
wherein the linear ordering relationship is represented by ">", and for M ∈ M, "x >" is defined as m y "indicates that x belongs to m to a greater extent than y belongs to m; a. The (x) In the face feature data set X, X is present 1 ,x 2 ∈X,x 2 The degree of falling under A is less than or equal to x 1 Degree of belonging to A; a. The (x) Is belonged to m∈A m, which is less than or equal to x; a. The (x) The probability distribution of the semantics of the fuzzy set A and the observation data set X is determined;
step three, aiming at the fuzzy set xi E EM, mu ξ :X→[0,1].{μ ξ (x) The | ξ ∈ EM } } is called as logic operation rules of 'A' and 'V' about the human face semantic, is a group of coherent membership functions (EM, A) and needs to meet the following conditions:
1. if the semantics are alpha, beta belongs to EM, if alpha is less than or equal to beta (EM, lambda and lambda), then for any X belongs to X, there is mu α (x)≤μ β (x) (ii) a Alpha and beta are semantic concepts in the semantic set EM, x is any sample, and mu is membership; mu.s α (x)≤μ β (x) The explanation is as follows: the membership degree of any x sample in the semantic concept alpha is less than or equal to the membership degree of any x sample in the semantic concept beta;
2. for X e to X,
Figure BDA0002220414150000031
if/or>
Figure BDA0002220414150000032
All I ∈ I have μ η (x)=0;
3. If X, y belongs to X,
Figure BDA0002220414150000033
if>
Figure BDA0002220414150000034
Then there is mu η (x)≤μ η (y); if>
Figure BDA0002220414150000035
Then mu η (x) =1; eta represents a complex semantic concept, mu η (x) And mu η (y) representing the membership of the sample x and the sample y in the description of the complex semantic eta; />
The coherent membership function is associated with the measure on X, and the application provides two measures of fuzzy sets, which can be constructed by considering the semantic meaning of fuzzy items and the probability distribution of data features;
step four, let (Ω, F, p) be a probability measure space, M be a set of fuzzy terms on X; let ρ be γ Is a weight function of a fuzzy term gamma epsilon M; is provided with
Figure BDA0002220414150000036
Is a limited set of observation samples over the probability space (Ω, F, p); if any M belongs to M, x belongs to omega; m is (x)∈F m Then, the following conclusions are reached:
A、{μ ξ (x) The | xi ∈ EM } is a membership function of one of (EM, V), and then for any human face semantic fuzzy set
Figure BDA0002220414150000037
The membership function based on the semantic structure and the membership function based on the probability distribution are respectively described as follows:
Figure BDA0002220414150000038
Figure BDA0002220414150000039
wherein N is u Is the number of human face semantics observed in the sample set X;
B. for all γ ∈ M, pp γ (x) Continuous over Ω, X is a set of samples randomly drawn from the probability space (Ω, F, p), and for all X ∈ X, the membership function defined by equation (3) converges to the membership function defined by (4) as X approaches infinity.
Further, in the step 2, the information of the human face characteristic points is extracted according to FACS, the expression characteristics are constructed by marking through a marking method, and the expression characteristics are converted into semantic concepts and are divided into the following steps:
step one, according to FACS, the facial components are known to have different shapes among different expressions; FACS defines only facial action units and appears in the corresponding expression; however, it ignores the geometry of the face component. Therefore, on the basis of FACS, facial components are labeled using a labeling method to construct expressive features.
Step two, the mark point and the symbol l of the human face are expressed by coordinate values i For representing the ith point in the image, and x i And y i Is a 1 i The coordinate values of (a); point l i Viewed as "l i =(x i ,y i ) ", the expression characteristics are shown in FIG. 1 and Table 1, respectively:
TABLE 1
Figure BDA0002220414150000041
/>
Figure BDA0002220414150000051
Step three, are i ,l j ,···,l k The area enclosed by the points; med (l) i ,l j ) Represents l i And l j The center of (a); for d (l) i ,l j ),∠(l i ,l j ,l k ) The explanation of (a) is as follows:
Figure BDA0002220414150000052
Figure BDA0002220414150000053
where d (l) i ,l j ) Is represented by i And l j Angle (l) i ,l j ,l k ) Represents l i ,l j ,l k The combination angle of (c);
and step four, constructing 25 expression features according to the table 1, and reasonably describing facial expressions. Meanwhile, three semantic concepts of large, medium and small are established to distinguishDividing each characteristic; f. of h For expressing the h-th expressive feature, like m h,1 ,m h,2 ,m h,3 Respectively represent large, medium and small in semantic concepts.
Further, in step 3, a standard is established to distinguish different expressions, and the method comprises the following steps:
Figure BDA0002220414150000054
step one, simple concept selection
There are many features that are used to describe expressions, and these simple expressive features need to be changed from F = { F, based on similar expressive features 1 ,f 2 ,···,f h ,···,f 25 Get the feature set
Figure BDA0002220414150000055
Figure BDA0002220414150000061
Wherein the content of the first and second substances,
Figure BDA0002220414150000062
is a subset that represents k and x in the structure of the characteristic fs i The field of (1); />
Figure BDA0002220414150000063
Is also a subset, which represents k and x in the feature set F i The field of (1); />
Figure BDA0002220414150000064
Is a subset of F, including >>
Figure BDA0002220414150000065
And &>
Figure BDA0002220414150000066
A relationship characteristic between; retention f h At f h And F have more in common>
Figure BDA0002220414150000067
If->
Figure BDA0002220414150000068
If the value of (a) is greater, f h The concept set F can be well represented, and the neighborhood x of k is measured by Euclidean distance i
And step two, optimizing the concept of each expression, and providing a simple semantic concept set according to the algorithm 1, wherein the characteristics are not unique when the expression appears. Therefore, the applicable complex semantic concepts are changed;
step three, extracting complex semantic concepts for the selected expressions by using a threshold and a standard;
step four, because of the difference of individuals, the semantics of each individual can generate difference; a semantic description needs to be constructed for each expression.
And step five, inserting the most preferable semantic concepts among the expressions after obtaining the descriptions of various expressions.
The beneficial effect of this application does: the AFS can objectively convert the human face features into semantic concepts, and in the AFS theory, a fuzzy set (membership function) and its logical operation are algorithmically determined according to the distribution of original data and the semantics of the fuzzy set. The AFS framework facilitates the study of how to convert information in a database into membership functions and their fuzzy logic operations by considering ambiguity (subjective uncertainty) and randomness (subjective uncertainty). AFS does not require the definition of membership functions and initial values because all data is obtained from the original database.
Drawings
FIG. 1 is a representation of facial expression features of the present invention;
FIG. 2 is a diagram of semantic concept distribution within various categories in accordance with the present invention;
Detailed Description
In step 3, a simple concept selection, features describing facial expressions are obtained. Optimization criteria are then established to reveal differences between different expressions. Due to the similarity of the internal expressions, mutual features should be selected. With these differences, criteria are established to distinguish different expressions. The following two steps will be described in detail.
At the time of obtaining each sample x i After the compact features of (2), converting the features into semantic concepts. Within the framework of AFS, there are three concepts of "big", "medium" and "small" for any feature. In fact, only one concept converted from the features is needed to represent the corresponding expression. Thus, a criterion has been established to select x i The semantic concept of (2).
Figure BDA0002220414150000069
Where M is xi Is to preserve the semantic concept set, m h,t Denotes f h The tth feature of the tth concept.
Figure BDA0002220414150000071
Represents m h,t The neighborhood k of (c). />
Figure BDA0002220414150000072
Is a set of semantic concepts m h,1 ,m h,2 ,m h,3 Neighborhood k, the distance between concepts still uses the euclidean distance. Then m is reserved h,t They have the most similar neighborhood->
Figure BDA0002220414150000073
Is also based on>
Figure BDA0002220414150000074
Is also the largest, x can be well described i Algorithm 1 describes this process. />
Figure BDA0002220414150000075
In step (b)Step 3. X according to algorithm 1 in the complex semantic extraction i Proposes a simple semantic concept set
Figure BDA0002220414150000076
In this step, the threshold and criteria are used to be x i Selecting a proper expression concept.
Figure BDA0002220414150000077
Here, the
Figure BDA00022204141500000719
Is a set of semantic concepts. />
Figure BDA0002220414150000079
Is formed by m h,t A connected set of complex semantic concepts, δ being a threshold value, based on a criterion>
Figure BDA00022204141500000718
Use>
Figure BDA00022204141500000711
To represent x i Is based on the degree of membership when>
Figure BDA00022204141500000712
If the degree of membership is greater than or equal to δ, it is reserved>
Figure BDA00022204141500000713
However, semantic concepts can only represent an individual x i Many redundancy concepts still exist. Based on the similarity within a class and the difference between classes, construct
Figure BDA00022204141500000714
And &>
Figure BDA00022204141500000715
Two criteria to optimize x i Semantic concepts ofAnd (4) collecting. />
Figure BDA00022204141500000716
And &>
Figure BDA00022204141500000717
Respectively as follows:
Figure BDA0002220414150000081
/>
Figure BDA0002220414150000082
herein, the
Figure BDA0002220414150000083
Is about a semantic concept>
Figure BDA0002220414150000084
All of the described->
Figure BDA0002220414150000085
Average value of the degree of membership of (c). Also, the same applies to
Figure BDA0002220414150000086
Is about the semantic concept->
Figure BDA00022204141500000824
All x of the description i E.g. the average value of the membership of X. In addition, the method can be used for producing a composite material
Figure BDA0002220414150000088
Representing a semantic concept->
Figure BDA0002220414150000089
The distance measure of (d). And then use the sum of>
Figure BDA00022204141500000810
And &>
Figure BDA00022204141500000811
Performed>
Figure BDA00022204141500000812
To extract complex concepts.
Figure BDA00022204141500000813
According to
Figure BDA00022204141500000814
One set corresponding to each x can be obtained i Is taken as the value of>
Figure BDA00022204141500000815
Describe x i Its value is->
Figure BDA00022204141500000816
The largest among them.
In step 3 semantic concept description of each expression, each x is different due to individual differences i Semantics of (A)
Figure BDA00022204141500000817
A difference is generated. A semantic description needs to be constructed for each expression. As can be seen in fig. 2, the three color representation uses three data to illustrate the conceptual distribution. The symbol "·" denotes an individual x i The semantic concept of (2). The symbol a is the central concept for each expression. According to
Figure BDA00022204141500000818
Can obtain each x i Semantic concept ∈ X>
Figure BDA00022204141500000819
Each class can find a central concept that can reflect the differences between different classes very well. The concept of each expression is changed using Sparse Representation (SR).Conversion of SR solution to l according to complexity 1 To minimize the problems.
Figure BDA00022204141500000820
Here, T is a coefficient matrix. H is a central semantic concept which is a set of clustered concepts
Figure BDA00022204141500000821
And (4) generating. Fuzzy c-means (FCM) is used to ensure the correctness of H. Extracting a central semantic concept pick>
Figure BDA00022204141500000822
Plays an important role in most conventional expressions. Finally, use l 1 Miniaturisation results in an optimal concept set->
Figure BDA00022204141500000823
By using l 1 And minimizing to obtain a coefficient matrix of the semantic concept. From the coefficient matrix, a semantic concept can be derived, its value pairs
Figure BDA0002220414150000091
Is important.
In step 3, in the optimal concept extraction of various expressions, after descriptions of the various expressions are obtained, significant semantic concepts are inserted among the expressions. To extract salient concepts, semantic closeness is established
Figure BDA0002220414150000092
To evaluate a set of semantic concepts
Figure BDA0002220414150000093
Figure BDA0002220414150000094
Herein, the
Figure BDA0002220414150000095
Is->
Figure BDA0002220414150000096
Number of semantic concepts in->
Figure BDA0002220414150000097
Represents->
Figure BDA0002220414150000098
Describe down->
Figure BDA0002220414150000099
Degree of membership. Then a criterion is established>
Figure BDA00022204141500000910
Its resolution is similar to->
Figure BDA00022204141500000911
(equation 10). Finally, establish->
Figure BDA00022204141500000912
And &>
Figure BDA00022204141500000913
Combined optimization function>
Figure BDA00022204141500000914
Extract description C i The best semantic concept for each expression. />
Figure BDA00022204141500000915
Figure BDA00022204141500000916
For predicting new samples not included in X in step 3Class labels, required to be in the entire input space
Figure BDA0002220414150000101
Represents a semantic concept set xi, where U s Is the semantic concept term M in M h,k An associated feature. Given the distribution of the data set, the membership functions of the semantic concept set γ can be specified from the observed data. For any semantic concept ξ ∈ EM, the range X in which it is discussed is extended to U 1 ×U 2 ×…×U S . For each x = (u) 1 ,u 2 ,…,u s )∈U 1 ×U 2 ×…×U S ,/>
Figure BDA0002220414150000102
At U 1 ×U 2 ×…×U S The lower bound of the membership function above which defines the semantic concept set ξ is as follows:
Figure BDA0002220414150000103
here, the
Figure BDA0002220414150000104
I ∈ I is defined >>
Figure BDA0002220414150000105
Weighing and collecting device>
Figure BDA0002220414150000106
The lower bound of the membership function for ξ. With the aid of the formula (16), the fuzzy set can be expanded>
Figure BDA0002220414150000107
The range X discussed becomes U 1 ×U 2 ×…×U S . Thus, using the fuzzy rule base, the input space can be established as U 1 ×U 2 ×…×U S The fuzzy inference system of (1). Membership function->
Figure BDA0002220414150000108
Depending on the distribution of the training instances and the AFS fuzzy logic. When a new mode x ∈ U 1 ×U 2 ×…×U S When provided with a label of unknown class, its degree of membership may be calculated>
Figure BDA0002220414150000109
Wherein +>
Figure BDA00022204141500001010
Is to C i Fuzzy description of classes. If it is
Figure BDA00022204141500001011
Then x belongs to C q And (4) class. />

Claims (3)

1. A expression recognition method based on different semantics of a common physicochemical fuzzy set is characterized by comprising the following steps:
step 1, constructing a semantic concept set for each expression according to the similarity in the classes and the difference between the classes;
step 2, extracting face characteristic information and converting the face characteristic information into a semantic concept;
step 3, making the semantic concepts into corresponding rule sets for distinguishing the categories of the expressions;
step 4, providing an optimization criterion for selecting the most suitable semantic concept for each expression;
in the step 1, a semantic concept set is constructed according to the distribution condition of the expression data, and the method specifically comprises the following steps:
step one, A i =Πm j,k Is a complex concept composed of m j,k E.g. the connection of the M,
Figure FDA0004084973030000011
is a set; the human face has S characteristics, wherein j represents the jth characteristic; if the jth feature consists of L attributes, L represents the ith attribute; if the l attribute has K different descriptions, K is the K description; then call to be->
Figure FDA0004084973030000012
The method is a face simple semantic, wherein M is a face simple semantic set and covers three semantics of large, medium and small;
suppose A i =Πm j,k The representation consists of two or more simple semantics m j,k Combined semantics, the letter pi represents A i All simple semantics m j,k A combination relationship between "and", and A i Two simple semantics m of any j,h And m j,k The described geometric forms are different, then called A i A face complex semantic meaning;
thus, the semantic set is described as follows:
Figure FDA0004084973030000013
here, I is a non-empty index set; at the same time, EM * The equivalence relation R above is defined as follows;
to pair
Figure FDA0004084973030000014
There is an equivalence relation
(1)
Figure FDA0004084973030000015
So that->
Figure FDA0004084973030000016
(2)
Figure FDA0004084973030000017
So that>
Figure FDA0004084973030000018
Denoting quotient set by EM, EM = R;
wherein
Figure FDA0004084973030000019
Represents: optionally; />
Figure FDA00040849730300000110
Represents: (ii) present; i: denotes the ith, corresponding to the serial number; h: the h-th feature; j: representing a feature set; j: represents a certain feature in J; ai: representing a subset of semantic concepts; bi: representing a subset of semantic concepts; ak: representing a subset of semantic concepts; />
Figure FDA00040849730300000111
Means Ai contains or is equal to Bi;
step two, the ordered relation has continuity in the membership function describing the fuzzy set, X is a data set, M is a group of fuzzy terms on X, and the definition is as follows:
Figure FDA0004084973030000021
wherein the linear ordering relationship is represented by ">", and for M ∈ M, "x >" is defined as m y "indicates that x belongs to m to a greater extent than y belongs to m; a. The (x) In the face feature data set X, X is present 1 ,x 2 ∈X,x 2 The degree of falling under A is less than or equal to x 1 Degree of belonging to A; a. The (x) Is attributed to II m∈A A series of elements of m which are less than or equal to x; a. The (x) The semantic meaning of the fuzzy set A and the probability distribution of the observation data set X are determined;
step three, regarding the fuzzy set xi E EM, mu ξ :X——→[0,1]·{μ ξ (x) The | ξ ∈ EM } is called as the logical operation rules of 'inverted V' and 'V' about the human face semantic meaning, is a group of coherent membership functions (EM, inverted V, V-shaped) and needs to meet the following conditions:
1. if the semantic meaning is alpha, beta belongs to EM, if alpha is less than or equal to beta (EM, V), then for any X belongs to X, there is mu α (x)≤μ β (x) (ii) a Alpha and beta are semantic concepts in the semantic set EM, x is any sample, and mu is membership; mu.s α (x)≤μ β (x) The explanation is as follows: the membership degree of any x sample in the semantic concept alpha is less than or equal to the membership degree of any x sample in the semantic concept beta;
2. for X e to X,
Figure FDA0004084973030000022
if/or>
Figure FDA0004084973030000023
All I ∈ I have μ η (x)=0;
3. If there is
Figure FDA0004084973030000024
If>
Figure FDA0004084973030000025
Then there is mu η (x)≤μ η (y); if/or>
Figure FDA0004084973030000026
Then mu η (x) =1; eta represents a complex semantic concept, mu η (x) And mu η (y) representing the degree of membership of the sample x and the sample y in the complex semantic eta description;
step four, setting (omega, F, P) as a probability measure space, and setting M as a group of fuzzy items on X; let ρ be γ Is a weight function of a fuzzy term gamma epsilon M; is provided with
Figure FDA0004084973030000027
Is a limited set of observation samples over the probability space (Ω, F, P); if any M belongs to M, x belongs to omega; m is (x)∈F m Then, the following conclusions are reached:
A、{μ ξ (x) The | xi ∈ EM } is a membership function of one of (EM, V), and then for any human face semantic fuzzy set
Figure FDA0004084973030000028
The membership function based on the semantic structure and the membership function based on the probability distribution are respectively described as follows:
Figure FDA0004084973030000029
Figure FDA00040849730300000210
wherein N is u Is the number of human face semantics observed in the sample set X;
B. for all γ ∈ M, P γ (x) Is continuous over Ω and X is a set of samples randomly drawn from the probability space (Ω, F, P), and for all X ∈ X, the membership function defined by equation (3) converges to the membership function defined by (4) as X approaches infinity.
2. The method for recognizing the expressions based on different semantics of the axiomatic fuzzy set as claimed in claim 1, wherein the step 2 comprises extracting facial feature point information according to FACS, constructing the expression features by labeling with a labeling method, and converting into semantic concepts comprising the following steps:
step one, according to FACS, knowing that the shapes of facial components are different among different expressions; FACS defines only facial action units and appears in the corresponding expression;
step two, the mark point and the symbol l of the human face are expressed by coordinate values i For representing the ith point in the image, and x i And y i Is a i The coordinate values of (a); point l i Viewed as "l i =(x i ,y i ) ", the expression characteristics are shown in Table 1, respectively:
TABLE 1
Figure FDA0004084973030000031
/>
Figure FDA0004084973030000041
Step three, are i ,l j ,···,l k The area enclosed by the points; med (l) i ,l j ) Represents l i And l j The center of (a); for d (l) i ,l j ),∠(l i ,l j ,l k ) The explanation of (a) is as follows:
Figure FDA0004084973030000042
Figure FDA0004084973030000043
where d (l) i ,l j ) Is represented by i And l j Angle (l) i ,l j ,l k ) Represents l i ,l j ,l k The combined angle of (a);
step four, according to the table 1, 25 expression features are constructed, and meanwhile, three semantic concepts of large, medium and small are established to distinguish each feature; f. of h For the h-th expressive feature, m h,1 ,m h,2 ,m h,3 Respectively represent large, medium and small in semantic concepts.
3. The expression recognition method based on different semantics of the axiomatic fuzzy set according to claim 1, wherein a standard is established in step 3 to distinguish different expressions, and the method comprises the following steps:
step one, simple concept selection
From F = { F 1 ,f 2 ,···,f h ,···,f 25 Extracting feature set in
Figure FDA0004084973030000047
Figure FDA0004084973030000044
Wherein the content of the first and second substances,
Figure FDA0004084973030000045
is a subset which represents k and is at feature f h X in the structure of i The field of (1); />
Figure FDA0004084973030000046
Is also a subset, which represents k and x in the feature set F i The field of (1); />
Figure FDA0004084973030000051
Is a subset of F, including >>
Figure FDA0004084973030000052
And &>
Figure FDA0004084973030000053
A relationship characteristic between; retention f h At f h And F have more neighborhoods in common>
Figure FDA0004084973030000054
If a neighborhood->
Figure FDA0004084973030000055
If the value of (a) is greater, f h The concept set F can be well represented, and the neighborhood x of k is measured by Euclidean distance i
Changing the applicable complex semantic concept;
step three, extracting complex semantic concepts for the selected expressions by using a threshold and a standard;
step four, because of the difference of individuals, the semantics of each individual can generate difference; a semantic description needs to be constructed for each expression;
and step five, inserting the most preferable semantic concepts among the expressions after obtaining the descriptions of various expressions.
CN201910931641.1A 2019-09-29 2019-09-29 Method for recognizing facial expressions based on theory of axiomatic fuzzy set Active CN110647856B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201910931641.1A CN110647856B (en) 2019-09-29 2019-09-29 Method for recognizing facial expressions based on theory of axiomatic fuzzy set

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201910931641.1A CN110647856B (en) 2019-09-29 2019-09-29 Method for recognizing facial expressions based on theory of axiomatic fuzzy set

Publications (2)

Publication Number Publication Date
CN110647856A CN110647856A (en) 2020-01-03
CN110647856B true CN110647856B (en) 2023-04-18

Family

ID=68993136

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201910931641.1A Active CN110647856B (en) 2019-09-29 2019-09-29 Method for recognizing facial expressions based on theory of axiomatic fuzzy set

Country Status (1)

Country Link
CN (1) CN110647856B (en)

Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101034433A (en) * 2007-01-12 2007-09-12 郑文明 Method for classification human facial expression and semantics judgement quantization method
CN102662931A (en) * 2012-04-13 2012-09-12 厦门大学 Semantic role labeling method based on synergetic neural network
CN102779271A (en) * 2012-06-28 2012-11-14 南京信息工程大学 Expression semanteme sparse quantization method based on spectrum sparse canonical correlation analysis
CN105894047A (en) * 2016-06-28 2016-08-24 深圳市唯特视科技有限公司 Human face classification system based on three-dimensional data
EP3185135A1 (en) * 2015-12-21 2017-06-28 Thomson Licensing Method for generating a synopsis of an audio visual content and apparatus performing the same
CN108319935A (en) * 2018-03-23 2018-07-24 大连民族大学 Based on the face group recognizer that region is sparse
CN108897791A (en) * 2018-06-11 2018-11-27 云南师范大学 A kind of image search method based on depth convolution feature and semantic similarity amount
CN109753950A (en) * 2019-02-11 2019-05-14 河北工业大学 Dynamic human face expression recognition method

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US11074495B2 (en) * 2013-02-28 2021-07-27 Z Advanced Computing, Inc. (Zac) System and method for extremely efficient image and pattern recognition and artificial intelligence platform
US9916538B2 (en) * 2012-09-15 2018-03-13 Z Advanced Computing, Inc. Method and system for feature detection
US11205103B2 (en) * 2016-12-09 2021-12-21 The Research Foundation for the State University Semisupervised autoencoder for sentiment analysis

Patent Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101034433A (en) * 2007-01-12 2007-09-12 郑文明 Method for classification human facial expression and semantics judgement quantization method
CN102662931A (en) * 2012-04-13 2012-09-12 厦门大学 Semantic role labeling method based on synergetic neural network
CN102779271A (en) * 2012-06-28 2012-11-14 南京信息工程大学 Expression semanteme sparse quantization method based on spectrum sparse canonical correlation analysis
EP3185135A1 (en) * 2015-12-21 2017-06-28 Thomson Licensing Method for generating a synopsis of an audio visual content and apparatus performing the same
CN105894047A (en) * 2016-06-28 2016-08-24 深圳市唯特视科技有限公司 Human face classification system based on three-dimensional data
CN108319935A (en) * 2018-03-23 2018-07-24 大连民族大学 Based on the face group recognizer that region is sparse
CN108897791A (en) * 2018-06-11 2018-11-27 云南师范大学 A kind of image search method based on depth convolution feature and semantic similarity amount
CN109753950A (en) * 2019-02-11 2019-05-14 河北工业大学 Dynamic human face expression recognition method

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
一种优化的语义条件模糊聚类;李洪波等;《计算机科学》;20131015(第10期);全文 *
不精确性语义网本体:语义、模型与表示;黄映辉等;《计算机工程与设计》;20110316(第03期);全文 *
基于AFS的多民族人脸语义描述与挖掘方法研究;段晓东等;《计算机学报》;20151117;第39卷(第07期);第1435-1449页 *

Also Published As

Publication number Publication date
CN110647856A (en) 2020-01-03

Similar Documents

Publication Publication Date Title
CN110298037B (en) Convolutional neural network matching text recognition method based on enhanced attention mechanism
CN110533057B (en) Chinese character verification code identification method under single-sample and few-sample scene
CN105760888B (en) A kind of neighborhood rough set integrated learning approach based on hierarchical cluster attribute
CN109165692B (en) User character prediction device and method based on weak supervised learning
CN110135459B (en) Zero sample classification method based on double-triple depth measurement learning network
Wang et al. A novel fingerprint classification method based on deep learning
CN111444344B (en) Entity classification method, entity classification device, computer equipment and storage medium
CN110532379B (en) Electronic information recommendation method based on LSTM (least Square TM) user comment sentiment analysis
CN104966104A (en) Three-dimensional convolutional neural network based video classifying method
CN104657718A (en) Face recognition method based on face image feature extreme learning machine
Shah et al. Comparative Analysis of Psychometric Prediction System
CN112257441B (en) Named entity recognition enhancement method based on counterfactual generation
CN112819023A (en) Sample set acquisition method and device, computer equipment and storage medium
CN109165275B (en) Intelligent substation operation ticket information intelligent search matching method based on deep learning
CN112052684A (en) Named entity identification method, device, equipment and storage medium for power metering
CN110245228A (en) The method and apparatus for determining text categories
Li et al. Dating ancient paintings of Mogao Grottoes using deeply learnt visual codes
CN113722474A (en) Text classification method, device, equipment and storage medium
CN109447110A (en) The method of the multi-tag classification of comprehensive neighbours' label correlative character and sample characteristics
CN112328859A (en) False news detection method based on knowledge-aware attention network
CN111968124A (en) Shoulder musculoskeletal ultrasonic structure segmentation method based on semi-supervised semantic segmentation
CN113516379B (en) Work order scoring method for intelligent quality inspection
CN114093445A (en) Patient screening and marking method based on multi-label learning
Ali et al. Fake accounts detection on social media using stack ensemble system
CN116416478B (en) Bioinformatics classification model based on graph structure data characteristics

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant