共 1 条
Sequential Order-Aware Coding-Based Robust Subspace Clustering for Human Action Recognition in Untrimmed Videos
被引:6
|作者:
Zhou, Zhili
[1
]
Ding, Chun
[2
]
Li, Jin
[1
]
Mohammadi, Eman
[3
]
Liu, Guangcan
[4
]
Yang, Yimin
[5
]
Wu, Q. M. Jonathan
[3
]
机构:
[1] Guangzhou Univ, Inst Artificial Intelligence & Blockchain, Guangzhou 510006, Guangdong, Peoples R China
[2] Nanjing Univ Informat Sci & Technol, Engn Res Ctr Digital Forecasts, Sch Comp & Software, Minist Educ, Nanjing, Peoples R China
[3] Univ Windsor, Dept Elect & Comp Engn, Windsor, ON N9B 3P4, Canada
[4] Southeast Univ, Sch Automat, Nanjing, 210018, Peoples R China
[5] Western Univ, Dept Elect & Comp Engn, London, ON N6A 3K7, Canada
基金:
中国国家自然科学基金;
关键词:
Action clustering;
action recognition;
unsupervised learning;
code learning;
untrimmed video;
EXTREME LEARNING-MACHINE;
SEGMENTATION;
NETWORK;
D O I:
10.1109/TIP.2022.3224877
中图分类号:
TP18 [人工智能理论];
学科分类号:
081104 ;
0812 ;
0835 ;
1405 ;
摘要:
Human action recognition (HAR) is one of most important tasks in video analysis. Since video clips distributed on networks are usually untrimmed, it is required to accurately segment a given untrimmed video into a set of action segments for HAR. As an unsupervised temporal segmentation technology, subspace clustering learns the codes from each video to construct an affinity graph, and then cuts the affinity graph to cluster the video into a set of action segments. However, most of the existing subspace clustering schemes not only ignore the sequential information of frames in code learning, but also the negative effects of noises when cutting the affinity graph, which lead to inferior performance. To address these issues, we propose a sequential order-aware coding-based robust subspace clustering (SOAC-RSC) scheme for HAR. By feeding the motion features of video frames into multi-layer neural networks, two expressive code matrices are learned in a sequential order-aware manner from unconstrained and constrained videos, respectively, to construct the corresponding affinity graphs. Then, with the consideration of the existence of noise effects, a simple yet robust cutting algorithm is proposed to cut the constructed affinity graphs to accurately obtain the action segments for HAR. The extensive experiments demonstrate the proposed SOAC-RSC scheme achieves the state-of-the-art performance on the datasets of Keck Gesture and Weizmann, and provides competitive performance on the other 6 public datasets such as UCF101 and URADL for HAR task, compared to the recent related approaches.
引用
收藏
页码:13 / 28
页数:16
相关论文