paper-with-me

Papers

Fast SAM2 with Text-Driven Token Pruning

2025-12-24 · Avilasha Mandal, Chaoning Zhang, Fachrina Dewi Puspitasari, Xudong Wang, Jiaquan Zhang, Caiyan Qin, Guoqing Wang, Yang Yang, Heng Tao Shen arxiv

Segment Anything Model 2 (SAM2), a vision foundation model has significantly advanced in prompt-driven video object segmentation, yet their practical deployment remains limited by the high computational and memory cost of processing dense visual tokens across time. The SAM2 pipelines typically propagate all visual tokens produced by the image encoder through downstream temporal reasoning modules, regardless of their relevance to the target object, resulting in reduced scalability due to quadratic memory attention overhead. In this work, we introduce a text-guided token pruning framework that improves inference efficiency by selectively reducing token density prior to temporal propagation, without modifying the underlying segmentation architecture. Operating after visual encoding and before memory based propagation, our method ranks tokens using a lightweight routing mechanism that integrates local visual context, semantic relevance derived from object-centric textual descriptions (either user-provided or automatically generated), and uncertainty cues that help preserve ambiguous or boundary critical regions. By retaining only the most informative tokens for downstream processing, the proposed approach reduces redundant computation while maintaining segmentation fidelity. Extensive experiments across multiple challenging video segmentation benchmarks demonstrate that post-encoder token pruning provides a practical and effective pathway to efficient, prompt-aware video segmentation, achieving up to 42.50 percent faster inference and 37.41 percent lower GPU memory usage compared to the unpruned baseline SAM2, while preserving competitive J and F performance. These results highlight the potential of early token selection to improve the scalability of transformer-based video segmentation systems for real-time and resource-constrained applications.

📄 PDF Abstract BibTeX arXiv:2512.21333

Code (0)

등록된 구현이 없습니다.

Tasks

Video Object SegmentationVideo Segmentation

Similar Papers 제목 키워드 기반

TopV: Compatible Token Pruning with Inference Time Optimization for Fast and Low-Memory Multimodal Vision Language Model

2025-03-24 · CVPR 2025 1 · Cheng Yang, Yang Sui, Jinqi Xiao, Lingyi Huang 외

Vision-Language Models (VLMs) demand substantial computational resources during inference, largely due to the extensive visual input tokens for representing visual information. Previous studies have noted that visual tok…

Language ModelingLanguage Modelling

FastVID: Dynamic Density Pruning for Fast Video Large Language Models

2025-03-14 · Leqi Shen, Guoqiang Gong, Tao He, Yifeng Zhang 외

Video Large Language Models have shown impressive capabilities in video comprehension, yet their practical deployment is hindered by substantial inference costs caused by redundant video tokens. Existing pruning techniqu…

Fast3D: Accelerating 3D Multi-modal Large Language Models for Efficient 3D Scene Understanding

2025-07-12 · Wencan Huang, Daizong Liu, Wei Hu arxiv

While 3D Multi-modal Large Language Models (MLLMs) demonstrate remarkable scene understanding capabilities, their practical deployment faces critical challenges due to computational inefficiency. The key bottleneck stems…

Scene Understanding

FastAV: Efficient Token Pruning for Audio-Visual Large Language Model Inference

2026-01-19 · Chaeyoung Jung, Youngjoon Jang, Seungwoo Lee, Joon Son Chung arxiv

In this work, we present FastAV, the first token pruning framework tailored for audio-visual large language models (AV-LLMs). While token pruning has been actively explored in standard large language models (LLMs) and vi…

Saliency-driven Dynamic Token Pruning for Large Language Models

2025-04-06 · Yao Tao, Yehui Tang, Yun Wang, Mingjian Zhu 외

Despite the recent success of large language models (LLMs), LLMs are particularly challenging in long-sequence inference scenarios due to the quadratic computational complexity of the attention mechanism. Inspired by the…