TadML: A fast temporal action detection with Mechanics-MLP
Not on the map. Why?
Abstract (arXiv)
Temporal Action Detection(TAD) is a crucial but challenging task in video understanding.It is aimed at detecting both the type and start-end frame for each action instance in a long, untrimmed video.Most current models adopt both RGB and Optical-Flow streams for the TAD task. Thus, original RGB frames must be converted manually into Optical-Flow frames with additional computation and time cost, which is an obstacle to achieve real-time processing. At present, many models adopt two-stage strategies, which would slow the inference speed down and complicatedly tuning on proposals generating.By comparison, we propose a one-stage anchor-free temporal localization method with RGB stream only, in which a novel Newtonian Mechanics-MLP architecture is established. It has comparable accuracy with all existing state-of-the-art models, while surpasses the inference speed of these methods by a large margin. The typical inference speed in this paper is astounding 4.44 video per second on THUMOS14. In applications, because there is no need to convert optical flow, the inference speed will be faster.It also proves that MLP has great potential in downstream tasks such as TAD. The source code is available at https://github.com/BonedDeng/TadML
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 30 of its 42 references that are in the map. First posted on arXiv 7 Jun 2022.
Builds on
30 of 42 references.
References · 30
- 2017Quo Vadis, Action Recognition? A New Model and the Kinetics Datasetcited by 3,259
- 2016YOLO9000: Better, Faster, Strongercited by 1,429
- 2019Generalized Intersection over Union: A Metric and A Loss for Bounding Box Regressioncited by 1,361
- 2017A Closer Look at Spatiotemporal Convolutions for Action Recognitioncited by 1,139
- 2017Focal Loss for Dense Object Detectioncited by 749
- 2014Long-term Recurrent Convolutional Networks for Visual Recognition and Descriptioncited by 483
- 2017Soft-NMS -- Improving Object Detection With One Line of Codecited by 380
- 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
- 2019G-TAD: Sub-Graph Localization for Temporal Action Detectioncited by 248
- 2016The THUMOS Challenge on Action Recognition for Videos "in the Wild"cited by 213
18 more
- 2019Graph Convolutional Networks for Temporal Action Localizationcited by 208
- 2018Rethinking the Faster R-CNN Architecture for Temporal Action Localizationcited by 194
- 2017R-C3D: Region Convolutional 3D Network for Temporal Activity Detectioncited by 161
- 2021Learning Salient Boundary Feature for Anchor-free Temporal Action Localizationcited by 156
- 2021End-to-end Temporal Action Detection with Transformercited by 150
- 2019Gaussian Temporal Awareness Networks for Action Localizationcited by 135
- 2017Single Shot Temporal Action Detectioncited by 123
- 2017TURN TAP: Temporal Unit Regression Network for Temporal Action Proposalscited by 113
- 2019Fast Learning of Temporal Action Proposal via Dense Boundary Generatorcited by 89
- 2018Multi-granularity Generator for Temporal Action Proposalcited by 77
- 2020Revisiting Anchor Mechanisms for Temporal Action Localizationcited by 75
- 2020BSN++: Complementary Boundary Regressor with Scale-Balanced Relation Modeling for Temporal Action Proposal Generationcited by 65
- 2021Enriching Local and Global Contexts for Temporal Action Localizationcited by 64
- 2021An Image Patch is a Wave: Phase-Aware Vision MLPcited by 61
- 2022An Empirical Study of End-to-End Temporal Action Detectioncited by 40
- 2017Temporal Context Network for Activity Localization in Videoscited by 37
- 2021MorphMLP: An Efficient MLP-Like Backbone for Spatial-Temporal Representation Learningcited by 21
- 2017Exploring Temporal Preservation Networks for Precise Temporal Action Localizationcited by 11
Built on by
Not cited yet.