Mix Dimension in Poincare Geometry for 3D Skeleton-based Action Recognition

被引:43
作者
Peng, Wei [1 ]
Shi, Jingang [2 ]
Xia, Zhaoqiang [3 ]
Zhao, Guoying [1 ]
机构
[1] Univ Oulu, CMVS, Oulu, Finland
[2] Xi An Jiao Tong Univ, Sch Software Engn, Xian, Peoples R China
[3] Northwestern Polytech Univ, Xian, Peoples R China
来源
MM '20: PROCEEDINGS OF THE 28TH ACM INTERNATIONAL CONFERENCE ON MULTIMEDIA | 2020年
基金
中国国家自然科学基金; 芬兰科学院;
关键词
Skeleton-based Action Recognition; Graph Topology Analysis; Rie-mann Manifold; Graph Convolutional Networks;
D O I
10.1145/3394171.3413910
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Graph Convolutional Networks (GCNs) have already demonstrated their powerful ability to model the irregular data, e.g., skeletal data in human action recognition, providing an exciting new way to fuse rich structural information for nodes residing in different parts of a graph. In human action recognition, current works introduce a dynamic graph generation mechanism to better capture the underlying semantic skeleton connections and thus improves the performance. In this paper, we provide an orthogonal way to explore the underlying connections. Instead of introducing an expensive dynamic graph generation paradigm, we build a more efficient GCN on a Riemann manifold, which we think is a more suitable space to model the graph data, to make the extracted representations fit the embedding matrix. Specifically, we present a novel spatial-temporal GCN (ST-GCN) architecture which is defined via the Poincare geometry such that it is able to better model the latent anatomy of the structure data. To further explore the optimal projection dimension in the Riemann space, we mix different dimensions on the manifold and provide an efficient way to explore the dimension for each ST-GCN layer. With the final resulted architecture, we evaluate our method on two current largest scale 3D datasets, i.e., NTU RGB+D and NTU RGB+D 120. The comparison results show that the model could achieve a superior performance under any given evaluation metrics with only 40% model size when compared with the previous best GCN method, which proves the effectiveness of our model.
引用
收藏
页码:1432 / 1440
页数:9
相关论文
共 50 条
[1]  
Battaglia P., 2018, INT C LEARN REPR
[2]  
Benedetti Riccardo, 2012, Lectures on hyperbolic geometry
[3]   Geometric Deep Learning Going beyond Euclidean data [J].
Bronstein, Michael M. ;
Bruna, Joan ;
LeCun, Yann ;
Szlam, Arthur ;
Vandergheynst, Pierre .
IEEE SIGNAL PROCESSING MAGAZINE, 2017, 34 (04) :18-42
[4]  
Chami I, 2019, ADV NEUR IN, V32
[5]  
Cho Minhyung, 2017, Advances in Neural Information Processing Systems, V30
[6]  
Defferrard M, 2016, ADV NEUR IN, V29
[7]  
Du Y, 2015, PROC CVPR IEEE, P1110, DOI 10.1109/CVPR.2015.7298714
[8]  
Ganea OE, 2018, ADV NEUR IN, V31
[9]  
Gao X., 2019, P 2019 ACM INT C MUL
[10]   Wavelets on graphs via spectral graph theory [J].
Hammond, David K. ;
Vandergheynst, Pierre ;
Gribonval, Remi .
APPLIED AND COMPUTATIONAL HARMONIC ANALYSIS, 2011, 30 (02) :129-150