arXiv AI

HIMMEL: Hierarchical Interleaved Multi-stream Motion Encoding for Long Video Understanding

arXiv AI
Oct 2

VETO: Video Efficient Token Optimization for Vision Language Models

VETO (Video Efficient Token Optimization for Vision Language Models) is a plug‑in that reduces the quadratic cost of visual tokens in long‑video inference by applying dual‑axis compression: an intra‑frame compressor merges semantically similar tokens within each frame, and an inter‑frame compressor merges temporally redundant frames. By first compressing spatial dimensions, VETO lowers the cost of subsequent global temporal matching, surpassing single‑axis methods and achieving up to 45% faster inference on models such as LLaVA‑OneVision‑7B while maintaining or improving accuracy. The approach is universally applicable across LLaVA‑OneVision, InternVL‑2.5, and LongVA, preserving or enhancing zero‑shot accuracy even under extreme token budgets.

By Gueter Josmy Faure, Hao Ping Wang, Min-Hung Chen, Winston H. Hsu
arXiv Computer Vision
Aug 25

VideoChat3: Fully Open Video MLLM for Efficient and Generalist Video Understanding

arXiv:2607.14935v2 Announce Type: replace Abstract: Recent advances in video understanding have spanned motion, long video, and streaming interaction, driving this field toward real-world application...

By Xinhao Li, Yuhan Zhu, Xiangyu Zeng, Yuhao Dong, Haoning Wu, Zhiqiu Zhang, Yuandong Yang, Changlian Ma, Qingyu Zhang, Yansong Shi, Xinyu Chen, Haoran Chen, Zizheng Huang, Jun Zhang, Kun Ouyang, Lin Sui, Ziang Yan, Yicheng Xu, Chenting Wang, Yinan He, Hongjie Zhang, Yi Wang, Yu Qiao, Yali Wang, Ziwei Liu, Kai Chen, Limin Wang
arXiv Computer Vision
5d ago

Video Codec-Guided Training-Free Token Compression for Video Large Language Models

Video large language models (VLLMs) need long visual token sequences, making token compression essential for efficient inference. This paper introduces a training‑free token compression method that leverages existing video codec information—such as reference‑frame dependencies, motion vectors, and residuals—to guide low‑cost search for token protection and temporal merging. Experiments on three VLLMs and four benchmarks show that the method matches or surpasses the FlashVID baseline while dramatically reducing feature comparisons.

By Xihua Sheng, Ruijie Liu, Chang Wen Chen