提出轻量级音频视频说话人检测系统,实时性更强、内存占用更低。
An Efficient and Streaming Audio Visual Active Speaker Detection System
- 限制未来帧和过去帧的上下文数量,降低延迟与内存消耗。
- 约束后模型性能优于或媲美前沿循环模型,且所需上下文帧更少。
- 适合部署于资源受限的实时视频分析场景,如会议系统、智能设备。
本文研究实时主动说话人检测(ASD)任务,即在一系列视频帧中判断某人是否正在讲话。尽管现有工作在模型架构和表征学习上取得进展,但实时部署仍面临高延迟和高内存使用的问题。为此,本文提出两种应对实时约束的方案:首先,限制模型使用的未来上下文帧数量,避免等待完整序列即可做出判断,显著降低延迟;其次,对推理时可访问的过去帧数施加更严格的限制,解决流式ASD系统的持续内存占用问题。实验表明,受约束的Transformer模型在仅用少量上下文帧的情况下,性能可媲美甚至超越最先进的单向GRU模型。此外,分析揭示:更大的过去上下文对准确率的影响远大于未来上下文。在CPU上的性能分析显示,系统主要受过去帧数量的内存瓶颈制约,计算开销可忽略不计。
原文摘要 · Abstract (English)
This paper delves into the challenging task of Active Speaker Detection (ASD), where the system needs to determine in real-time whether a person is speaking or not in a series of video frames. While previous works have made significant strides in improving network architectures and learning effective representations for ASD, a critical gap exists in the exploration of real-time system deployment. Existing models often suffer from high latency and memory usage, rendering them impractical for immediate applications. To bridge this gap, we present two scenarios that address the key challenges posed by real-time constraints. First, we introduce a method to limit the number of future context frames utilized by the ASD model. By doing so, we alleviate the need for processing the entire sequence of future frames before a decision is made, significantly reducing latency. Second, we propose a more stringent constraint that limits the total number of past frames the model can access during inference. This tackles the persistent memory issues associated with running streaming ASD systems. Beyond these theoretical frameworks, we conduct extensive experiments to validate our approach. Our results demonstrate that constrained transformer models can achieve performance comparable to or even better than state-of-the-art recurrent models, such as uni-directional GRUs, with a significantly reduced number of context frames. Moreover, we shed light on the temporal memory requirements of ASD systems, revealing that larger past context has a more profound impact on accuracy than future context. When profiling on a CPU we find that our efficient architecture is memory bound by the amount of past context it can use and that the compute cost is negligible as compared to the memory cost.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。