2020 15th IEEE International Conference on Signal Processing (ICSP) 2020
DOI: 10.1109/icsp48669.2020.9321082
|View full text |Cite
|
Sign up to set email alerts
|

Sparse and Low-rank Tucker Decomposition with Its Application to 2D+3D Facial Expression Recognition

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
4

Relationship

2
2

Authors

Journals

citations
Cited by 4 publications
(2 citation statements)
references
References 41 publications
0
2
0
Order By: Relevance
“…To alleviate this issue, a more natural way to describe 3D facial expression data is using tensors, which not only maintains the spacial structure but also admits sparse representation when appropriate tensor decomposition is chosen, by employing tools from tensor analysis. At present, the existing methods using tensors to describe 3D facial expression data are mostly based on tensor decomposition [13][14][15][16][17]20,21], which have opened up a new technology direction and made some progress. However, the local structure (geometric information) of 3D tensor samples in these methods are not maintained in the low-dimensional tensors space during the dimensionality reduction.…”
Section: Introductionmentioning
confidence: 99%
“…To alleviate this issue, a more natural way to describe 3D facial expression data is using tensors, which not only maintains the spacial structure but also admits sparse representation when appropriate tensor decomposition is chosen, by employing tools from tensor analysis. At present, the existing methods using tensors to describe 3D facial expression data are mostly based on tensor decomposition [13][14][15][16][17]20,21], which have opened up a new technology direction and made some progress. However, the local structure (geometric information) of 3D tensor samples in these methods are not maintained in the low-dimensional tensors space during the dimensionality reduction.…”
Section: Introductionmentioning
confidence: 99%
“…In recent years, there are several tensor decompositionbased methods [25][26][27][28] which have been proposed for FER. For instance, in [26], a method based on low-rank tensor completion is proposed and applied into the 2D+3D FER.…”
Section: Introductionmentioning
confidence: 99%