Nonnegative tensor-based linear dynamical systems for recognizing human action from 3D skeletons (Q2298940)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Nonnegative tensor-based linear dynamical systems for recognizing human action from 3D skeletons |
scientific article; zbMATH DE number 7171419
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Nonnegative tensor-based linear dynamical systems for recognizing human action from 3D skeletons |
scientific article; zbMATH DE number 7171419 |
Statements
Nonnegative tensor-based linear dynamical systems for recognizing human action from 3D skeletons (English)
0 references
20 February 2020
0 references
Summary: Recently, skeleton-based action recognition has become a very important topic in the field of computer vision. It is a challenging task to accurately build a human action model and precisely distinguish similar human actions. In this paper, an action (skeleton sequence) is represented as a third-order nonnegative tensor time series to capture the original spatiotemporal information of the action. As a linear dynamical system (LDS) is an efficient tool for encoding the spatiotemporal data in various disciplines, this paper proposes a nonnegative tensor-based LDS (nLDS) to model the third-order nonnegative tensor time series. Nonnegative Tucker decomposition (NTD) is utilized to estimate the parameters of the nLDS model. These parameters are used to build extended observability sequence \(\mathbf{O}_{\infty}^T\) for the action, which implies that \(\mathbf{O}_{\infty}^T\) can be considered as the feature descriptor of the action. To avoid the limitations introduced by approximating \(\mathbf{O}_{\infty}^T\) with a finite-order matrix, we represent an action as a point on infinite Grassmann manifold comprising the orthonormalized extended observability sequences. The classification task can be performed by dictionary learning and sparse coding on the infinite Grassmann manifold. The experimental results on the MSR-Action3D, UTKinect-Action, and G3D-Gaming datasets demonstrate that the proposed approach achieves a better performance in comparison with the state-of-the-art methods.
0 references
0.7598224878311157
0 references
0.7016479969024658
0 references
0.6984784007072449
0 references
0.6950791478157043
0 references
0.6921274662017822
0 references