Your paper timeline
Scroll AI takes the way you would scroll a great paper aggregator: quick signal first, deeper critique when something earns your attention, and challenges when a claim feels off.
398 papers in cs.CV
Trending mixes fresh papers with community signal.
0
cs.CV Yuanze Hu, Zhichao Yang, Junwei Jing et al. · Oct 22, 2026

Detailed image captioning is usually treated as a global coverage task, but captions are generated as ordered sequences where later tokens can degrade in different ways. This paper introduces a position-aware rubric that decomposes captions into quartile-wise supported, hallucinated, and generic content, exposing two distinct failure modes: mid-caption unsupported specificity and tail generic escape. Motivated by this diagnosis, the authors propose PAGER, a GRPO reward with separate signals for middle evidence, tail density, and length control, achieving strong pairwise wins while preserving competitive global quality metrics.

Detailed image captioning is usually framed as an amount problem: a model should mention more visual facts while avoiding hallucination. However, autoregressive VLMs generate captions as ordered sequences, and later generations may be produced under weaker or noisier visual grounding. We therefore argue that long-form captioning should be studied not only by what facts are mentioned, but also by where they appear. We introduce a position-aware rubric representation that decomposes dense human references into atomic visual claims, verifies generated captions against those claims, and induces a quartile-wise composition of supported, hallucinated, and generic content. This lens reveals two qualitatively different failures in long captions: models tend to produce unsupported specificity in the middle, while the final portion often escapes into vague, non-evidential language rather than simply accumulating more hallucination. A same-reference human control does not exhibit these patterns; additional human audits examine the visual validity of the induced labels. Motivated by this diagnosis, we propose PAGER (Position-Aware Grounded Evidence Reinforcement), a GRPO training objective with separate signals for supported fine-grained middle evidence, evidence-bearing tail continuation, claim coverage, and content-aware length control. The result is a closed loop: the same ordered claim representation identifies where long captions fail and supplies the position-specific reward needed to repair those failures. Experiments on detailed-caption benchmarks show that PAGER improves position-wise grounding and pairwise caption preference while preserving competitive global caption quality.
0
cs.CV Zecong Tang, Zian Guan, Yuncheng Guo et al. · Oct 22, 2026

HiSTEVE tackles the challenge of building Minecraft agents that can perform long-horizon tasks using only native keyboard-and-mouse control, without relying on environment APIs or predefined skills. It proposes a hierarchical VLA agent that pairs a capability-aware harness—equipped with structured memory, a VLM planner, and a policy-coupled completion detector—with a single low-level VLA policy for visuomotor execution. The core idea is to close the loop between high-level planning and raw pixel-to-action control in a partially observable open world, which matters for developing generally capable game-playing agents.

Building virtual embodied agents that operate in open-ended games like human players is a long-standing goal requiring both long-horizon autonomy and reliable native-interface control. As a procedurally generated open world, Minecraft provides a natural testbed for studying the integration of these capabilities. Existing agents typically provide either native visuomotor control without long-horizon autonomy or high-level planning executed through environment APIs or predefined skills. To bridge this gap, we propose HiSTEVE, a hierarchical VLA agent with a capability-aware agent harness. At the orchestration level, we equip the harness with structured memory for tracking progress and a VLM planner for selecting subtasks within the VLA's capabilities. To reliably determine subtask completion, we further introduce a policy-coupled task completion state detector that conditions on VLA policy context to signal candidate completion. At the control level, a single VLA executes all subtasks with vision-only perception and native keyboard-and-mouse actions. To mitigate interference between heterogeneous GUI and non-GUI interactions, we introduce regime-specific RMSNorm branches and separate mouse-movement token embeddings. We also train the VLA through world knowledge injection, imitation learning, and reinforcement learning with environment feedback to improve reliability and recovery. HiSTEVE achieves state-of-the-art atomic-task performance, scoring 85.0% on MineStudio Bench and a 37.4% average success rate on OpenHA, while also completing long-horizon tasks such as crafting an iron pickaxe from scratch like human players.
0
cs.CVcs.GR Jinyuan Mao, Zhihao Shen, Chenxi Liu · Oct 22, 2026

Fine-tuning diffusion models has yielded over 100K community adapters, but merging them interactively creates a high-dimensional, expensive black-box optimization problem: prior work requires live image generation in every round and is limited to a few dozen preselected adapters. HimmBO splits the search into a screening stage that recovers promising adapters via level-set estimation over a precomputed gallery, followed by a refinement stage that optimizes merge coefficients only within that low-dimensional active set. A style-aware Gaussian-process kernel transfers preference information between visually similar adapters, allowing the system to scale to libraries of over one thousand adapters while using under one tenth the image generations of prior work.

Fine-tuning has become a common way to customize text-to-image models, leading to community collections of over 100K lightweight adapters. Adapters sharing a base model can be merged with continuous coefficients. This turns a large collection into a high-dimensional continuous design space, which recent work explores interactively using preferential Bayesian optimization (PBO). However, existing approaches are limited to a few dozen preselected adapters and require expensive image generation in every interaction round. We introduce HimmBO, a two-stage method that scales preference-driven adapter merging to much larger collections while reducing image-generation cost. Its screening stage recovers the active adapter set through level-set estimation over pre-generated images, requiring no image generation. The refinement stage then optimizes merge coefficients in the recovered low-dimensional subspace. Both stages use a style-aware kernel, allowing preference information to transfer between visually similar adapters. In simulated-user image-matching experiments, HimmBO achieves higher final similarity than all comparisons while reaching a given similarity with under one tenth of the image generations required by prior work. Its performance remains stable as the collection grows to 1080 adapters, while competing methods degrade substantially.
0
cs.CV Xiaoting Xie, Feng Qiao, Xianwei Zhang et al. · Oct 22, 2026

Multimodal sentiment analysis fuses linguistic, acoustic, and visual signals, yet standard fusion methods entangle modality-specific and cross-modal contributions in opaque joint representations. This paper proposes I2-KAN, a multi-pathway framework that explicitly maintains intra-modal and pairwise inter-modal information in separate pathways, refines each with a Task-Decoupled Linear-Gated Denoising Bottleneck, and fuses them via a structured Kolmogorov–Arnold Network. The core motivation is that a modality's standalone predictive utility can differ sharply from its interaction-conditioned utility, and the work aims to make this reasoning traceable at pathway, feature, and functional-edge levels.

Multimodal sentiment analysis (MSA) aims to infer sentiment by integrating linguistic, acoustic, and visual information. However, many fusion methods integrate modality-specific representations and cross-modal interactions into joint representations, making it difficult to determine whether predictive utility arises from a modality itself or from its interactions with others. More fundamentally, a modality's standalone predictive utility may not faithfully reflect its interaction-conditioned predictive utility. To address this issue, we propose I$^2$-KAN, an interpretable multi-pathway framework that explicitly maintains intra-modal and pairwise inter-modal information in separate structural pathways. Each pathway is refined by a Task-Decoupled Linear-Gated Denoising Bottleneck (TDL-GDB) to learn compact and task-relevant representations, followed by structured Kolmogorov-Arnold Network fusion that retains explicit pathway associations and supports multi-level interpretation. Extensive experiments on CMU-MOSI, CMU-MOSEI, and CH-SIMS v2 demonstrate strong overall performance. Ablation and interpretability analyses consistently show across the three benchmarks that low standalone predictive utility does not necessarily imply low interaction-conditioned predictive utility: a modality that appears weak in isolation can remain informative through pairwise interactions. These findings highlight the interaction-dependent nature of multimodal utility and suggest that modality utility should be characterized from both standalone and interaction-conditioned perspectives.
0
cs.CV Ryugo Morita, Shunsuke Kitada, Stanislav Frolov et al. · Oct 22, 2026

Cast shadows are a clean, observable signature of a hidden physical variable: the direction of light. The authors introduce ShadowBench, a benchmark built from real photographs that asks VLMs to read, infer, and validate cast-shadow direction under carefully matched composites. They find a sharp dissociation—VLMs read visible shadows well yet infer and validate them at chance—and show that routing a VLM through an image generation model supplies the missing prior, motivating reconstruction-based objectives for illumination-aware VLMs.

Shadows are observable consequences of latent physical causes, arising from the interaction between illumination, object geometry, and scene structure. A model that understands shadows should be able not only to read a shadow's direction, but also to infer where a shadow should fall when it is absent, and to judge whether a shadow is physically consistent with the scene. We introduce ShadowBench, built from real photographs, which poses these three questions to vision-language models (VLMs). From each scene, we build a correct-shadow, a shadow-removed, and a human-annotated wrong-direction state. Evaluating 19 open VLMs (2B to 78B) and frontier proprietary models, we find that VLMs read a visible shadow's direction well above chance and improve with scale, yet infer the absent direction only weakly and fall to chance at judging physical consistency even under a bias-free two-alternative test that removes the yes-bias of single-image naturalness questions. Only Gemini-3.1-pro exceeds chance on validity, and even then only modestly and far below humans. Chain-of-Thought (CoT) does not help. The missing ingredient is not reasoning but knowledge that image generation models (IGMs) already hold. Routing a VLM through an IGM lifts its inference well above its direct attempt and helps it flag the wrong-direction shadows it otherwise accepts. Cast-shadow direction is a single facet of illumination understanding, but the sharp gap it reveals between VLMs and IGMs suggests image-generation or reconstruction objectives as a route toward illumination-aware VLMs.
0
cs.CVcs.CR Mingjie Li, Yukun Jiang, Yicong Tan et al. · Oct 22, 2026

This paper studies how non-expert malicious actors can use web-sourced knowledge and LLMs to evade AI-generated image detectors with simple CPU-based image processing. The authors introduce WildFakeToolBench, a benchmark of 156 validated executable tools derived from 220 public sources across 142 domains, synthesized without detector feedback. On 105 images from five generators, they evaluate six state-of-the-art detectors and demonstrate substantial, detector-specific vulnerabilities, with single-tool attack success rates reaching 25%–100% and worst-case multi-tool coverage exceeding 80% for every detector. The work matters because it quantifies a realistic, low-resource threat model grounded in public forums and tutorials, rather than in white-box optimization.

As AI generated images are getting popular these days, discussions on such generations are widely existed in current public forums, software repositories, and photography tutorials. Moreover, with the help of LLM-assisted code translation, malicious actors can adopt such information to evade detectors without specialized knowledge or local GPU execution of the resulting tools. To evaluate such risks, we introduce \textsc{WildFakeToolBench}, a benchmark suite of $156$ executable image-processing tools derived from $220$ public sources across $142$ domains. Each tool retains its source evidence and passes syntax, execution, and output-distortion checks without using feedback from the evaluated detectors. On $105$ generated images from five generators, we evaluate six state-of-the-art detectors with images processed by the tools in our collected bench to assess their effectiveness against such in-the-wild risks. The strongest individual tools achieve attack success rates of $25.25\%$--$100\%$ across detectors, exceeding the strongest of six selected image-processing baselines for each detector. Evaluating subsets of an eight-tool pool yields worst-case coverage above $80\%$ for every detector. Effectiveness is sparse and detector-specific: high coverage across candidates does not imply reliable one-shot evasion. These findings not only highlight the potential of such web-sourced risks, but also show the potential on establishing AI-image detector robustness evaluation framework based on those in-the-wild information.
0
cs.CV Shiyang Zhang, Miao Yang, Zhengda Li et al. · Oct 22, 2026

Lightweight Vision-Language-Action models such as SmolVLA rely on a single dense action expert for all manipulation tasks, which limits multi-task capacity under tight compute budgets. SmolVLA-MoE replaces the dense FFN layers in the action expert with sparse Mixture-of-Experts blocks—parallel expert FFNs, a token-level router, and a tunable shared expert—so each token adaptively selects a specialized expert without increasing inference cost. By keeping total activated parameters at ~500M (matching the dense baseline) while storing ~800M total parameters, the method raises average success on the LIBERO benchmark from 82.75% to 84.25% and outperforms the much larger OpenVLA-7B, offering a practical efficiency win for resource-constrained robot platforms.

Vision-Language-Action (VLA) models have shown promising results in multi-task robotic manipulation by leveraging visual and language understanding for action generation. However, existing lightweight VLA models employ a single dense action expert to handle all tasks, which limits their multi-task capability under constrained computational budgets. To address this issue, we propose SmolVLA-MoE, a novel framework that introduces sparse Mixture-of-Experts (MoE) into the FFN layers of the action expert in VLA models. SmolVLA-MoE replaces dense FFN layers with multiple parallel expert FFNs and a token-level router, enabling each token to adaptively select the most suitable expert for action generation. We further introduce a shared expert with a tunable weight parameter to balance the inheritance of pre-trained capabilities and task-specific expert specialization. Through sparse activation, SmolVLA-MoE activates only a single expert FFN during inference, with a total activated parameter count of approximately 500M including the frozen VLM backbone, while benefiting from approximately 800M total stored parameters. We evaluate our method on four task suites of the LIBERO benchmark. SmolVLA-MoE achieves an average success rate of 84.25%, outperforming SmolVLA (82.75%) and OpenVLA-7B (76.5%), while maintaining comparable inference efficiency. Our code is publicly available at https://github.com/dudu435/smolvla-moe.
0
cs.CV Ding Ding, Daowen Li, Ying Chen et al. · Oct 22, 2026

ResGVC attacks the two core weaknesses of current generative video compression (GVC): decoder-side diffusion without explicit source guidance risks drifting away from the original video, and latent-space denoising suffers irreversible detail loss through the autoencoder bottleneck. The paper proposes to decompose the distortion between a learned codec reconstruction and the original pictures into a sequence of pixel-space residual segments, one per flow-matching denoising step, and to compress those residuals with a diffusion-transformer entropy model. By transmitting only the most fidelity-critical segments and generating the rest, ResGVC claims to advance both perceptual realism and signal fidelity, reporting >60% LPIPS and >80% PSNR BD-rate reductions over prior art.

Generative video compression (GVC) methods usually employ decoder-side diffusion models to denoise reconstructed signals based on generative priors. Besides, most of these methods perform denoising in latent space rather than directly in pixel domain. In this paper, we propose ResGVC, a residual coding framework for GVC that guides denoising toward original pictures by transmitting residual signals. ResGVC first encodes the original pictures within a learned video codec, and then decomposes the distortion between the codec reconstruction and the original pictures into a sequence of residual segments, where each residual segment is acquired at each denoising step. Residual segments can further be compressed by a novel residual codec with a diffusion transformer as an entropy model. Unlike prior methods, ResGVC introduces explicit source constraints throughout denoising rather than relying on decoder-side generation alone. The diffusion-based entropy model also enables more effective distribution modeling capability based on the powerful generative priors. Moreover, denoising directly in pixel space avoids the irreversible information loss caused by latent representation bottlenecks. Experimental results show that, compared with the previous state-of-the-art method, ResGVC achieves 63.7% and 83.8% BD-rate reductions in terms of LPIPS and PSNR, respectively, while also delivering superior visual quality.
0
cs.CV Novanto Yudistira, Muhammad Dzaka Aufa Fadhillah, Irawati Nurmala Sari · Oct 22, 2026

This paper tackles batik image captioning when expert text annotations are scarce by injecting predicted class labels from a LoRA-adapted DINOv2 classifier into a 4-bit NF4 Qwen2.5-VL captioner. The core idea is that compact class supervision can guide vision-language generation in cultural-heritage settings where only sparse metadata exists. The authors evaluate whether the cascade retains correct cultural identities or propagates upstream classification errors across six captioning conditions. Their findings matter for digitizing heritage collections, though they are hedged by overlapping partitions and tiny local test sets.

Class labels offer compact supervision for describing cultural-heritage images when expert text annotations are scarce. We investigate a batik-captioning cascade that integrates a LoRA-adapted DINOv2 classifier with Qwen2.5-VL-7B, adapted using LoRA and loaded in 4-bit NF4. A $3\times2$ evaluation combines three captioner conditions with two inference prompts to examine adaptation and predicted-class injection. Across 150 caption-evaluation images, all three injected conditions achieve a ground-truth class-label mention rate of 0.9067. The classifier's separate test yields 96.10% pooled accuracy, with 98.33% on 300 public-source images and 75.76% on 33 local images. Supported-class macro-F1 and balanced accuracy on the local subset are 0.8493 and 0.8302, respectively. The classifier and captioner use separate partitions, and their training--evaluation overlap remains unquantified. Differences in label semantics and training support also affect interpretation of the source-specific accuracy gap. Reference-based caption metrics and image--text compatibility scores produce different model rankings. Qualitative examples show both retention of correctly predicted identities and propagation of classification errors into fluent descriptions. These findings characterize how class conditioning preserves label information and transfers upstream errors into batik captions under scarce text annotation.
0
cs.CV Shengqiong Wu, Meng Luo, Bobo Li et al. · Oct 22, 2026

Video foundation models now handle both understanding and generation of dynamic visual content, but the field lacks a principled way to relate these tasks to an underlying physical world. This survey proposes a world-modeling lens that partitions the literature into four operations—reading, writing, sharing, and interacting—each connecting observed video traces to a latent temporal world. By distinguishing mere temporal coherence in generated sequences from true consistency of the underlying world state, the work reframes evaluation criteria and identifies open challenges in building unified video world models.

Video foundation models have advanced rapidly in understanding and generating visual sequences, while video world models seek to capture the underlying dynamics of the world they depict. Despite their different objectives, both concern the relationship between video observations and an evolving world. This survey adopts world modeling as a unifying lens for examining these developments. Viewing an observed video as a partial, lossy, and temporally ordered projection of a latent temporal world, we organize the literature around four complementary operations: reading infers world properties from observed video; writing synthesizes video from specified or learned world conditions; sharing integrates understanding and generation through common modeling mechanisms; and interacting predicts and updates world states under actions and evolving observations. This perspective distinguishes temporal coherence in observed or generated sequences from consistency in the underlying world state. Across tasks, representations, models, datasets, and benchmarks, we trace a shift in emphasis from clip-level recognition and perceptual fidelity toward persistent state, controllable evolution, physical and causal validity, and evaluation grounded in interaction and downstream decisions, and we distill the open challenges that follow.
0
cs.ROcs.CV Mingyu Sheng, Jianan Fan, Dongnan Liu et al. · Oct 22, 2026

The paper addresses vision-based policy learning for laparoscopic robotic manipulation, where end-to-end RL suffers from sparse visual signals and stringent precision requirements, while imitation learning demands scarce expert demonstrations. The authors propose distilling a privileged state-based teacher into an RGB-based student by matching their Gaussian action distributions, with particular emphasis on theoretically analyzing first- and second-order properties of matching objectives including forward KL, reverse KL, Jeffreys divergence, and Wasserstein distance. Extensive experiments in the SurRoL simulator indicate that uncertainty-aware distribution matching—especially Jeffreys divergence—achieves markedly more stable and higher success rates on complex surgical tasks than general RL or imitation learning baselines.

End-to-end control policies trained via Reinforcement Learning (RL) have emerged as an alternative to conventional surgical robotic control approaches, with recent studies exploring state-based policies trained on privileged state observations. However, such approaches rely on precise physical states that are difficult to obtain reliably in surgical environments. Vision-based RL provides an alternative by learning manipulation policies directly from RGB observations, avoiding explicit state estimation and manually engineered perception pipelines while enabling policies to acquire task-relevant visual representations. Nevertheless, obtaining vision-based policies via pure RL methods for surgical manipulation remains challenging. Thus, imitation learning (IL) becomes another solution, yet it requires a large number of expert demonstrations, which are difficult to obtain in minimally invasive surgery. In this work, we propose a framework for state-to-vision policy distillation in laparoscopic robotic manipulation. Specifically, a state-based policy with privileged observations is employed as the teacher, and a vision-based policy learns from RGB observations and robot proprioceptive information, which requires less expert demonstrations than IL and introduces superior performance than RL methods. We conduct extensive experiments on various surgical manipulation tasks in the simulated environment. Experimental results show that, in the context of laparoscopic robotic manipulation, training vision-based policies with general-purpose RL methods is challenging, whereas our proposed state-to-vision policy distillation leads to more consistent and stable performance across tasks.
0
cs.CV Zunnan Xu, Shangchen Zhou, Yihang Luo et al. · Oct 22, 2026

Feed-forward 3D models such as VGGT-Omega deliver excellent local geometry but are limited to short windows, so long videos must be processed as overlapping chunks. HiP3R addresses the resulting frame-level inconsistencies and scale drift with a hierarchical pose graph: a coarse chunk-level $\mathrm{Sim}(3)$ graph first recovers global layout and scale, and then a fixed-layout frame-level $\mathrm{SE}(3)$ graph estimates one shared camera per frame to reconcile conflicting cross-window predictions. It is purely post-processing, requires no retraining or fine-tuning, and applies to both chunk-based and streaming backends.

Feed-forward models accurately estimate camera motion and 3D geometry from short video windows. However, computational and memory costs prevent direct inference on sequences containing thousands of frames. Long videos must therefore be processed as overlapping chunks. This division produces independent local reconstructions with inconsistent coordinate frames and duplicate estimates of shared cameras. Achieving global consistency requires propagating constraints from adjacent overlaps and distant revisits across the sequence. This requirement naturally motivates pose graph optimization. However, the choice of graph level creates a trade-off. Chunk-level graphs efficiently resolve scale drift and close large loops. Yet, their rigid transformations cannot correct internal errors or conflicting frame predictions. Conversely, frame-level optimization offers local flexibility, but scaling it globally is computationally expensive and can break metric scale. HiP3R resolves this trade-off using a hierarchical pose graph. HiP3R first optimizes a robust chunk-level $\mathrm{Sim}(3)$ graph to establish the global layout and scale. It then holds this layout fixed and estimates one shared $\mathrm{SE}(3)$ camera per frame, turning overlapping window predictions into a single trajectory. Experiments across multiple benchmarks demonstrate the effectiveness of HiP3R in improving camera trajectories and 3D reconstruction. Our method applies to both chunk-based and streaming backends without additional training or fine-tuning. The codes are available at https://kkakkkka.github.io/HiP3R.
0
cs.CV Jinyu Zhang, Haitao Lin, Jiashu Hou et al. · Oct 22, 2026

Category-level 6D pose estimation recovers object rotation and translation without instance CAD models, but prevailing methods force an unappealing trade-off between brittle intermediate alignments and costly iterative diffusion sampling. F2G-Pose addresses this by proposing a direct feed-forward architecture that lifts frozen foundation-model features onto partial point clouds, fuses local geometry via DGCNN and a Mixture-of-Experts Transformer, and jointly regresses pose, metric size, and camera-frame completed shape in one pass. Its practical significance is pushing deterministic regression to state-of-the-art synthetic-benchmark accuracy while running at 28 FPS and showing real-world robotic deployment potential, though its gains rely heavily on a strong frozen backbone and it offers no explicit uncertainty model.

This paper studies category-level RGB-D object pose estimation, which recovers an object's 3D rotation and translation without instance-specific CAD models or reference views. This task is highly ambiguous due to intra-class variations, symmetries, and partial observations. Current solutions struggle to balance reliability and efficiency: methods based on intermediate structures are prone to error propagation, while diffusion models suffer from high inference latency and complex post-hoc candidate extraction. To address this, we present F2G-Pose, a real-time direct, single-pass framework that predicts category-level pose, metric size, and camera-frame completed shape from a single RGB-D observation in one feed-forward pass. F2G-Pose lifts dense visual foundation features to partial point clouds, encodes local geometry with DGCNN tokenization, and integrates object-level structure with a Mixture-of-Experts Transformer. Joint size prediction and camera-frame shape completion encourage metric consistency through dense geometric supervision. With its task-specific network trained only on pose-annotated synthetic SOPE data and its frozen RADIO backbone externally pretrained, F2G-Pose achieves state-of-the-art accuracy on SOPE and ROPE while running at 28 FPS for pose-only inference, and further demonstrates strong camera-frame geometry on HouseCat6D and real-object transfer on HANDAL. Analyses of latency, robustness, shape completion, and GenPose++ candidate behavior further demonstrate the efficiency and reliability of F2G-Pose, with real-world manipulation experiments demonstrating deployment potential under segmented RGB-D inputs. The project page, code, and pretrained models are made available at https://jrryzh.github.io/F2G-Pose/.
0
cs.CV Zhuoran Zhang, Yang Shi, Qixun Wang et al. · Oct 22, 2026

As AI-generated videos approach photorealism, detectors must do more than classify real versus fake; they need to surface the specific visual artifacts that ground the decision. Verus-Insight decomposes artifact detection into three explicit capabilities—deciding what to inspect, verifying whether those inspections reveal genuine generation artifacts, and aggregating the verified evidence into a final verdict—and trains an MLLM with human-anchored, full-process supervision to strengthen each stage. The result is a detection system that improves not only video-level accuracy but also the fidelity of fine-grained artifact recovery, supported by a new benchmark with dense human annotations of spatiotemporal artifacts.

Recent advances in video generation have made synthetic videos increasingly realistic, placing greater demands on reliable AI-generated video detection. Existing artifact-based detectors typically identify generation artifacts as evidence for source prediction, yet they may either fail to recognize subtle artifacts or reach the correct source decision without faithfully identifying the evidence underlying it. In this work, we systematically investigate how to design and train effective artifact detectors and formulate artifact detection as a structured process comprising three complementary capabilities: Inspection Planning, which determines what should be examined; Evidence Verification, which verifies whether the inspected content exhibits genuine generation artifacts; and Evidence Aggregation, which integrates the verified evidence into the final source decision. Building on this formulation, we introduce Verus-Insight, trained with human-anchored full-process supervision and progressive capability training to strengthen both fine-grained artifact detection and video-level detection. We further introduce Verus-Bench, a benchmark with fine-grained human annotations of perceptible artifacts for evaluating artifact detection. Extensive experiments across diverse benchmarks demonstrate that Verus-Insight achieves strong performance in both fine-grained artifact analysis and AI-generated video detection, with substantial gains in recovering human-perceived artifacts. Further analyses reveal that the three capabilities are complementary yet distinct, and that Verus-Insight more reliably converts relevant inspection targets into supported artifact evidence without increasing spurious artifact claims.
0
cs.CV Yang-Hao Zhou, Lixing Tan, Zhiqi Li et al. · Oct 22, 2026

PhyEvolve addresses a core failure mode in text-to-video generation: user prompts underspecify physical mechanisms and state dependencies, leading to incoherent dynamics. The paper proposes a training-free, three-agent framework—Director, Physical Evolver, and Composer—that plans explicit causal state trajectories, including during occlusions, and rewrites the prompt before feeding it to a frozen video generator. The work matters because it lifts physical consistency into an explicit planning stage rather than hoping the diffusion model hallucinates correct physics from vague text.

Recent advances in text-to-video generation have substantially improved visual fidelity, yet existing models still struggle to understand the physical evolution implicit in user prompts, making it difficult to generate videos with continuous physical state evolution. Here, we propose PhyEvolve, a multi-agent framework that enhances natural-language prompts through structured state-evolution planning. PhyEvolve consists of three agents: a Director, a Physical Evolver, and a Composer. Given a user prompt and an optional first frame, the Director grounds the scene and disentangles physical events from observation changes. The Physical Evolver uses scene evidence to identify physical mechanisms then constructs causally linked state transitions that unfold throughout the video, whether visible or not. The Composer utilizes these transitions to enhance the original prompts. Without retraining or model modification, PhyEvolve works directly with existing generators through prompt replacement. Extensive experiments on four major benchmarks show that PhyEvolve achieves state-of-the-art performance, outperforming the cutting-edge prior agentic baseline by 7.9 percentage points on average. These results demonstrate that explicit causal state-evolution planning improves physical consistency and state continuity in generated videos through natural-language prompt enhancement.
0
cs.CVeess.SP Yasas Savinda, Maheshi Buddhinee Dissanayake · Oct 22, 2026

Historical document binarization struggles with faded ink, bleed-through, and stains that behave differently across visible and near-infrared wavelengths. This paper proposes a conditional GAN with adaptive cross-spectral feature fusion at encoder depth $L=3$, gated by edge maps derived from a targeted 600 nm visible + 1000 nm NIR pair. On 30 SMADI pages under strict five-fold document-level cross-validation, the method achieves statistically significant gains in $F_1$, pseudo-FM, and IoU over fixed averaging and generic attention, showing that physics-informed structural guidance can regulate multispectral restoration without discarding any spectral band.

Historical document binarization remains challenging when faded ink, bleed-through, and background degradation exhibit wavelength-dependent behavior across visible and near-infrared observations. This study investigates whether adaptive cross-spectral feature fusion and targeted structural guidance can improve multispectral document binarization beyond fixed fusion and generic attention mechanisms. Four registered SMADI bands at 500, 600, 700, and 1000 nm are processed using a multi-branch conditional generative adversarial network (cGAN). Visible, NIR, and structural feature streams are fused at encoder depth L = 3 using spatial- and channel-wise softmax gating, while auxiliary edge maps derived from selected VIS-NIR band pairs provide targeted structural guidance. Nine controlled fusion and structural configurations are evaluated using five-fold document-level cross-validation, DIBCO-standard metrics, and Holm-corrected statistical testing. The F3 + NIR edge-guided configuration provides the strongest overall performance among the evaluated models, achieving mean F1 = 0.7916, p-FM = 0.8044, and IoU = 0.6654. Relative to the fixed Mid AVG baseline, it improves F1 by 0.0269, p-FM by 0.0360, and IoU by 0.0321, with all three gains remaining statistically significant after Holm correction. Mean NRM and DRD are also reduced, although these reductions are not statistically significant after correction. Targeted cross-spectral structural guidance provides an effective mechanism for regulating intermediate multispectral fusion, improving primary foreground-overlap performance while retaining the complete four-band observation.
0
cs.CV Xiaolin Li, Zihao Huang, Fanpeng Meng et al. · Oct 22, 2026

Single-image 3D generators perform well on curated studio photos but fail on real-world images distorted by blur, uneven illumination, or occlusions. Gate3DGen proposes a selective pre-processing pipeline: a degradation-aware router that leaves clean images untouched and a one-step diffusion purifier that repairs corrupted inputs before they reach a frozen 3D generator. The core insight is that improving the observation, rather than retraining the generator, can close most of the fidelity gap while running in a fraction of the time required by generic image editors.

Single-image 3D generation has achieved high fidelity on curated benchmarks, yet degrades sharply on real-world images with uneven illumination, blur, and occlusions. Purifying such inputs requires deciding when to intervene and preserving the visual cues needed for 3D generation, while leaving clean inputs unchanged. We introduce Gate3DGen, a selective pre-processing model that gates image inputs to existing 3D generators without retraining them. A degradation-aware router bypasses inputs classified as clean and extracts features to guide purification of the remaining inputs. Conditioned on these features, a 3D-oriented one-step purifier purifies degraded inputs with spatial losses that encourage preservation of object identity, contours, and textural cues. To provide paired supervision, we construct a synthetic data engine that renders clean views of 3D assets and synthesises composite degradations. On the synthetic benchmark, the purifier improves image fidelity and downstream 3D geometry in only 2.3s on average, reducing TRELLIS.2 mesh distance by 61.5% relative to degraded inputs. VLM evaluation and human preferences on real photographs further support identity preservation and degradation correction. More demos and code are available at https://supra-3d.github.io/gate3dgen.
0
cs.HCcs.CVcs.RO David Ahmedt-Aristizabal, Mohammad Ali Armin, Akila Pemasiri et al. · Oct 22, 2026

As populations age, robotics and ambient AI are increasingly proposed to help older adults live independently in private homes and residential aged care (RAC) facilities. This chapter frames both settings as extreme human-robot interaction (HRI) environments—cluttered, dynamic, and technically under-supported—and surveys the sensors, perception algorithms, interaction designs, privacy safeguards, and evaluation frameworks needed to make such deployments viable. Its central thesis is that success requires moving beyond lab accuracy toward real-world operational metrics, privacy-by-design, and sustained acceptability.

This chapter explores how robotic systems and ambient intelligence can enhance care for older adults in residential aged care (RAC) homes and private homes. Although these settings differ, we frame both as extreme and challenging environments for human-robot interaction (HRI), characterised by cluttered and dynamic layouts, diverse resident needs, and limited on-site technical support. We review embodied and non-embodied systems that assist with daily living, safety monitoring, and social engagement, highlighting hybrid deployments where robots complement fixed and wearable sensors. To ensure these technologies are usable and effective, design considerations consider the cognitive, physical, and social needs of older adults. Interaction design prioritises accessibility for older adults with low digital literacy, using robust but simple voice interfaces, small sets of non-verbal cues, accessible screen-based companions, and safe object handovers. Privacy, trust, and acceptability are addressed via practical strategies such as on-device inference, data minimisation, visible consent controls, and transparent data handling aligned with emerging artificial intelligence (AI) and privacy regulation. Evaluation emphasises real-world metrics including false alarms per day, time to recover from faults, staff workload, and long-term system reliability. We close by outlining open research challenges and future directions for scalable, regulation-ready deployments that support aging with dignity, safety, and independence.
0
cs.CV Ilan Theodoro, Jord\~ao Bragantini, Lo\"ic A. Royer · Oct 22, 2026

Most cell-tracking links are trivial nearest-neighbor associations that bury rare but biologically critical errors in cell divisions and state changes. This paper introduces CellTrack-Bench, a hard-mined benchmark that isolates these difficult local associations from 15 datasets across four imaging modalities and evaluates whether vision-language models can act as cognitive correctors—by linking cells directly, repairing tracker graphs, or inspecting them for human review. It matters because it provides a controlled diagnostic setting to test whether frontier VLMs genuinely reason about biological dynamics or simply exploit spatial proximity.

Large language models have shown outstanding performance on text-first tasks such as coding, math, and writing. Recent efforts are shifting models' training to include scientific problems that often live in highly specialized domains beyond text, such as protein structure and biological images. However, in these scenarios, their general-purpose accuracy compared with specialized algorithms remains in question. One such domain is cell tracking, which requires spatiotemporal awareness of cell dynamics. To evaluate this, we created a new benchmark, CellTrack-Bench, which assesses Vision-Language Models' (VLMs) cell-tracking-related performance against specialized trackers. The full benchmark draws from 15 standard cell-tracking datasets across four imaging modalities and comprises 1,537 problems corresponding to 9,041 cell-linking decisions. We selected a hard subset requiring greater reasoning effort by identifying failures shared across distinct algorithmic trackers. With this proposed dataset, we: (i) evaluated different environment harnesses for VLMs; (ii) benchmarked 9 frontier closed-source models and 13 open-weight models; and (iii) provided a detailed analysis of their failure modes. Code, the stored model outputs, and a pipeline that regenerates the benchmark from the source datasets are available at https://github.com/royerlab/celltrack-bench.
0
cs.CVstat.ML Xihao Wang, Chengyao Yu, Ruixing Ming · Oct 22, 2026

Post-hoc calibration usually adjusts confidence scores globally, which ignores that neural networks can be miscalibrated differently in different regions of feature space. This paper proposes Local Adaptive Probability Estimation (LAPE), a residual framework that keeps an existing global calibrator as a stable anchor and adds a non-parametric local correction drawn from neighboring calibration samples in the learned feature representation. It also extends this idea to multi-view inputs through Cascade Feature Augmentation Fusion (CFAF). By exploiting local geometry without retraining, the work targets high-stakes settings where uniform global corrections leave spatially varying errors untouched.

Deep neural networks often struggle to provide reliable confidence estimates, making post-hoc calibration essential for reliable decision-making. Existing post-hoc methods largely rely on score-based transformations, which improve marginal calibration but often fail to capture spatially varying miscalibration in local regions of the learned feature space. To address this gap, we propose Local Adaptive Probability Estimation (LAPE), a post-hoc residual calibration framework. Specifically, LAPE treats the global calibrator output as a stable anchor and refines the individual prediction by leveraging non-parametric local evidence from neighboring calibration samples. As a plug-and-play refinement module, LAPE effectively utilizes the information about feature-space geometry and can reuse the calibration data that are used to construct the global calibrator. Furthermore, we extend LAPE to the setting with multi-view inputs through Cascade Feature Augmentation Fusion (CFAF). Extensive experiments demonstrate that the proposed methods can improve the calibration quality of various existing baselines and remain efficient and robust across different settings.