FASTER recurrent networks for efficient video classification

46Citations
Citations of this article
77Readers
Mendeley users who have this article in their library.

Abstract

Typical video classification methods often divide a video into short clips, do inference on each clip independently, then aggregate the clip-level predictions to generate the video-level results. However, processing visually similar clips independently ignores the temporal structure of the video sequence, and increases the computational cost at inference time. In this paper, we propose a novel framework named FASTER, i.e., Feature Aggregation for Spatio-TEmporal Redundancy. FASTER aims to leverage the redundancy between neighboring clips and reduce the computational cost by learning to aggregate the predictions from models of different complexities. The FASTER framework can integrate high quality representations from expensive models to capture subtle motion information and lightweight representations from cheap models to cover scene changes in the video. A new recurrent network (i.e., FAST-GRU) is designed to aggregate the mixture of different representations. Compared with existing approaches, FASTER can reduce the FLOPs by over 10× while maintaining the state-of-the-art accuracy across popular datasets, such as Kinetics, UCF-101 and HMDB-51.

Cite

CITATION STYLE

APA

Zhu, L., Tran, D., Sevilla-Lara, L., Yang, Y., Feiszli, M., & Wang, H. (2020). FASTER recurrent networks for efficient video classification. In AAAI 2020 - 34th AAAI Conference on Artificial Intelligence (pp. 13098–13105). AAAI press. https://doi.org/10.1609/aaai.v34i07.7012

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free