无需训练的视频帧选择方法,提升大模型理解效率
MDP3: A Training-free Approach for List-wise Frame Selection in Video-LLMs
- 基于条件高斯核与确定性点过程,兼顾查询相关性与帧间多样性
- 分段建模序列依赖,通过马尔可夫决策分配各段选帧数量
- 不需训练即可适配现有视频大模型,适用于长视频理解任务
视频大语言模型在视频理解方面取得显著进展,但处理多帧导致视觉标记序列过长,面临上下文长度不足和无关帧干扰等问题。有效的帧选择至关重要。本文强调帧选择应遵循三个核心原则:查询相关性、列表级多样性与时序连续性。现有方法如均匀采样和查询-帧匹配无法同时满足这些原则。为此,我们提出无训练、模型无关的马尔可夫决策确定性点过程(MDP3),可无缝集成至现有视频大模型中。首先,在再生核希尔伯特空间(RKHS)中利用条件高斯核估计帧与查询的相似性;然后对相似性矩阵应用确定性点过程(DPP),以捕捉查询相关性与列表级多样性;为引入时序性,将视频分段,并在每段内以先前段的选择为条件应用DPP,建模为马尔可夫决策过程(MDP)以分配各段选帧数。理论上,MDP3以伪多项式时间复杂度提供(1 - 1/e)近似解,解决NP难的列表级帧选择问题,证明其高效性。实验表明,MDP3显著优于现有方法,验证其有效性与鲁棒性。
原文摘要 · Abstract (English)
Video large language models (Video-LLMs) have made significant progress in understanding videos. However, processing multiple frames leads to lengthy visual token sequences, presenting challenges such as the limited context length cannot accommodate the entire video, and the inclusion of irrelevant frames hinders visual perception. Hence, effective frame selection is crucial. This paper emphasizes that frame selection should follow three key principles: query relevance, list-wise diversity, and sequentiality. Existing methods, such as uniform frame sampling and query-frame matching, do not capture all of these principles. Thus, we propose Markov decision determinantal point process with dynamic programming (MDP3) for frame selection, a training-free and model-agnostic method that can be seamlessly integrated into existing Video-LLMs. Our method first estimates frame similarities conditioned on the query using a conditional Gaussian kernel within the reproducing kernel Hilbert space~(RKHS). We then apply the determinantal point process~(DPP) to the similarity matrix to capture both query relevance and list-wise diversity. To incorporate sequentiality, we segment the video and apply DPP within each segment, conditioned on the preceding segment selection, modeled as a Markov decision process~(MDP) for allocating selection sizes across segments. Theoretically, MDP3 provides a \((1 - 1/e)\)-approximate solution to the NP-hard list-wise frame selection problem with pseudo-polynomial time complexity, demonstrating its efficiency. Empirically, MDP3 significantly outperforms existing methods, verifying its effectiveness and robustness.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。