Jun 2026· arXiv.org· Vol abs/2606.30288· 0 citations· 46 references
Computer Science
TL;DR
This work proposes **VisReflect**, a simple yet effective framework that improves fine-grained perception in long visual contexts through latent visual reflection, which generates continuous visual reflection that represents question-relevant visual features in the latent space.
Abstract
Large Vision Language Models (LVLMs) have achieved remarkable success on vision-language tasks, yet fine-grained perception over high-resolution images and long-context videos remains challenging. As the number of visual tokens increases, the visual attention sink phenomenon becomes increasingly severe, causing irrelevant tokens to absorb a disproportionate amount of attention mass. Recent approaches attempt to mitigate this issue by explicitly predicting bounding boxes or temporal spans and re-encoding the cropped visual regions. Such methods depend on unreliable numeric localization in the discrete token space and incur significant computational overhead due to additional forward passes. In this work, we propose **VisReflect**, a simple yet effective framework that improves fine-grained perception in long visual contexts through latent visual reflection. Instead of decoding intermediate predictions into discrete tokens, the model generates continuous visual reflection that represents question-relevant visual features in the latent space. These reflections selectively emphasize salient regions or frames, guiding attention towards relevant visual tokens within a single forward pass. We conduct comprehensive evaluations on challenging high-resolution image benchmarks, including BLINK, V*, and HRBench-4K/8K, as well as video understanding benchmarks such as MVBench, VideoMME, and MLVU. Our method consistently improves over strong baselines, achieving gains of 4.1% on image benchmarks and 1.8% on video benchmarks. Compared with zooming-based methods, our model achieves comparable performance while reducing inference time by roughly 44% on video understanding.
This work presents a streamlined Attentive Fusion Network that employs text embeddings as queries to actively harvest pertinent cues from OpenCLIP-encoded visual data, and implements a zero-initialized, learnable Context Gating module that autonomously regulates the blending of both modalities.
Wuqinghua Fan· International Conference on...· 0 citations
This work introduces \method, a Multi-scale Adaptive Vision Encoder, a Multi-scale Adaptive Vision Encoder that uses position-dependent gates to fuse shallow, intermediate, and deep features from a vision Transformer, preserving global semantics while enhancing edges, text, and local structure.
Mechanistic analyses show that HAFI restores task-dependent spectral allocation while retaining semantic attention, establishing frequency enrichment as a distinct and effective route for improving VLM perception.
Jin Cui, Chuanchang Su, Jia-Yi Lu et al.· 0 citations
This work proposes to model objects as a stronger semantic unit for visual prediction, encouraging the encoder to learn the global context and semantics among visual elements, and shows that an object-centric objective reduces pixel-averaging shortcuts and yields more globally coherent and context-consistent representa...
This paper revisit VLM inference and presents a new efficient guidance scheme that complements similarity-based guidance, and proposes Cross Modal Residual (CMR), a training-free visual token compression method that combines CMR, text-attention relevance, and residual-space diversity to retain task-relevant and complem...
Congyang Ou, Rui-Ke Song, Yang Zhou et al.· 1 citation
This work proposes masked boundary modeling, a self-supervised paradigm that dynamically learns sub-pixel boundary representations and subsequently leverages the discovered boundary-bearing tokens as masked targets to facilitate dense visual token learning.
Zelin Fu, Bin Tan, Chang Sun et al.· 3 citations· ⚡2
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.