Unsupervised Hierarchical Dynamic Parsing and Encoding for Action Recognition

被引:16
|
作者
Su, Bing [1 ]
Zhou, Jiahuan [2 ]
Ding, Xiaoqing [3 ]
Wu, Ying [2 ]
机构
[1] Chinese Acad Sci, Inst Software, Sci & Technol Integrated Informat Syst Lab, Beijing 100190, Peoples R China
[2] Northwestern Univ, Dept Elect Engn & Comp Sci, Evanston, IL 60208 USA
[3] Tsinghua Univ, Dept Elect Engn, Tsinghua Natl Lab Informat Sci & Technol, State Key Lab Intelligent Technol & Syst, Beijing 100084, Peoples R China
基金
美国国家科学基金会; 中国国家自然科学基金;
关键词
Action recognition; temporal clustering; hierarchical modeling; dynamic encoding; ENSEMBLE; VECTOR; MODELS; PARTS;
D O I
10.1109/TIP.2017.2745212
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Generally, the evolution of an action is not uniform across the video, but exhibits quite complex rhythms and non-stationary dynamics. To model such non-uniform temporal dynamics, in this paper, we describe a novel hierarchical dynamic parsing and encoding method to capture both the locally smooth dynamics and globally drastic dynamic changes. It parses the dynamics of an action into different layers and encodes such multi-layer temporal information into a joint representation for action recognition. At the first layer, the action sequence is parsed in an unsupervised manner into several smooth-changing stages corresponding to different key poses or temporal structures by temporal clustering. The dynamics within each stage are encoded by mean-pooling or rank-pooling. At the second layer, the temporal information of the ordered dynamics extracted from the previous layer is encoded again by rank-pooling to form the overall representation. Extensive experiments on a gesture action data set (Chalearn Gesture) and three generic action data sets (Olympic Sports, Hollywood2, and UCF101) have demonstrated the effectiveness of the proposed method.
引用
收藏
页码:5784 / 5799
页数:16
相关论文
共 50 条
  • [1] Hierarchical Dynamic Parsing and Encoding for Action Recognition
    Su, Bing
    Zhou, Jiahuan
    Ding, Xiaoqing
    Wang, Hao
    Wu, Ying
    COMPUTER VISION - ECCV 2016, PT IV, 2016, 9908 : 202 - 217
  • [2] Action recognition using dynamic hierarchical trees
    Wang, Tingwei
    Duan, Peng
    Ma, Bingxian
    Wu, Peng
    Lu, Weizhi
    JOURNAL OF VISUAL COMMUNICATION AND IMAGE REPRESENTATION, 2019, 61 : 315 - 325
  • [3] Discriminative Hierarchical Part-based Models for Human Parsing and Action Recognition
    Wang, Yang
    Duan Tran
    Liao, Zicheng
    Forsyth, David
    JOURNAL OF MACHINE LEARNING RESEARCH, 2012, 13 : 3075 - 3102
  • [4] Action recognition based on hierarchical dynamic Bayesian network
    Xiao, Qinkun
    Song, Ren
    MULTIMEDIA TOOLS AND APPLICATIONS, 2018, 77 (06) : 6955 - 6968
  • [5] Bayesian Hierarchical Dynamic Model for Human Action Recognition
    Zhao, Rui
    Xu, Wanru
    Su, Hui
    Ji, Qiang
    2019 IEEE/CVF CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR 2019), 2019, : 7725 - 7734
  • [6] Action recognition based on hierarchical dynamic Bayesian network
    Qinkun Xiao
    Ren Song
    Multimedia Tools and Applications, 2018, 77 : 6955 - 6968
  • [7] Action recognition using probabilistic parsing
    Bobick, AF
    Ivanov, YA
    1998 IEEE COMPUTER SOCIETY CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION, PROCEEDINGS, 1998, : 196 - 202
  • [8] The two stage hierarchical unsupervised learning system for complex dynamic scene recognition
    Graham, James
    O'Connor, Alan
    Ternovskiy, Igor V.
    Ilin, Roman
    CYBER SENSING 2013, 2013, 8757
  • [9] Unsupervised Hyperbolic Action Recognition
    Castro-Vargas, John-Alejandro
    Garcia-Garcia, Alberto
    Martinez-Gonzalez, Pablo
    Oprea, Sergiu
    Garcia-Rodriguez, Jose
    ROBOT2022: FIFTH IBERIAN ROBOTICS CONFERENCE: ADVANCES IN ROBOTICS, VOL 2, 2023, 590 : 479 - 488
  • [10] HIERARCHICAL MOTION DECOMPOSITION FOR DYNAMIC SCENE PARSING
    Perez-Rua, Juan-Manuel
    Crivelli, Tomas
    Perez, Patrick
    Bouthemy, Patrick
    2016 IEEE INTERNATIONAL CONFERENCE ON IMAGE PROCESSING (ICIP), 2016, : 3952 - 3956