2019
DOI: 10.1007/s11042-019-7659-4
|View full text |Cite
|
Sign up to set email alerts
|

Semantics characterization for eye shapes based on directional triangle-area curve clustering

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2019
2019
2021
2021

Publication Types

Select...
4

Relationship

1
3

Authors

Journals

citations
Cited by 4 publications
(2 citation statements)
references
References 49 publications
0
2
0
Order By: Relevance
“…Reference [7] develop an eyebrow semantic description via clustering based on Axiomatic Fuzzy Set. References [8] and [9] propose the semantics extraction algorithms to obtain the shape characterizations for eyes and eyebrows, respectively. The facial semantic descriptor in [10] is proposed based on information granules to represent the facial semantics, the results shows that this descriptor not only can characterize the key semantics of facial components of data, but also can improve the semantic classification performance in comparison with human perception.…”
Section: Introductionmentioning
confidence: 99%
“…Reference [7] develop an eyebrow semantic description via clustering based on Axiomatic Fuzzy Set. References [8] and [9] propose the semantics extraction algorithms to obtain the shape characterizations for eyes and eyebrows, respectively. The facial semantic descriptor in [10] is proposed based on information granules to represent the facial semantics, the results shows that this descriptor not only can characterize the key semantics of facial components of data, but also can improve the semantic classification performance in comparison with human perception.…”
Section: Introductionmentioning
confidence: 99%
“…e corresponding algorithms mainly include the construction of similarity structure, accurate extraction of semantic content of data information, and similarity calculation. e algorithm has a certain application value, which solves the problem of the traditional semantic similarity algorithm to a certain extent, but there is still the problem of algorithm loss when the amount of data information is large [16,17]; based on the structure of text information, relevant researchers propose a corresponding distance algorithm. is algorithm first calculates the corresponding distance length between the corresponding texts and identifies the corresponding ontology model between the two nodes with the farther 2 Complexity distance, the smaller the similarity.…”
Section: Related Work Analysis: Analysis Of the Current Research Status Of Semantic Similarity Algorithmmentioning
confidence: 99%