Budget-Aware Activity Detection with A Recurrent Policy Network
원문 초록
In this paper, we address the challenging problem of efficient temporal activity detection in untrimmed long videos. While most recent work has focused and advanced the detection accuracy, the inference time can take seconds to minutes in processing each single video, which is too slow to be useful in real-world settings. This motivates the proposed budget-aware framework, which learns to perform activity detection by intelligently selecting a small subset of frames according to a specified time budget. We formulate this problem as a Markov decision process, and adopt a recurrent network to model the frame selection policy. We derive a recurrent policy gradient based approach to approximate the gradient of the non-decomposable and non-differentiable objective defined in our problem. In the extensive experiments, we achieve competitive detection accuracy, and more importantly, our approach is able to substantially reduce computation time and detect multiple activities with only 0.35s for each untrimmed long video.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Multi-Stage Speaker Diarization for Noisy Classrooms
Optimizing Large Language Models for ESG Activity Detection in Financial Texts
VANPY: Voice Analysis Framework
When do they StOP?: A First Step Towards Automatically Identifying Team Communication in the Operating Room
Pre-Equalization Aided Grant-Free Massive Access in Massive MIMO System
Automatic detection and prediction of nAMD activity change in retinal OCT using Siamese networks and Wasserstein Distance for ordinality
토론
이 논문과 연결된 포럼 글이 아직 없습니다.