Cluster trees of improved trajectories for action recognition

详细信息    查看全文

• 作者：Quan-Qi Chen ; ^{quanqi.chen@gmail.com" class="auth_mail" title="E-mail the corresponding author}Author Vitae ; Yu-Jin Zhang ^{zhang-yj@mail.tsinghua.edu.cn" class="auth_mail" title="E-mail the corresponding author}Author Vitae
• 关键词：Action recognition ; Improved trajectories ; Fisher vector ; Cluster trees ; Dimensionality reduction
• 刊名：Neurocomputing
• 出版年：2016
• 出版时间：15 January 2016
• 年：2016
• 卷：173
• 期：part_P2
• 页码：364-372
• 全文大小：1192 K

文摘

Recently, as an efficient representation of realistic videos, improved trajectory features (ITF) combined with Fisher vector (FV) encoding achieved state-of-the-art results on four challenging datasets concerning action recognition. However, directly integrating it with simple spatio-temporal pyramid (STP) will result in performance degradation. Therefore, in this paper, a novel version of cluster trees model is proposed to improve recognition performance by taking into account spatio-temporal relationships between local trajectory features. We modified and improved cluster trees model to reduce noisy clusters and alleviate intra-class variation. A further advantage of the proposed method is significantly reducing memory storage and computation time by conduct dimensionality reduction on Fisher vectors. Finally, an adaptive kernel is proposed to efficiently compare the variable-size tree representations of two videos for action recognition, which mitigates the risk introduced by noisy cluster tree nodes. Experimental results on four challenging action datasets (i.e., Olympic Sports, Hollywood2, HMDB51 and UCF50) demonstrate the effectiveness and robustness of the proposed approach which outperforms the current state-of-the-art.