Channel-wise Topology Refinement Graph Convolution for Skeleton-Based Action Recognition
文献类型:会议论文
作者 | chen yuxin2,4![]() ![]() ![]() ![]() ![]() |
出版日期 | 2021-10 |
会议日期 | 2021-10 |
会议地点 | 线上 |
英文摘要 | Graph convolutional networks (GCNs) have been widely used and achieved remarkable results in skeleton-based action recognition. In GCNs, graph topology dominates feature aggregation and therefore is the key to extracting representative features. In this work, we propose a novel Channel-wise Topology Refinement Graph Convolution (CTR-GC) to dynamically learn different topologies and effectively aggregate joint features in different channels for skeleton-based action recognition. The proposed CTR-GC models channel-wise topologies through learning a shared topology as a generic prior for all channels and refining it with channel-specific correlations for each channel. Our refinement method introduces few extra parameters and significantly reduces the difficulty of modeling channel-wise topologies. Furthermore, via reformulating graph convolutions into a unified form, we find that CTR-GC relaxes strict constraints of graph convolutions, leading to stronger representation capability. Combining CTR-GC with temporal modeling modules, we develop a powerful graph convolutional network named CTR-GCN which notably outperforms state-of-the-art methods on the NTU RGB+D, NTU RGB+D 120, and NW-UCLA datasets. |
源URL | [http://ir.ia.ac.cn/handle/173211/57583] ![]() |
专题 | 自动化研究所_模式识别国家重点实验室_视频内容安全团队 |
通讯作者 | yuan chunfeng |
作者单位 | 1.School of Aeronautical Manufacturing Engineering, Nanchang Hangkong University 2.School of Artificial Intelligence, University of Chinese Academy of Sciences 3.CAS Center for Excellence in Brain Science and Intelligence Technology 4.NLPR, Institute of Automation, Chinese Academy of Sciences |
推荐引用方式 GB/T 7714 | chen yuxin,zhang ziqi,yuan chunfeng,et al. Channel-wise Topology Refinement Graph Convolution for Skeleton-Based Action Recognition[C]. 见:. 线上. 2021-10. |
入库方式: OAI收割
来源:自动化研究所
其他版本
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。