Transferable Knowledge-Based Multi-Granularity Aggregation Network for Temporal Action Localization: Submission to ActivityNet Challenge 2021
Not on the map. Why?
Abstract (arXiv)
This technical report presents an overview of our solution used in the submission to 2021 HACS Temporal Action Localization Challenge on both Supervised Learning Track and Weakly-Supervised Learning Track. Temporal Action Localization (TAL) requires to not only precisely locate the temporal boundaries of action instances, but also accurately classify the untrimmed videos into specific categories. However, Weakly-Supervised TAL indicates locating the action instances using only video-level class labels. In this paper, to train a supervised temporal action localizer, we adopt Temporal Context Aggregation Network (TCANet) to generate high-quality action proposals through ``local and global" temporal context aggregation and complementary as well as progressive boundary refinement. As for the WSTAL, a novel framework is proposed to handle the poor quality of CAS generated by simple classification network, which can only focus on local discriminative parts, rather than locate the entire interval of target actions. Further inspired by the transfer learning method, we also adopt an additional module to transfer the knowledge from trimmed videos (HACS Clips dataset) to untrimmed videos (HACS Segments dataset), aiming at promoting the classification performance on untrimmed videos. Finally, we employ a boundary regression module embedded with Outer-Inner-Contrastive (OIC) loss to automatically predict the boundaries based on the enhanced CAS. Our proposed scheme achieves 39.91 and 29.78 average mAP on the challenge testing set of supervised and weakly-supervised temporal action localization track respectively.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 26 of its 38 references that are in the map. First posted on arXiv 27 Jul 2021.
Builds on
26 of 38 references.
References · 26
- 2017Attention Is All You Needcited by 59,932
- 2015Learning Deep Features for Discriminative Localizationcited by 2,430
- 2017Non-local Neural Networkscited by 2,290
- 2018SlowFast Networks for Video Recognitioncited by 1,862
- 2016Temporal Segment Networks: Towards Good Practices for Deep Action Recognitioncited by 899
- 2018TSM: Temporal Shift Module for Efficient Video Understandingcited by 852
- 2020ResNeSt: Split-Attention Networkscited by 445
- 2017Learning Spatio-Temporal Representation with Pseudo-3D Residual Networkscited by 386
- 2019BMN: Boundary-Matching Network for Temporal Action Proposal Generationcited by 327
- 2018BSN: Boundary Sensitive Network for Temporal Action Proposal Generationcited by 271
- 2017Temporal Action Detection with Structured Segment Networkscited by 265
- 2018Long-Term Feature Banks for Detailed Video Understandingcited by 239
14 more
- 2018Rethinking the Faster R-CNN Architecture for Temporal Action Localizationcited by 194
- 2017Single Shot Temporal Action Detectioncited by 123
- 2017TURN TAP: Temporal Unit Regression Network for Temporal Action Proposalscited by 113
- 2017CDC: Convolutional-De-Convolutional Networks for Precise Temporal Action Localization in Untrimmed Videoscited by 112
- 2021Temporal Context Aggregation Network for Temporal Action Proposal Refinementcited by 111
- 2018Multi-granularity Generator for Temporal Action Proposalcited by 77
- 2018AutoLoc: Weakly-supervised Temporal Action Localizationcited by 75
- 2016CUHK & ETHZ & SIAT Submission to ActivityNet Challenge 2016cited by 53
- 2018CTAP: Complementary Temporal Action Proposal Generationcited by 46
- 2020Temporal Interlacing Networkcited by 45
- 2017Cascaded Boundary Regression for Temporal Action Detectioncited by 35
- 2020Accurate Temporal Action Proposal Generation with Relation-Aware Pyramid Networkcited by 28
- 2015Towards Good Practices for Very Deep Two-Stream ConvNetscited by 25
- 2016Untrimmed Video Classification for Activity Detection: submission to ActivityNet Challengecited by 7
Built on by
Citing papers per year: 2023: 1.
1 paper.