Pith. sign in

REVIEW 2 cited by

HAN: An Efficient Hierarchical Self-Attention Network for Skeleton-Based Gesture Recognition

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2106.13391 v1 pith:JXIFLEYN submitted 2021-06-25 cs.CV

classification cs.CV
keywords self-attentionfeaturesgesturehandmodulenetworkrecognitionhierarchical
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Previous methods for skeleton-based gesture recognition mostly arrange the skeleton sequence into a pseudo picture or spatial-temporal graph and apply deep Convolutional Neural Network (CNN) or Graph Convolutional Network (GCN) for feature extraction. Although achieving superior results, these methods have inherent limitations in dynamically capturing local features of interactive hand parts, and the computing efficiency still remains a serious issue. In this work, the self-attention mechanism is introduced to alleviate this problem. Considering the hierarchical structure of hand joints, we propose an efficient hierarchical self-attention network (HAN) for skeleton-based gesture recognition, which is based on pure self-attention without any CNN, RNN or GCN operators. Specifically, the joint self-attention module is used to capture spatial features of fingers, the finger self-attention module is designed to aggregate features of the whole hand. In terms of temporal features, the temporal self-attention module is utilized to capture the temporal dynamics of the fingers and the entire hand. Finally, these features are fused by the fusion self-attention module for gesture classification. Experiments show that our method achieves competitive results on three gesture recognition datasets with much lower computational complexity.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Designing Semi-Structured Pruning of Graph Convolutional Networks for Skeleton-based Recognition

    cs.CV 2024-12 conditional novelty 5.0 of 10

    A learned cascade of band-stop, weight-sharing, and gating steps produces semi-structured pruning masks for skeleton GCNs, reporting better accuracy-for-speedup trade-offs than pure structured or unstructured pruning.

  2. Learning Coarse-to-Fine Pruning of Graph Convolutional Networks for Skeleton-based Recognition

    cs.CV 2024-12 conditional novelty 4.0 of 10

    Coarse-to-fine pruning, defined as a product of channel, row, column, and entry-wise masks, improves the accuracy-speedup tradeoff of pruned GCNs on SBU and FPHA skeleton benchmarks.

Pith tools