mlsanityData to 14 Oct 2026

Weakly-Supervised Temporal Action Localization with Bidirectional Semantic Consistency Constraint

arXiv 2304.12616 ↗First posted 25 Apr 2023cs.CVcited by 2

Not on the map. Why?

Abstract (arXiv)

Weakly Supervised Temporal Action Localization (WTAL) aims to classify and localize temporal boundaries of actions for the video, given only video-level category labels in the training datasets. Due to the lack of boundary information during training, existing approaches formulate WTAL as a classificationproblem, i.e., generating the temporal class activation map (T-CAM) for localization. However, with only classification loss, the model would be sub-optimized, i.e., the action-related scenes are enough to distinguish different class labels. Regarding other actions in the action-related scene ( i.e., the scene same as positive actions) as co-scene actions, this sub-optimized model would misclassify the co-scene actions as positive actions. To address this misclassification, we propose a simple yet efficient method, named bidirectional semantic consistency constraint (Bi-SCC), to discriminate the positive actions from co-scene actions. The proposed Bi-SCC firstly adopts a temporal context augmentation to generate an augmented video that breaks the correlation between positive actions and their co-scene actions in the inter-video; Then, a semantic consistency constraint (SCC) is used to enforce the predictions of the original video and augmented video to be consistent, hence suppressing the co-scene actions. However, we find that this augmented video would destroy the original temporal context. Simply applying the consistency constraint would affect the completeness of localized positive actions. Hence, we boost the SCC in a bidirectional way to suppress co-scene actions while ensuring the integrity of positive actions, by cross-supervising the original and augmented videos. Finally, our proposed Bi-SCC can be applied to current WTAL approaches, and improve their performance. Experimental results show that our approach outperforms the state-of-the-art methods on THUMOS14 and ActivityNet.

Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 40 of its 73 references that are in the map. First posted on arXiv 25 Apr 2023.

Builds on

40 of 73 references.

References · 40

  1. 2014Adam: A Method for Stochastic Optimizationcited by 37,240
  2. 2017Quo Vadis, Action Recognition? A New Model and the Kinetics Datasetcited by 3,270
  3. 2017Non-local Neural Networkscited by 2,293
  4. 2017The Kinetics Human Action Video Datasetcited by 1,909
  5. 2014Two-Stream Convolutional Networks for Action Recognition in Videoscited by 1,068
  6. 2016Convolutional Two-Stream Network Fusion for Video Action Recognitioncited by 384
  7. 2019BMN: Boundary-Matching Network for Temporal Action Proposal Generationcited by 329
  8. 2020Self-supervised Equivariant Attention Mechanism for Weakly Supervised Semantic Segmentationcited by 300
  9. 2018BSN: Boundary Sensitive Network for Temporal Action Proposal Generationcited by 271
  10. 2019Graph Convolutional Networks for Temporal Action Localizationcited by 208
  11. 2019Gaussian Temporal Awareness Networks for Action Localizationcited by 135
  12. 2017UntrimmedNets for Weakly Supervised Action Recognition and Detectioncited by 130
28 more
  1. 2017Single Shot Temporal Action Detectioncited by 123
  2. 2021Relaxed Transformer Decoders for Direct Action Proposal Generationcited by 117
  3. 2017Weakly Supervised Action Localization by Sparse Temporal Pooling Networkcited by 100
  4. 2018W-TALC: Weakly-supervised Temporal Activity Localization and Classificationcited by 87
  5. 2021Weakly Supervised Object Localization and Detection: A Surveycited by 84
  6. 2018AutoLoc: Weakly-supervised Temporal Action Localizationcited by 75
  7. 2019Background Suppression Network for Weakly-supervised Temporal Action Localizationcited by 73
  8. 2020SF-Net: Single-Frame Supervision for Temporal Action Localizationcited by 62
  9. 2020Weakly-Supervised Action Localization by Generative Attention Modelingcited by 59
  10. 2019Weakly-supervised Action Localization with Background Modelingcited by 53
  11. 20193C-Net: Category Count and Center Loss for Weakly-Supervised Action Localizationcited by 52
  12. 2020Weakly-Supervised Action Localization with Expectation-Maximization Multi-Instance Learningcited by 48
  13. 2021A Hybrid Attention Mechanism for Weakly-Supervised Temporal Action Localizationcited by 45
  14. 2020Adversarial Background-Aware Loss for Weakly-supervised Temporal Activity Localizationcited by 40
  15. 2022ASM-Loc: Action-aware Segment Modeling for Weakly-Supervised Temporal Action Localizationcited by 40
  16. 2018Memory Attention Networks for Skeleton-based Action Recognitioncited by 36
  17. 2021Cross-modal Consensus Network for Weakly Supervised Temporal Action Localizationcited by 34
  18. 2022Fine-grained Temporal Contrastive Learning for Weakly-supervised Temporal Action Localizationcited by 33
  19. 2022Weakly Supervised Temporal Action Localization via Representative Snippet Knowledge Propagationcited by 32
  20. 2018Graph Edge Convolutional Neural Networks for Skeleton Based Action Recognitioncited by 28
  21. 2021Support-Set Based Cross-Supervision for Video Groundingcited by 28
  22. 2021Foreground-Action Consistency Network for Weakly Supervised Temporal Action Localizationcited by 26
  23. 2021Hybrid Dynamic Contrast and Probability Distillation for Unsupervised Person Re-Idcited by 22
  24. 2021Background-Click Supervision for Temporal Action Localizationcited by 21
  25. 2021ACGNet: Action Complement Graph Network for Weakly-supervised Temporal Action Localizationcited by 17
  26. 2021The Blessings of Unlabeled Background in Untrimmed Videoscited by 16
  27. 2020Weakly Supervised Temporal Action Localization with Segment-Level Labelscited by 9
  28. 2019AdapNet: Adaptability Decomposing Encoder-Decoder Network for Weakly Supervised Action Recognition and Localizationcited by 8

Built on by

Cited by year

Citing papers per year: 2023: 1; 2024: 1.

2 papers.