English

Efficient Temporal Action Segmentation via Boundary-aware Query Voting

Computer Vision and Pattern Recognition 2024-05-28 v1

Abstract

Although the performance of Temporal Action Segmentation (TAS) has improved in recent years, achieving promising results often comes with a high computational cost due to dense inputs, complex model structures, and resource-intensive post-processing requirements. To improve the efficiency while keeping the performance, we present a novel perspective centered on per-segment classification. By harnessing the capabilities of Transformers, we tokenize each video segment as an instance token, endowed with intrinsic instance segmentation. To realize efficient action segmentation, we introduce BaFormer, a boundary-aware Transformer network. It employs instance queries for instance segmentation and a global query for class-agnostic boundary prediction, yielding continuous segment proposals. During inference, BaFormer employs a simple yet effective voting strategy to classify boundary-wise segments based on instance segmentation. Remarkably, as a single-stage approach, BaFormer significantly reduces the computational costs, utilizing only 6% of the running time compared to state-of-the-art method DiffAct, while producing better or comparable accuracy over several popular benchmarks. The code for this project is publicly available at https://github.com/peiyao-w/BaFormer.

Keywords

Cite

@article{arxiv.2405.15995,
  title  = {Efficient Temporal Action Segmentation via Boundary-aware Query Voting},
  author = {Peiyao Wang and Yuewei Lin and Erik Blasch and Jie Wei and Haibin Ling},
  journal= {arXiv preprint arXiv:2405.15995},
  year   = {2024}
}

Comments

17 pages, 8 figures, 11 tables

R2 v1 2026-06-28T16:39:45.405Z