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.CVcs.LGcs.RO Yunfei Xie, Howard H. Qian, Shiyi Lan et al. · Oct 22, 2026

Evaluating robotic foundation models still relies on expensive closed-loop rollouts in simulation or reality. This paper proposes Sensorimotor Alignment ($S^2$), a training-free offline metric inspired by the Platonic Representation Hypothesis, which scores how well a model's sensory embeddings align with the geometry of recorded end-effector trajectories. The authors find positive correlations between $S^2$ and task success across vision-language-action models, raw vision-language models, world action models, and real-robot policies, and argue the metric can cheaply rank models and diagnose representation-level behavior.

Robotic foundation models are typically evaluated through costly closed-loop rollouts, which motivates cheap offline proxies for model capability. The Platonic Representation Hypothesis (PRH) suggests that as representations improve, different modalities such as vision and language converge toward a shared statistical model of reality. We ask whether motion trajectories form another such modality: as embodied models become more capable, should their sensory representations converge toward the structure of physical motion? To examine this, we propose Sensorimotor Alignment ($S^2$), a training-free offline metric that measures how well a model's sensory representation aligns with the geometry of physical motion. We find that $S^2$ correlates positively with downstream robot task success across embodied model families, making it a low-cost offline proxy for prioritizing models before closed-loop evaluation. $S^2$ can also identify promising vision-language model (VLM) backbones even before costly fine-tuning into vision-language-action models (VLAs). Beyond this correlation, $S^2$ offers representation-level explanations for phenomena observed in VLAs and world action models (WAMs). With $S^2$, we extend PRH to embodied models and make sensorimotor alignment empirically measurable, offering insight into why an embodied model succeeds beyond its closed-loop success rate.
0
cs.CV Niklas Berndt, Xianghui Xie, Enes Duran et al. · Oct 22, 2026

PiHand tackles the synthesis of physically plausible dexterous hand-object interactions by learning a latent interaction prior from simulated mocap-tracking experts. Its three-stage pipeline—expert RL tracking, VAE distillation, and bounded residual latent exploration—enables zero-shot manipulation of unseen objects and trajectories, and even transfers to tasks like catching and bimanual handover that are rare or absent from the training data. The core thesis is that embedding interaction physics directly into the latent space outperforms both raw action-space RL and hand-only priors in sample efficiency and success rate.

Synthesizing physically grounded dexterous hand-object interactions is important for VR/AR, gaming, and robotics, yet remains challenging because subtle contact dynamics, diverse object geometries, and target trajectories must be jointly respected while maintaining natural grasps. Existing methods either track mocap trajectories with limited transfer to novel objects, or rely on hand-only generative priors that fail to capture coupled hand-object motion, sacrificing contact fidelity and sample efficiency. To tackle these challenges, we introduce PiHand, a Physically grounded Interaction-aware Hand motion synthesis framework. PiHand first trains expert policies that track mocap demonstrations in simulation, distills them into a unified hand-object interaction prior using a goal-conditioned VAE, and finally solve diverse dexterous manipulation tasks through bounded residual exploration in its latent space. With only a single reward and no complex curriculum training, this yields general tabletop manipulation policies that generalize to unseen objects and trajectories on GRAB and DexYCB. The same prior transfers to object catching and bimanual handover, two tasks that are rarely seen in its training data. Across all tasks, PiHand consistently outperforms baselines in all metrics. We will release the processed data and model checkpoints.
0
cs.CV Ruicong Liu, Liangyang Ouyang, Fengbo Lan et al. · Oct 22, 2026

AnyGameRenderer tackles the programmer-art problem of agent-built games by converting crude gameplay video into stylized, high-fidelity output via a rank-128 LoRA on the 33B MiniMax-H3 ref2va model. It accepts plain video inputs---gray blockouts, colored primitives, semantic maps, or wireframes---without engine G-buffers or per-object labels, and aims to preserve entity count, timing, and position across genres from tower defense to kart racing. The authors assemble roughly 10k paired clips from three sources and introduce an entity-level benchmark of 753 annotated entities to measure correspondence, improving temporal match over the zero-shot base.

AI coding agents can now build small playable games in minutes, but the results usually look like programmer art: gray blockouts, colored geometric primitives, and flat semantic blobs. We present AnyGameRenderer, a video-to-video generative renderer that turns such footage into high-quality visuals with characters, motion detail, and effects. Throughout, it keeps the layout, camera, and every entity's position and timing intact. Our AnyGameRenderer generalizes across a wide range of genres that agents build, such as tower defense, auto-battlers, top-down survivors, turn-based battles, kart racing, and crowd runners. AnyGameRenderer takes plain video as its game-state input, with no complex representations such as engine G-buffers, per-object class labels, or low-poly proxies. Gray blockouts, colored primitives, semantic maps, and wireframes all work as input. It also preserves entity correspondence: group counts stay correct, and entities appear and disappear on the right frame. We implement AnyGameRenderer by LoRA fine-tuning MiniMax-H3 ref2va, a 33B reference-video-conditioned video generation model. Training uses $\sim$10k paired clips from three sources: (i) multi-stream rendering data from 38 agent-made games exported from GEAR, an AI game-creation tool; (ii) two-stream rendering data from Unreal Engine, with programmatically controlled crowds, count changes, and entity scales; and (iii) real gameplay recordings, with pairs reconstructed via 3D-box detection. To evaluate the entity correspondence, we propose an entity-level benchmark of 59 held-out cases with 753 entities, scored against ground-truth boxes. Compared with the base model, AnyGameRenderer better preserves entity correspondence: temporal match rises from 50.9\% to 62.9\%, missed count changes fall from 34.7\% to 21.3\%, and fewer entities are hallucinated or left unrendered.
0
cs.CVcs.LG Sy-Tuyen Ho, Anirudh Satheesh, Soham Chawathe et al. · Oct 22, 2026

Dataset-use auditing for text-to-image models is difficult because fine-tuned models absorb collection-level visual style without reproducing individual training images. SpectralCanary addresses this by blending a fixed canary image into the low-frequency Fourier content of every collection image before release, preserving captions and avoiding auxiliary generation or per-image optimization. A lightweight verifier then detects the transferred spectral signature in a suspect model's black-box outputs. The method achieves strong detection rates across multiple architectures and domains with minimal fidelity loss, establishing low-frequency traces as a practical auditing mechanism.

Auditing whether a text-to-image (T2I) model was fine-tuned on a particular image collection is difficult: a model can absorb collection-level visual characteristics without reproducing training images. Proactive dataset-use auditing plants a shared signal in a dataset before release, then later checks whether that signal appears in a suspect model's generated outputs. Existing approaches often trade off verifiability, fidelity, robustness, and deployability. We introduce $\textbf{SpectralCanary}$, which uses a smooth low-pass mask to blend a fixed canary image into every collection image while leaving captions unchanged and requiring neither auxiliary generation nor per-image optimization. A lightweight verifier detects the transferred signal in suspect-model outputs. Across eight tests on the Pokemon dataset and three realistic data transformations, spanning two architectures families, SpectralCanary achieves the highest average per-generation TPR@$1\%$ FPR ($91.1\%$) and fixed threshold model-level accuracy using 30 generations ($94.8\%$) among the evaluated methods. Across five datasets spanning artistic, medical, satellite, and fashion domains with SD3.5, SpectralCanary averages $92.4\%$ per-generation TPR@$1\%$ FPR while preserving the released images (SSIM $0.989$, LPIPS $0.022$) with a near-zero mean change FID (mean $\Delta$FID $0.05$) across datasets. Matched-energy ablations on Pokemon and ROCOv2 support our design choice, low-frequency placement transfers more reliably compared to mid/high-frequency placement. Under the evaluated adaptive attacks, the most effective removal requires aggressive modification and incurs more than $25$ $\Delta$FID points. These results identify low-frequency visual signals as effective carriers for collection-level T2I audit traces.
0
cs.CV Minkyun Seo, Hyungtae Lim, Jaesik Park · Oct 22, 2026

MixPT tackles the trade-off between computational cost and scene-wide interaction in point cloud transformers. It interleaves fixed-order window attention blocks with periodic global attention blocks, using spatial pooling to keep global attention feasible when the number of tokens is large. The authors show that this hybrid schedule lowers per-forward latency compared to both pure window and pure global baselines while maintaining competitive accuracy on indoor and outdoor 3D segmentation benchmarks.

Point cloud transformers aim to capture detailed local geometry and relationships across a scene at a manageable computational cost. Two common approaches are window attention and global attention. They differ in how they enable scene-wide interaction, which refers to information exchange among tokens across a scene. Window attention reduces computational cost by restricting self-attention to groups of tokens called windows; in serialized designs, each window contains a fixed number of consecutive tokens from a spatially ordered sequence. Because each block only directly connects tokens within the same window, information exchange across windows relies on changes in window membership across blocks and hierarchical pooling. Global attention, in contrast, directly connects all tokens within a scene, but computing attention over all token pairs can be costly when the number of tokens is large. To balance computational cost and scene-wide interaction, we introduce MixPT, a point transformer that uses a mix of window and global attention blocks in an interleaved schedule, while retaining a single fixed serialization pattern for its window blocks. For scenes with a large number of tokens, MixPT applies global attention to spatially pooled tokens and returns residual updates to the original-resolution stream. Across indoor and outdoor benchmarks, MixPT achieves competitive accuracy with lower latency than representative window and global attention baselines. We further demonstrate the feasibility of scaling the attention stage in depth by repeating the interleaved pattern of window and global attention blocks.
0
cs.ROcs.CV Eun Sun Lee, Minkyun Seo, Gwangtak Bae et al. · Oct 22, 2026

This paper tackles cross-session indoor navigation, where an agent must reach a prior-session goal despite scene changes, sensor differences, and partial overlap. The key idea is a sparse topometric graph whose nodes compress local 3D geometry around traversable anchors and whose edges encode traversable distance, enabling both memory-efficient storage and learned graph matching for alignment. The approach matters because it promises to slash map memory by over two orders of magnitude while outperforming dense grids, appearance maps, and semantic graphs on standard benchmarks.

A conventional embodied agent in an indoor environment builds a map by accumulating noisy real-world measurements and results from heavy inference to guide navigation. While the detailed measurements may differ due to scene changes or sensor settings, the unique topological structure of navigable passages or the connectivity between rooms may provide training-free guidance that complements local observations. We propose a sparse topometric graph as an efficient structural representation for robust indoor navigation, alleviating the need for fine-grained matching, which is computationally expensive, memory-intensive, and prone to real-world variations. The map consists of nodes that encode local 3D geometry and distance-weighted edges that capture traversable connectivity. A learned graph-matching network finds consistent subgraph structures across sessions by considering both node-level geometric descriptors and neighborhood connectivity. The holistic contextual matching is robust to local ambiguities caused by weak distinctiveness or repetitive structure, and establishes stable correspondences despite local scene changes, different sensor modalities, or limited spatial overlap. We analyze the practicality of the graph through cross-session point-goal navigation, where a goal specified in a prior reference map must be reached from an unknown initial pose in a later session. Experiments show that our method achieves the highest success rates (77.1% on Gibson and 40.0% under 3D-FRONT scene changes), while reducing memory by more than two orders of magnitude compared to point-level representations. The proposed approach further supports cross-session alignment and goal-directed navigation with strong scalability and robust real-world transfer.
0
cs.CVcs.LG Jihoon Hong, Alireza Kheirandish, Rohan Sanda et al. · Oct 22, 2026

Local anomaly detection in images with multimodal inlier distributions—such as medical scans, faces, and X-ray baggage—remains challenging for industrial-defect methods that rely on heuristic reconstruction errors or feature distances. LACToS introduces a principled alternative by scoring superpixels via statistical typicality under the conditional inpainting posterior of an inlier diffusion model, made tractable by grouping pixels into superpixels and using a single denoising posterior as a cheap proxy. This shift from point estimates to distribution-aware testing matters because it directly addresses the false positives that arise when normal images contain diverse, context-dependent content.

Local anomaly detection is the task of identifying spatially confined anomalous or out-of-distribution (OOD) regions within an otherwise in-distribution (ID) image. Most existing methods are designed for a specific context, with a strong focus on industrial defect detection, where they achieve excellent performance on well-established benchmarks. However, we observe that these methods can exhibit significant performance drops in other contexts, especially when the inlier distribution is multimodal. To account for this inlier complexity, we propose LACToS, a principled local OOD detection method based on statistical typicality and made tractable through two innovations: (i) grouping pixels into superpixels and (ii) using a computationally efficient proxy to estimate typicality. We evaluate LACToS across three diverse applications spanning medical imaging, human faces, and X-ray security screening. LACToS performs more robustly than prior methods across these benchmarks. The code is released here: https://github.com/voilalab/LACToS.
0
cs.CV Weihao Gao · Oct 22, 2026

This paper attacks the real-time deployment bottleneck for polyp segmentation by proposing a \sim77K-parameter Lightweight Frame Compensator (LFC) inserted before a frozen backbone. Under $K=3$ frame skipping, LFC fuses three consecutive frames via spatio-temporal attention into a single compensated image, claiming a $2.05\times$--$2.55\times$ throughput gain while recovering most accuracy loss. The core insight is that global-attention Transformers suffer the most from skip-frame jitter, making them the prime beneficiaries of lightweight temporal fusion. Unfortunately, the bulk of the evidence rests on pseudo-labels rather than expert-annotated video ground truth, which undermines the clinical certainty of the reported gains.

Real-time polyp segmentation in computer-assisted colonoscopy is hampered by the difficulty of deploying high-accuracy models under strict latency budgets. Frame skipping, which performs inference every K frames and reuses or interpolates the rest, improves throughput but introduces motion blur and lesion misalignment that degrade temporal consistency. To close this gap, we propose the Lightweight Frame Compensator (LFC), a 77K-parameter plug-and-play module inserted before a frozen segmentation backbone. Operating on a three-frame window, LFC fuses consecutive frames via spatio-temporal attention into a single compensated frame, and is trained only on pseudo-labels generated by a differently seeded model, without any expert annotation. Experiments on three polyp video benchmarks show that LFC recovers most of the accuracy degraded by direct frame skipping and, in several settings, reaches the accuracy of frame-by-frame inference, while retaining a 2.05X--2.55X throughput gain. We further evaluate the temporal stability of three backbones spanning CNN, pyramid Transformer, and global-attention Transformer architectures, revealing a spectrum of sensitivity to frame skipping that arises from how locally or globally each architecture aggregates misaligned input. The compensation gain of LFC follows this spectrum: it is largest for high-capacity Transformer backbones, which achieve the best static accuracy but suffer the most under skip-frame inference. LFC thus offers a lightweight, pluggable, and deployment-friendly route to real-time polyp segmentation.
0
cs.CV Tianming Liang, Junyi Pan, Yuxi Li et al. · Oct 22, 2026

Existing vision-language models struggle with fine-grained visual perception, often hallucinating objects or missing fine details. WeVisOne-VL tackles this by unifying object-level and pixel-level tasks—detection, segmentation, matting, OCR, and more—inside a single autoregressive VLM built on Qwen3-VL. It introduces dedicated coordinate tokens and a lightweight 9.6M-parameter pixel decoder triggered by an <OBJ> token, enabling dense outputs without a separate segmentation backbone. Trained on roughly 100M curated images via a three-stage curriculum and mixed-task RL, it aims to move VLMs from broad understanding toward reliable, deployable perception.

Existing vision-language models (VLMs) remain unreliable for fine-grained visual perception. In this report, we present WeVisOne-VL (WeChat Vision All-in-One), a powerful VLM that unifies object-level and pixel-level perception through structured next-token prediction. It supports multiple visual tasks including object detection, referring localization, counting, OCR, segmentation, and matting, enabling localization at any user-specific granularity, from points and boxes to masks and alpha mattes. Architecturally, we integrate a lightweight pixel decoder into the VLM via a special <OBJ> token to generate instance-level pixel outputs. We train the model with a three-stage curriculum SFT followed by mixed-task RL. Across over 30 benchmarks, WeVisOne-VL demonstrates leading performance on both object-level and pixel-level tasks, while maintaining robust rejection for object-absent queries. By releasing WeVisOne-VL to the open-source community, we hope to advance VLMs from broad visual understanding toward truly reliable perception systems for real-world deployment.
0
cs.CV Xinyang Lu, Shengzhe Wei, Sheng Tang et al. · Oct 22, 2026

Local feature matching underpins SfM and visual localization, but standard matchers process every image pair independently, which is inefficient and ignores multi-view cues available in star-graph neighbourhoods. MVLoMa addresses this by jointly matching a centre image against all neighbours in a single forward pass, reusing frozen geometry-aware tokens from a multi-view foundation model such as DA3-Giant and adding star-structured cross-attention so the centre aggregates evidence from all neighbours. It preserves the conventional sparse pairwise outputs required by RANSAC while improving strict-threshold pose AUC and cutting matcher compute by roughly $2.2\times$ at $25$ views.

Local feature matching is typically formulated for image pairs, although structure-from-motion and visual localization commonly match one reference image against many retrieved or covisible neighbours. Applying a pairwise matcher independently to these centre-neighbour edges duplicates reference-side computation and prevents the matcher from exploiting complementary multi-view geometric evidence from the remaining observations. To address these limitations, we introduce MVLoMa, a sparse star-graph matcher that extends LoMa from image pairs to multiple views. MVLoMa first uses a frozen multi-view geometry model to jointly describe all images in a star, then injects the resulting cross-view geometric context into local descriptors. It then matches the centre image to all neighbours in a single forward pass through per-view self-attention and bidirectional centre-neighbour cross-attention. For supervision, we derive positive correspondences only from depth-valid, mutually visible dense warps and explicitly penalize high-confidence matches that violate epipolar geometry. On 25-view star graphs from HyperSim, ScanNet++, Mip-NeRF 360, and Tanks and Temples, MVLoMa obtains the best macro-average relative-pose AUC among the compared methods at all three thresholds (58.65/85.41/90.99). Its matcher is 2.20 times faster than sequential evaluation of the 24 centre-neighbour edges. The same design supports four tested frozen geometry encoders -- DA3, $\pi^3$, VGGT, and VGGT-$\Omega$ -- with DA3-Giant performing best on all reported encoder-ablation metrics. Controlled ablations further isolate the effects of geometry-aware descriptors, visibility filtering, geometric negative supervision, and joint multi-view inference.
0
cs.CV Adam Lee, Mutian Xu, Yukang Cao et al. · Oct 22, 2026

DeXplicit addresses action-conditioned world modeling for dexterous manipulation by splitting prediction into an explicit metric 3D dynamics stage and a subsequent video rendering stage. Instead of entangling physics, viewpoint, and appearance in a monolithic video generator, it first forecasts structured object motion and deformation, then uses those predictions as geometric scaffolds for efficient causal video synthesis. The core claim is that making physical state explicit improves both geometric accuracy and generation speed.

Before acting on an object, a robot needs to anticipate how its hand motion will change the physical world and what the resulting scene will look like. Existing approaches typically entangle action-conditioned dynamics, camera motion, and visual synthesis within a video generation model, or represent dynamics as point trajectories without explicit object structure. We introduce DeXplicit, a dexterous manipulation world model that instead predicts how the world evolves explicitly in metric 3D before rendering its visual consequences. Given an initial scene and a future hand trajectory, a lightweight 3D dynamics network predicts object-centric motion and deformation, providing structured and geometrically grounded future world states. These predictions then serve as a strong scaffold for video generation: appearance is transported through the predicted 3D motion and projected into future views, allowing the renderer to focus on completing uncertain and newly visible content rather than implicitly learning world dynamics from pixels. This explicit-3D-first decomposition also enables efficient causal generation, requiring only two denoising steps per block while conditioning on generated history. Across HOT3D, OakInk2, and PhysTwin, DeXplicit reduces moved-point error by 27-40% relative to PointWorld and improves object fidelity IoU+ by 47% on HOT3D under a shared renderer. Our design with two-step causal generation achieves a 57x speedup from our 14B bi-directional configuration in video synthesis.
0
cs.CV Wei Zhang, Ying Feng, Mengtong Wu et al. · Oct 22, 2026

Stream4D tackles online 4D reconstruction in dynamic scenes, where moving objects break static-scene assumptions and cause pose drift and ghosting artifacts in causal streaming pipelines. The core idea is a training-free plug-in that mines temporal motion cues from the KV cache of causal Transformers, fuses them with depth priors to generate dynamic masks, and suppresses dynamic keys via soft masking to prevent interference during historical aggregation. By operating directly on cached keys without architectural changes or retraining, it aims to make existing streaming backbones like Stream3R and StreamVGGT robust to dynamic content while retaining linear-time scalability.

4D scene reconstruction requires robust handling of dynamic objects, yet existing streaming methods commonly assume static scenes, leading to pose drift and ghosting artifacts over long sequences. We introduce Stream4D, a training-free, motion-decoupled streaming reconstruction framework that can be directly integrated into causal Transformer backbones (e.g., StreamVGGT, Stream3R). Our key observation is that causal attention implicitly encodes rich temporal motion cues within the KV cache. We adaptively aggregate these cues from multiple attention layers and across temporal windows, and fuse them with depth priors to handle challenging cases such as occlusions and textureless regions, producing precise dynamic masks that decouple static and dynamic regions. We then apply a soft key masking scheme that leverages these dynamic masks to suppress interference from dynamic regions in causal attention, thereby improving camera pose estimation accuracy. Stream4D inherits the efficiency of causal attention and remains compatible with existing streaming architectures. On diverse dynamic-scene benchmarks, Stream4D significantly improves camera pose estimation and static-scene reconstruction quality, yields reliable dynamic masks, and effectively mitigates long-sequence ghosting.
0
cs.CV Guillem Casadesus Vila, Grace Gao · Oct 22, 2026

Future lunar rovers will navigate tens of kilometers using cameras, but the feature detectors and matchers at the heart of visual odometry are benchmarked almost exclusively on urban and driving scenes. This paper evaluates eleven classical and learned detector–matcher combinations on nine synthetic, lunar-testbed, and terrestrial-analogue datasets, measuring how pairwise pose accuracy degrades with viewpoint change and how the resulting correspondences drive open-loop VO error. The central finding is that learned SuperPoint pairings outperform classical SIFT on real low-texture lunar terrain and remain robust across lighting, yet synthetic datasets alone are misleading predictors of real performance and the learned advantage narrows when short-baseline translation direction is scored jointly. The work directly addresses a critical gap for Artemis-era rover autonomy by showing precisely where classical front ends fail and under what conditions learned ones are worth their computational cost.

Lunar rovers will primarily rely on cameras for localization until navigation satellite services are deployed, and will continue to need them afterwards for relative navigation, hazard detection, and surface operations. Visual odometry (VO) and Simultaneous Localization and Mapping (SLAM) mostly estimate motion by matching features between frames. However, feature matchers are developed on urban, indoor and driving scenes, planetary studies compare them on orbital registration or within complete SLAM systems, and real lunar imagery with reference poses is scarce, so matching between rover frames on low-texture, harshly lit terrain, and its effect on VO, has not been compared. We benchmark eleven classical and learned detector-matcher combinations on nine synthetic, lunar-testbed, and terrestrial-analogue datasets, and a feature tracker, scoring pairwise pose accuracy against baseline and the trajectory error of the resulting VO. Under a common rotation-only metric, the SuperPoint pairings outperform SIFT with ratio-tested FLANN matching on both lunar testbeds and one analogue site, with smaller or unresolved differences on synthetic data. When rotation and translation direction are scored jointly, this SIFT pairing exceeds both SuperPoint pairings on four synthetic datasets, so synthetic results alone do not establish relative performance on real rover imagery. In stereo VO, the SuperPoint pairings are not consistently more accurate than SIFT, but only they keep tracking on all eight sequential datasets. Pairings with classical detectors depend on lighting while SuperPoint changes little: a low spotlight makes them more accurate than diffuse light on the same testbed views, consistent with more contrast and detected keypoints. SuperPoint with LightGlue is the fastest learned combination (16 ms per frame), and DINOv2 retrieval proposals still need geometric verification.
0
cs.CV Ariel Lapid, Yuval Haitman, Reuven Peretz et al. · Oct 22, 2026

GLOW-FM attacks the high inference cost of diffusion-based low-light image enhancement (LLIE) by replacing iterative sampling with a single-step latent flow. The core idea is to run Terminal Velocity Matching (TVM) in the compact latent space of a frozen Tiny-VAE, directly predicting the displacement from a degraded low-light latent to its well-exposed counterpart in one function evaluation. If its quality claims hold up, the result would be a generative LLIE method practical enough for edge-device deployment.

Low-light image enhancement (LLIE) aims to recover well-exposed and perceptually faithful images from severely degraded observations. Recent diffusion-based generative methods achieve strong perceptual quality by leveraging powerful image priors, but their iterative sampling incurs substantial computational cost, limiting practical deployment. Despite recent efficiency gains in generative LLIE, high-quality enhancement with a single function evaluation and low overall computation remains challenging, particularly under diverse real-world low-light conditions. We introduce GLOW-FM, a one-step latent flow-matching framework for efficient generative LLIE. GLOW-FM performs conditional transport in the latent space of a frozen Tiny-VAE and leverages Terminal Velocity Matching (TVM) to enable enhancement with a single function evaluation. Matched comparisons with alternative one-step objectives support TVM as an effective design choice, and, to the best of our knowledge, this is its first adaptation to image restoration and specifically to LLIE. Extensive experiments on challenging real-world benchmarks demonstrate that GLOW-FM achieves competitive image quality and state-of-the-art cross-dataset generalization while requiring only a single function evaluation and 34 GFLOPs for the small variant. These findings highlight the potential of GLOW-FM to bring generative LLIE closer to practical deployment through single-step inference and compact latent modeling. Code will be made publicly available upon publication.
0
cs.CV Qiwen Gu, Xin Zhou, Xiwu Chen et al. · Oct 22, 2026

FlexPart addresses a key limitation in controllable 3D asset creation: existing image-to-3D part generation systems are typically specialized for a single prompt type, forcing users into rigid workflows. The paper introduces a unified Diffusion Transformer framework that simultaneously accepts sparse point prompts, 2D bounding boxes, and dense masks via Gated Adaptive Layer Normalization, while an Asymmetric Geometric Guidance mechanism uses differentiable optimal transport to let dense spatial priors supervise sparse representations during training. By jointly training across prompt granularities, the method aims to improve part-level geometric fidelity and give users flexible control over how they specify structure.

Controllable 3D part generation is pivotal for digital asset creation, yet existing methods lack the flexibility to accommodate diverse user workflows requiring varying levels of control. In this paper, we introduce FlexPart, a unified image-to-3D part generation framework that supports variable-granularity geometric conditions within a single model. By seamlessly integrating heterogeneous inputs, ranging from sparse points to dense bounding boxes and masks, via gated adaptive modulation, FlexPart unlocks a powerful cross-modal synergy. We also propose an asymmetric geometric guidance mechanism that leverages strong spatial priors to align representations across granularities, improving geometric consistency and facilitating inter-task synergy. Under mask conditioning on PartVerseXL, FlexPart reduces Part CD by 16.6% relative to TripoSG + SAM3D and by 10.5% relative to OmniPart, while maintaining competitive whole-mesh quality. The code can be found at https://github.com/Gucci233/FlexPart
0
cs.CV Wenhua Jin, Tiancheng Chen, Sheng Tang et al. · Oct 22, 2026

Motion segmentation is conventionally treated as an object-level property, causing entire instances to be marked moving even when only a small part displaces or when the camera itself moves. This paper reframes motion as a relation between an ordered source–target frame pair and proposes MoRSe, a feed-forward model that predicts moving-region masks without optical flow, point tracks, or a frozen segmentation foundation model at inference. To support this formulation the authors introduce MoRSe-5K, a benchmark with Static, Dynamic-Static, and Dynamic splits that directly measures whether a model can suppress false positives under pure camera motion.

Moving object segmentation is conventionally formulated at the sequence and object level, marking an entire instance as moving once it moves anywhere in a video. Recent instantaneous formulations distinguish moving from stationary intervals, but still generate masks at the object level through frozen segmentation foundation models. Because the mask is derived from an instance-level proposal, motion is typically attributed to the entire instance rather than localized to the regions that actually move. Moreover, such instance-level predictions can produce masks even when no part of the instance is actually moving, revealing a more fundamental issue: motion is not an intrinsic property of an instance; it can only be determined by comparing at least two frames. Building on this premise, we introduce MoRSe, which jointly interprets two frames to predict a moving-region mask, distinguishing actual scene motion from apparent motion induced by the camera. A single RGB encoder replaces multi-stage foundation stacks, so no optical flow, point tracks, or separate mask generator is needed at inference. We release MoRSe-5K, a benchmark of 42 sequences with Static, Dynamic-Static, and Dynamic settings designed to evaluate the model's ability to distinguish and localize moving and stationary regions under different camera and scene motion conditions. MoRSe outperforms both specialized moving object segmentation methods and dense 4D reconstruction methods with motion-thresholded predictions, while producing the fewest false positives on sequences where nothing moves.
0
cs.CV Nimrod Shabtay, Asaf Yehudai, Avihu Dekel et al. · Oct 22, 2026

Vision-language models lag at visual in-context learning because they exploit textual shortcuts rather than learning from demonstration images. This work argues the root cause is insufficient training data that forces pure visual induction, and proposes MIME—a synthetic, task-agnostic dataset where the rule is never stated in text—and DTAD, a label-dropout mechanism that shifts attention to visual tokens. The result is an 8.1–18.0 point jump in vICL accuracy across multiple architectures, with an 8B model matching frontier proprietary systems, suggesting vICL-specific data should become a standard ingredient in VLM training.

Vision-language models (VLMs) struggle with in context learning compared to their textual counterparts. Our preliminary study shows that VLMs rely on textual shortcuts and underutilize the visual demonstrations. We therefore hypothesize that VLMs are insufficiently trained to perform visual in-context learning (vICL). To this end, we construct MIME, a task-agnostic vICL training set without textual shortcuts. We ensure the instruction does not state the rule linking the demonstration images to their answers, so the model must infer it from the visual demonstrations. Fine-tuning on MIME improves vICL accuracy by 8.1 to 18.0 points across three VLMs, preserves single-image performance, and improves multi-image and text only in-context learning. In contrast, stating the rule in the training data sharply reduces this gain. We further propose DTAD (Demonstration Text Attention Dropout), which randomly withholds demonstration labels during training so that the VLM must infer the rule from the demonstration images. While achieving comparable vICL accuracy to fine-tuning on MIME, DTAD yields more consistent attention to the demonstration images. On TrueMICL, Qwen3-VL-8B trained on MIME matches frontier models such as Claude Opus 5, and surpasses them with DTAD. Finally, adding MIME to the instruction-tuning mix of LLaVA 1.5 13B more than doubles its vICL accuracy without hurting single-image abilities, whereas a same-size multi-image set improves it only slightly. These results suggest that vICL data should be a standard component of VLM training.
0
eess.IVcs.CVcs.GR Zhang Zichuan, Bart Brouwers, Rembrandt Bakker et al. · Oct 22, 2026

H-2DGS addresses the need for sharp, photorealistic neurosurgical surface reconstruction that can fuse with MRI and tractography without obscuring internal brain structures. The authors propose a three-stage pipeline that bootstraps appearance with conventional 3D Gaussian Splatting, contracts volumetric density along camera rays using differentiable quantiles, and converts the fused TSDF surface into curved height-field Gaussian patches. By explicitly representing a thin, deformable cortical sheet rather than a diffuse volume, the method targets geometric precision and compactness at the cost of some rendering fidelity.

Neurosurgical navigation commonly presents magnetic resonance imaging (MRI) as 2D slices, making it difficult to relate the anatomy in those slices to the cortical surface observed through the surgical microscope. We seek a common 3D visualization that combines a photorealistic reconstruction of the exposed cortex during tumor surgery with whole-brain MRI context and diffusion tractography pathways. This requires the reconstructed cortex to form a clear boundary around the brain anatomy rather than a diffuse volume that obscures internal structures. Conventional 3D Gaussian Splatting (3DGS) can reproduce observed views but, under limited surgical view coverage, may distribute opacity through a thick and geometrically ambiguous band. We introduce height-field 2D Gaussian Splatting (H-2DGS), a three-stage pipeline that concentrates a robust 3DGS reconstruction, fuses its depth into a shared truncated signed distance field (TSDF) surface, and represents that surface with curved, surface-oriented Gaussian primitives. Separate height, color, and opacity bases provide local geometry and appearance, while a neighbor-transition objective coordinates overlapping patches. The explicit surface further supports postoperative alignment: MRI-derived depth deforms the reconstruction, and tracked-color supervision with alternating optimization preserves its appearance. Across five real neurosurgical cases, H-2DGS gives low multi-view depth inconsistency, a compact 7.97MB representation, and interactive rendering at 29--42ms per frame. The resulting sharp, deformable surface integrates clearly with tractography and MRI anatomy, including a postoperative resection cavity.
0
cs.CV Ronald Fecso, Jos\'e Morano, Botond Fazekas et al. · Oct 22, 2026

Multimodal large language models can answer clinical questions about retinal OCT scans, but without spatial grounding clinicians cannot verify whether a model attended to real pathology or relied on spurious shortcuts. This paper introduces RetinaGroundBench, the first benchmark for biomarker visual grounding in retinal OCT, together with $AggIoU$—a metric tailored to MLLMs that fragment lesions into multiple boxes—and RetGrounder, an 8B domain-adapted model that outperforms general-purpose models up to 38B parameters. The core message is that grounding remains largely unsolved: even the best open-source model achieves only 23.7% macro $F_1$, and VQA ability does not imply localization skill. The work matters because trustworthy clinical deployment of MLLMs requires precisely this kind of verifiable spatial evidence.

Multimodal large language models (MLLMs) can answer clinical questions about medical images, but trustworthy use requires visual grounding: models should localize the pathology they report rather than rely on spurious shortcuts. Whether MLLMs can visually ground clinical findings in retinal optical coherence tomography (OCT), the most widely used imaging modality in ophthalmology, remains largely unexplored. To address this gap, we introduce RetinaGroundBench, the first benchmark for biomarker visual grounding in retinal OCT. It comprises 815 B-scans exhaustively annotated by ophthalmologists with 4,537 bounding boxes covering 13 biomarkers across 8 diseases. Because MLLMs often fragment a single lesion into multiple partial predictions, we propose AggIoU, a metric that evaluates whether the union of overlapping predicted boxes covers the annotated region. Across 27 open-source MLLMs (0.8-38B parameters), we find that visual grounding remains largely unsolved: the best general-purpose model achieves a macro F1 of just 23.7%, with consistently low recall, despite reaching up to 73% balanced accuracy on biomarker presence questions. To narrow this gap, we developed RetGrounder, an MLLM fine-tuned using an OCT-specific strategy integrating grounding and textual information. Despite its relatively small size (8B), RetGrounder improves grounding F1 to 33.9%, a 43% relative improvement. Our benchmark provides a reference point for measuring progress in the field of OCT diagnosis with MLLMs.
0
cs.CV Y. Li, M.Bigliardi-Qi, S. Bedros et al. · Oct 22, 2026

This paper audits SkinCon, a widely used dermatology concept dataset, for skin-tone-dependent annotation bias.
Within the same disease, erythema is labeled far less often on dark skin (odds ratio 0.17) while pigmentary concepts are labeled more often.
An evidential concept model trained on these annotations reproduces the bias, and three label-error detectors fall below a disease-only baseline at catching potential erythema omissions.
The work warns that concept bottleneck explanations for skin disease diagnosis cannot be trusted until annotations are audited within each subgroup.

Concept bottleneck models (CBMs) let clinicians inspect and correct skin disease diagnoses through clinical concepts, but only if the concept annotations are reliable. We therefore audit the reliability of SkinCon, a widely used dermatology concept dataset, across skin tones. Within the same disease and with near duplicates removed, erythema is annotated far less often on dark than on light skin, with an odds ratio of 0.17. In contrast, hyperpigmentation and hypopigmentation are annotated more often, with odds ratios of 6.2 and 4.5, respectively. We refer to this pattern as tone-dependent concept annotation. An evidential concept model trained on these annotations learns the same pattern and reproduces it on unseen images. Such a model may agree with potential erythema omissions rather than contradict them. Consistent with this, three label error detectors underperform a disease-only baseline at finding erythema that dermatologist captions mention but SkinCon labels as absent. The three detectors are based on confident learning, training dynamics, and the model's own evidential uncertainty. Concept annotations should thus be audited within each subgroup before explanations built on them can be trusted.