Papers › Do we really need temporal convolutions in action segmentation?

Do we really need temporal convolutions in action segmentation?

26 May 2022arXiv:2205.13425archive 2025-07-28

Dazhao Du, Bing Su, Yu Li, Zhongang Qi, Lingyu Si, Ying Shan

Action classification has made great progress, but segmenting and recognizing actions from long untrimmed videos remains a challenging problem. Most state-of-the-art methods focus on designing temporal convolution-based models, but the inflexibility of temporal convolutions and the difficulties in modeling long-term temporal dependencies restrict the potential of these models. Transformer-based models with adaptable and sequence modeling capabilities have recently been used in various tasks. However, the lack of inductive bias and the inefficiency of handling long video sequences limit the application of Transformer in action segmentation. In this paper, we design a pure Transformer-based model without temporal convolutions by incorporating temporal sampling, called Temporal U-Transformer (TUT). The U-Transformer architecture reduces complexity while introducing an inductive bias that adjacent frames are more likely to belong to the same class, but the introduction of coarse resolutions results in the misclassification of boundaries. We observe that the similarity distribution between a boundary frame and its neighboring frames depends on whether the boundary frame is the start or end of an action segment. Therefore, we further propose a boundary-aware loss based on the distribution of similarity scores between frames from attention modules to enhance the ability to recognize boundaries. Extensive experiments show the effectiveness of our model.

PaperPDFCode

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

Code

ddz16/TUT officialmentioned on GitHubpytorch report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Tasks

Action ClassificationAction SegmentationInductive Bias

Results from the paper archive 2025-07-28

TaskDatasetModelMetricValueRank at snapshotLeaderboardReport
Action Segmentation 50 Salads EUT Acc 87.4 #9 of 28 Archive leaderboard report
Action Segmentation 50 Salads EUT Edit 82.9 #9 of 28 Archive leaderboard report
Action Segmentation 50 Salads EUT F1@10% 89.2 #9 of 28 Archive leaderboard report
Action Segmentation 50 Salads EUT F1@25% 87.5 #9 of 28 Archive leaderboard report
Action Segmentation 50 Salads EUT F1@50% 81 #9 of 28 Archive leaderboard report
Action Segmentation 50Salads EUT Acc 87.4 #1 of 1 Archive leaderboard report
Action Segmentation 50Salads EUT Edit 82.9 #1 of 1 Archive leaderboard report
Action Segmentation 50Salads EUT F1@10% 89.2 #1 of 1 Archive leaderboard report
Action Segmentation 50Salads EUT F1@25% 87.5 #1 of 1 Archive leaderboard report
Action Segmentation 50Salads EUT F1@50% 81 #1 of 1 Archive leaderboard report
Action Segmentation Breakfast EUT Acc 75 #11 of 37 Archive leaderboard report
Action Segmentation Breakfast EUT Average F1 69.3 #11 of 37 Archive leaderboard report
Action Segmentation Breakfast EUT Edit 74.6 #11 of 37 Archive leaderboard report
Action Segmentation Breakfast EUT F1@10% 76.2 #11 of 37 Archive leaderboard report
Action Segmentation Breakfast EUT F1@25% 71.8 #11 of 37 Archive leaderboard report
Action Segmentation Breakfast EUT F1@50% 59.8 #11 of 37 Archive leaderboard report
Action Segmentation GTEA EUT Acc 77 #23 of 28 Archive leaderboard report
Action Segmentation GTEA EUT Edit 83.9 #23 of 28 Archive leaderboard report
Action Segmentation GTEA EUT F1@10% 88.2 #23 of 28 Archive leaderboard report
Action Segmentation GTEA EUT F1@25% 87.2 #23 of 28 Archive leaderboard report
Action Segmentation GTEA EUT F1@50% 74 #23 of 28 Archive leaderboard report

Ranks are positions in the archive's leaderboards as they stood at the 2025-07-28 snapshot. Results published since then are not among these rows, so a rank here is not a current standing.

Methods

Absolute Position EncodingsAdamAttentionBPEConcatenated Skip ConnectionConvolutionDense ConnectionsDropoutLabel SmoothingLayer NormalizationLinear LayerMax PoolingMulti-Head AttentionPosition-Wise Feed-Forward LayerReLUResidual ConnectionSoftmaxTransformerU-Net

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections