Temporal-stochastic tensor features for action recognition

被引:5
作者
Batalo, Bojan [1 ]
Souza, Lincon S. [2 ]
Gatto, Bernardo B. [3 ]
Sogi, Naoya [1 ]
Fukui, Kazuhiro [1 ]
机构
[1] Univ Tsukuba, Dept Comp Sci, Tsukuba, Ibaraki 3050006, Japan
[2] Natl Inst Adv Ind Sci & Technol, Koto ku, Tokyo 1350064, Japan
[3] Natl Inst Adv Ind Sci & Technol, Tsukuba, Ibaraki 3058560, Japan
来源
MACHINE LEARNING WITH APPLICATIONS | 2022年 / 10卷
关键词
Action recognition; Tensor data classification; Grassmann manifold; Subspace method; n-mode singular value decomposition; MUTUAL SUBSPACE METHOD; GESTURE RECOGNITION; KERNEL; DECOMPOSITION;
D O I
10.1016/j.mlwa.2022.100407
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In this paper, we propose Temporal -Stochastic Product Grassmann Manifold (TS-PGM), an efficient method for tensor classification in tasks such as gesture and action recognition. Our approach builds on the idea of representing tensors as points on Product Grassmann Manifold (PGM). This is achieved by mapping tensor modes to linear subspaces, where each subspace can be seen as a point on a Grassmann Manifold (GM) of the corresponding mode. Subsequently, it is possible to unify factor manifolds of respective modes in a natural way via PGM. However, this approach possibly discards discriminative information by treating all modes equally, and not considering the nature of temporal tensors such as videos. Therefore, we introduce TemporalStochastic Tensor features (TST features) to extract temporal information from tensors and encode them in a sequence -preserving TST subspace. These features and regular tensor modes can then be simultaneously used on PGM. Our framework addresses the problem of classification of temporal tensors while inheriting the unified mathematical interpretation of PGM because the TST subspace can be naturally integrated into PGM as a new factor manifold. Additionally, we enhance our method in two ways: (1) we improve the discrimination ability by projecting subspaces onto a Generalized Difference Subspace, and (2) we utilize kernel mapping to construct kernelized subspaces able to handle nonlinear data distribution. Experimental results on gesture and action recognition datasets show that our methods based on subspace representation with explicit TST features outperform pure spatio-temporal approaches.
引用
收藏
页数:11
相关论文
共 59 条
[1]  
[Anonymous], 2013, Diffusion MRI: from quantitative measurement to in vivo neuroanatomy
[2]   Grassmannian Sparse Representations and Motion Depth Surfaces for 3D Action Recognition [J].
Azary, Sherif ;
Savakis, Andreas .
2013 IEEE CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION WORKSHOPS (CVPRW), 2013, :492-499
[3]   Speeded-Up Robust Features (SURF) [J].
Bay, Herbert ;
Ess, Andreas ;
Tuytelaars, Tinne ;
Van Gool, Luc .
COMPUTER VISION AND IMAGE UNDERSTANDING, 2008, 110 (03) :346-359
[4]   NUMERICAL METHODS FOR COMPUTING ANGLES BETWEEN LINEAR SUBSPACES [J].
BJORCK, A ;
GOLUB, GH .
MATHEMATICS OF COMPUTATION, 1973, 27 (123) :579-594
[5]   Modeling Relational Drug-Target-Disease Interactions via Tensor Factorization with Multiple Web Sources [J].
Chen, Huiyuan ;
Li, Jing .
WEB CONFERENCE 2019: PROCEEDINGS OF THE WORLD WIDE WEB CONFERENCE (WWW 2019), 2019, :218-227
[6]  
Comon P., 2020, Math. Morphol.- Theory Appl., V4, P1, DOI 10.1515/mathm-2020-0001
[7]   Histograms of oriented gradients for human detection [J].
Dalal, N ;
Triggs, B .
2005 IEEE COMPUTER SOCIETY CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION, VOL 1, PROCEEDINGS, 2005, :886-893
[8]  
Fukui K, 2006, LECT NOTES COMPUT SC, V3852, P315
[9]  
Fukui K, 2007, LECT NOTES COMPUT SC, V4844, P467
[10]   Discriminant Feature Extraction by Generalized Difference Subspace [J].
Fukui, Kazuhiro ;
Sogi, Naoya ;
Kobayashi, Takumi ;
Xue, Jing-Hao ;
Maki, Atsuto .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2023, 45 (02) :1618-1635