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 Zefan Yang, Zheyuan Zhang, Boris Maihe et al. · Oct 14, 2026

Robotic ultrasound lacks safe, realistic simulators because physics-based phantoms and acoustic solvers exhibit a large domain gap with clinical imaging, while trial-and-error on patients is unsafe. SonoWorld proposes a three-stage pipeline that first pretrains a latent-action video diffusion model on roughly 6.9 million unlabeled clinical frames, then grounds the learned dynamics to 6-DoF probe poses via a small EM-tracked thyroid dataset, and finally distills the model into a causal autoregressive generator with selective KV-cache retention for streaming inference. The goal is to provide a data-driven interactive environment for training and evaluating robotic scanning policies without requiring per-subject pose tracking, although the achieved fidelity and limited evaluation leave its practical readiness unclear.

Robotic ultrasound can standardize image acquisition and reduce operator workload and variability, but policy learning remains limited by the lack of realistic, controllable simulation environments. While controllable world models have advanced rapidly in natural-image domains, ultrasound world modeling remains challenging because each frame captures only a cross-section of unobserved 3D anatomy, causing small probe motions to induce large appearance changes. Existing approaches rely on robot-tracked poses and latent-space prediction, but do not directly generate the observations required for interactive control. We propose SonoWorld, a causal ultrasound world model that learns video dynamics from unlabeled clinical videos and grounds them to 6-DoF control using a small set of freehand clinical scans tracked with an EM sensor. SonoWorld is trained in three stages: pretraining a latent-action-conditioned video diffusion model on around 6.9 million unlabeled multi-organ ultrasound frames; grounding the learned video dynamics to metric probe poses with a small EM-tracked thyroid dataset; and applying distribution matching distillation to enable causal, long-horizon autoregressive generation with selectively caching eviction tokens at inference time. We evaluate controllability through pose-following fidelity, round-trip consistency, and axis-specific control under synthetic actions on held-out tracked scans, and further validate it with a user study. In model-based action discrimination, SonoWorld correctly ranks the target-directed probe motion over an equal-magnitude opposite motion in up to 74.8% of trials. To our knowledge, SonoWorld is the first causal, pose-controllable ultrasound world model learned primarily from freehand clinical videos, providing a data-driven interactive environment for robotic ultrasound data acquisition and policy evaluation.
0
cs.CVcs.LG Ahmed Sharshar, Asif Hanif, Naveen Kumar Kummari et al. · Oct 1, 2026

Medical imaging models often fail when deployed across scanners or hospitals because they overfit to domain-specific textures and appearance statistics. PhaseAT addresses this by adversarially perturbing the Fourier phase of the luminance channel while keeping the amplitude spectrum fixed, generating hard training views that stress spatial organization under matched style. By encouraging the model to ignore brittle amplitude-driven correlations and focus on stable geometric structure, PhaseAT achieves large gains on both single-source and multi-source domain generalization benchmarks.

Reliable clinical deployment of deep medical image models is hindered by distribution shifts across scanners, sites, and acquisition protocols. Existing domain generalization (DG) methods often focus on style or intensity diversification, but they can still leave networks dependent on domain-specific texture correlations. Inspired by evidence that Fourier phase encodes semantic structure, we introduce PhaseAT, a phase-aware adversarial training framework for medical DG. PhaseAT forms phase-perturbed training views in the Fourier domain by iteratively updating a bounded phase perturbation while keeping the amplitude spectrum unchanged, thereby stressing spatial organization under matched appearance statistics. Perturbations are applied only to the luminance channel in YCbCr color space to avoid chromatic artifacts. Additionally, a simple phase-saliency mask concentrates updates on the most influential frequencies. The model is trained with a weighted combination of losses on clean and phase-perturbed samples, supporting both single-source and multi-source DG. We validate our method on two challenging medical datasets and demonstrate that PhaseAT achieves over 20% improvement in single-source domain generalization, outperforming several state-of-the-art DG methods. The code implementation is available at: https://github.com/ahmed-sharshar/PhaseAT.
0
cs.LGcs.CV Si Qi Goh, Cap Dang Xuan Kiet, Tat-Jen Cham et al. · Oct 1, 2026

SIEVE tackles selective unlearning in vision-language models (VLMs), where a model must forget specific sensitive image-question-answer associations about an individual while retaining permitted facts about the same person. The core idea is to suppress attention-value representations for forget examples toward zero and anchor retain-example values to a frozen reference model, coupled with sequence-level negative cross-entropy. This matters because VLMs can recover biographical information from faces, creating privacy risks, and prior methods struggle to disentangle closely related forgotten and retained knowledge without degrading utility.

The ability of vision-language models (VLMs) to associate visual identities with biographical information creates a need for selective unlearning of personally identifiable information (PII) while preserving permitted knowledge about the same individual. This setting is challenging because both sensitive and retained information can share the same visual inputs and intermediate representations. We introduce SIEVE, a simple and effective framework for selective VLM unlearning. SIEVE directly regularizes attention-value representations while also controlling model outputs. SIEVE suppresses attention values for forget examples toward a constant zero, while preserving retain-example representations by matching them to a frozen reference model. These objectives are combined with sequence-level forget and retain supervision, enabling targeted forgetting without largely affecting retained knowledge. Extensive experiments show that SIEVE achieves state-of-the-art performance on unlearning with multiple model-modality settings, while maintaining competitive retained utility. Ablation studies further show that value suppression and negative cross-entropy contribute complementary forgetting signals, while reference-based value matching substantially reduces utility degradation. These results demonstrate that attention values provide an effective intervention point for selective multimodal unlearning when sensitive and retained knowledge are closely related.
0
cs.CVcs.AIcs.CL Sophia Sirko-Galouchenko, Monika Wysoczanska, Andrei Bursuc et al. · Oct 1, 2026

Where-OPD proposes a new on-policy self-distillation paradigm for multimodal large language models. Instead of giving the teacher zoomed-in image crops, it provides textual spatial hints that identify question-relevant visual elements and their coordinates, using procedurally generated synthetic counting scenes where object locations are known by design. The student learns to match the teacher’s behavior from the raw image and question alone, and the authors claim that training on just 3,000 such synthetic scenes transfers to broad real-world perception gains across 15 benchmarks.

On-policy self-distillation has recently emerged as an effective approach for improving language-model reasoning by supervising students with a frozen or EMA version of themselves that receives privileged information. Its application to multimodal large language models (MLLMs), however, remains largely unexplored. Recent approaches use privileged visual information, such as image crops corresponding to a question, to improve fine-grained perception, but their gains are confined to tasks that benefit from such visual zooming and require either human-annotated grounding data or external teacher models. We introduce a different form of on-policy self-distillation for MLLMs that provides the teacher with textual, spatially grounded guidance identifying the visual elements relevant to a query. We use procedurally generated scenes with automatically available object identities and spatial coordinates, enabling scalable and annotation-free post-training. The teacher uses this spatial guidance to locate and integrate evidence from multiple relevant image regions, while the student learns to reproduce the resulting behavior from the image and question alone. Our approach consistently improves performance on counting, document and chart understanding benchmarks across multiple models. Importantly, although post-training uses only synthetic scenes, the resulting improvements transfer to real-world perception benchmarks, yielding a 3.23-point gain in average performance across CVBench, V*, ZoomBench, BLINK, HR-Bench, and MME-RealWorld. These results show that spatially grounded privileged information can induce broader perceptual capabilities through on-policy self-distillation, enabling substantial synthetic-to-real transfer beyond the task and data distribution used for post-training. Project page: https://github.com/sirkosophia/Where-OPD
0
cs.CVcs.LG Faias Satter, Sk. Md. Masudul Ahsan · Oct 1, 2026

This paper tackles handwritten Bangla word recognition by casting it as character-level object detection rather than whole-word classification. The authors ensemble SSD-MobileNetV2 and Faster R-CNN-InceptionResNetV2 to spot individual characters and diacritics in unsegmented word images, then rearrange the predictions into text. They introduce a modified Non-Maximum Suppression and a heuristic called Preserving Necessary Overlap (PNO) to cope with the cursive matra line and overlapping diacritics that make Bangla OCR notoriously difficult.

An optical character recognition (OCR) can scan a paper and extract text using technology, making people's jobs easier. While various OCR systems are available in the software industry, finding a reliable equivalent solution for Bangla takes much work. When it comes to handwritten texts, the situation is much more unusual. Recognizing words from word images is the most critical stage in any OCR process. It is the second stage after segmenting words from text pictures. If this stage fails, the overall performance of the OCR will be poor, regardless of how well the other phases perform. This study aims to recognize words using deep learning in a handwritten Bangla word image. Three object detection models, SSD with MobileNetV2, Faster R-CNN with InceptionResNetV2, and an ensemble model of these two, have been used to train and test handwritten word images. A modified Non-Maximum Suppression has been introduced to enhance the effectiveness of the models' results. A customized dataset of 9841 handwritten Bangla word images has been compiled, featuring diverse handwriting styles from various individuals. All three models' performances have been checked against the test dataset, and the ensemble model has been the most impressive, with an F1-score of 92.61%. Also, at the word level, the ensemble model correctly recognizes 96.12% of the words to some extent. The system can be further improved by introducing a post-processing phase to correct errors generated by the system.
0
cs.CVcs.AIcs.HC Ramazan Fazylov, Stamatis Lefkimmiatis, Ivan Laptev · Oct 1, 2026

While 3D Gaussian avatars render photorealistic humans efficiently, their animation pipelines are often throttled by costly per-frame neural inference. This paper introduces GALA, which shows that the animation outputs of diverse pretrained avatar networks can be closely approximated by an identity-shared linear blendshape basis extracted via distillation, coupled with a shallow coefficient predictor. By constructing the basis with block-local PCA under a rendering-aware metric and a strict memory budget, the method reduces CPU animation cost by up to three orders of magnitude and enables 60 fps on mobile devices with only modest quality loss.

3D Gaussian avatars support fast rendering, however, their real-time animation is often challenged by the costly neural inference. We address this bottleneck and show that the animation of pretrained avatar models can be closely approximated by a linear combination of identity-independent blendshapes. Building on this finding, we introduce GALA (Gaussian Animation via Linear Approximation), a distillation method that replaces per-frame heavy neural decoding with a shallow coefficient predictor and a linear blend. To improve fidelity and reduce memory requirements, we propose to construct the basis using block-local PCA under a rendering-aware metric and a memory budget. Our method learns a shallow MLP network to predict blendshape coefficients and applies to various animation architectures without retraining original models. We validate GALA by accelerating the inference of three distinct avatar models for 3D animation of facial expressions and full-bodies with clothing dynamics. Across these models, our distillation generalizes to held-out identities and reduces CPU animation cost by up to three orders of magnitude while preserving most of the rendering quality. Excellent results of our method confirm the shared linear structure of learned avatar representations and enable highly efficient and accurate animation at frame rates reaching up to 60fps on mobile devices. Project page: https://ramazan793.github.io/gala/
0
cs.CVcs.AIcs.LG Tianjiao Yu, Xinzhuo Li, Yifan Shen et al. · Oct 1, 2026

SILSA tackles the cost and topological fragility of high-resolution 3D generation by replacing dense or sparse voxel tokens with compact sliding-window slice latents along the three canonical axes. Each of the 384 fixed tokens summarizes a local depth window, preserving cross-sectional continuity while enabling a single-stage rectified-flow generator. Topology-aware slice supervision and a Volumetric Anchor Lattice then maintain geometric and structural coherence. The paper reports large efficiency gains—over 98% fewer tokens than sparse voxelizers—and solid improvements in PSNR, coverage, and Betti error.

High-resolution 3D generation increasingly relies on voxel latents and multi-stage pipelines that first predict active structure and then synthesize local geometry. While effective, this design fragments continuous surfaces into many local tokens, inflates generation cost, and often weakens topological consistency for thin or highly connected shapes. We introduce SILSA, a topology-aware 3D generation framework that represents shapes with compact sliding-window slice latents. Instead of generating expensive voxel tokens, SILSA uses a fixed set of overlapping slices along the three canonical axes, where each token summarizes a local depth window to preserve cross-sectional continuity and support single-stage rectified-flow generation. A Slice VAE encodes oriented surface samples into multi-axis slice latents and reconstructs them with a sparse volumetric decoder, while a Volumetric Anchor Lattice coordinates directional slice streams through a shared 3D workspace. To preserve structural correctness, we introduce slice-level topology supervision that matches persistence diagrams and aligns Betti transitions across neighboring slices. Experiments show that SILSA improves structural fidelity while substantially reducing generation cost. SILSA improves PSNR by $8.7\%$, coverage by $5.96$ absolute points, and Betti error by $9.2\%$ over the strongest baseline, while using $70.0\%$ fewer tokens than the next-most compact baseline and over $98\%$ fewer tokens than sparse or hierarchical tokenizers, effectively reducing training memory by $40.4\%$ and inference time by $58.5\%$. Qualitative results further show improved preservation of thin structures, repeated components, and long-range connectivity.
0
cs.CVcs.LG Hossein Maghsoumi, George Atia, Yaser P. Fallah · Oct 1, 2026

This work tackles street-view weather recognition under severe domain shift, where labeled training images come from generic outdoor datasets and real driving scenes are unlabeled at training time. The proposed Weather-Aware ADDA conditions the adversarial domain discriminator on predicted weather probabilities, encouraging alignment that remains sensitive to weather semantics. The idea is to enable reliable onboard camera-based perception for autonomous vehicles without requiring expensive labeled street-view data for every adverse condition.

Adverse conditions such as rain, snow, fog, and dust remain challenging for camera-based perception in autonomous driving. We study multi-class weather recognition from street-view images under domain shift, where most available training data come from non-street-view sources that differ markedly from real driving scenes. We propose Weather-Aware Adversarial Discriminative Domain Adaptation (WA-ADDA), which conditions the domain discriminator on predicted weather to promote features that are both domain-invariant and weather-sensitive. We also assemble a multi-dataset benchmark by unifying diverse non-street-view weather collections as sources and real street-view images as targets, and define a standardized evaluation protocol with macro accuracy as the primary metric. Across backbones (ResNet-50, EfficientNet, VGG, DenseNet), WA-ADDA consistently improves street-view performance and yields strong per-class recalls in challenging conditions while preserving clear-weather accuracy. These findings highlight the feasibility of domain-adapted weather recognition and the value of our benchmark for advancing robust, on-board perception.
0
cs.CVcs.LG Asaf Vanunu, Boaz Nadler, Arnon Karnieli · Oct 1, 2026

Operational geostationary fire products like the GOES Fire Detection and Characterization (FDC) suffer from high false-alarm rates and poor nighttime recall. This study replaces the FDC's rule-based algorithm with a CatBoost gradient-boosting model trained on over 60,000 GOES ABI fire pixels labeled by VIIRS active-fire detections. By evaluating on large 2024 regions outside the training domain, the authors show that a comparatively simple ML model can substantially outperform the operational product in precision, recall, and early detection latency, especially after dark.

Wildfires pose severe risks to human life, ecosystems, and property. This study presents a machine learning approach for wildfire detection from GOES ABI imagery. A CatBoost model was trained on a large dataset with thousands of ABI images and over 300,000 matching VIIRS fire detections. An evaluation on a separate dataset across five regions showed that the learned CatBoost model outperformed the operational GOES Fire Detection and Characterization (FDC) product. It achieved higher precision, recall, and F1 scores both within and outside the training area. The CatBoost model achieved F1 scores that were 0.16 to 0.38 higher than the GOES FDC in all regions. In addition, out of 51 historical fire events, the CatBoost detected 26 fires before both VIIRS and GOES FDC, compared to only six earlier detections by the GOES FDC. Importantly, the CatBoost model achieved accurate wildfire detection also during nighttime, whereas the GOES FDC obtained very low recall values, around 0.03. This study demonstrates that machine learning models may offer significant improvements over existing geostationary fire products, including higher accuracy, fewer false alarms, and earlier detection.
0
cs.LGcs.CV Yuan Huang, Zihan Chen, Runbin Zhang et al. · Oct 1, 2026

Continual learners that keep a task-specific adapter in every ViT block accumulate parameters linearly in the number of tasks. This paper asks which blocks should specialize, showing that exhaustive placement search traces an inverted-U curve peaking at intermediate depth, while cheap internal criteria systematically favor the deep but suboptimal layers. To sidestep expensive search, the authors propose LS-B, which observes the first few tasks through a frozen fMRI encoding model of human visual cortex and commits task-specific capacity to the blocks whose brain readouts vary most across tasks relative to their stable structure.

Continual learners that keep a task-specific adapter in every block of a pre-trained vision transformer accumulate storage linearly with the number of tasks; keeping task-specific adapters in only a few blocks curbs this growth but raises the question of where to place them. We investigate this question from two perspectives. Algorithmically, training all contiguous four-block placements yields an inverted U: final accuracy peaks at intermediate depth and varies by up to 3.5 percentage points (pp), while inexpensive criteria based on weight spectra or activation statistics favor the deepest blocks. From neuroscience, the hierarchical organization and intermediate-stage plasticity of the visual cortex motivate us to ask whether a measurement taken outside the learner can guide layer specialization without placement search. LS-B observes the first tasks through a frozen fMRI encoding model of twelve human visual areas and commits task-specific capacity once to the blocks whose readouts vary most across tasks relative to their stable structure. Across three ViT-B/16 backbones, LS-B yields stable, backbone-specific allocations. On the two backbones with placement search, AugReg and iBOT, the selected blocks overlap the intermediate-depth region identified by search. Under matched storage and observation budgets, the selected blocks outperform the shallowest and deepest four-block configurations. On Split ImageNet-R, LS-B uses 60% of full-BiLoRA adapter storage while remaining within 1.5 pp of its final accuracy. The allocation requires no labels or backpropagation, adds under 0.6% runtime, and exhibits backbone-specific cortical signatures.
0
cs.ROcs.CVcs.LG Kartik B. Kapse · Oct 1, 2026

Autonomous driving system designers face a persistent dilemma: should they build a decomposed modular pipeline or train an end-to-end neural policy? This survey-style paper addresses that question by comparing modular, imitation-learning, reinforcement-learning, and hybrid architectures across interpretability, scalability, and robustness. Its central contribution is a practical twelve-criterion, four-dimensional framework intended to guide practitioners in selecting the right paradigm for a given deployment context.

Autonomous driving systems have become a central focus of intelligent transportation research, with End-to-End Learning and Modular Architectures offering two prominent design paradigms for their implementation. E2E Learning uses deep learning algorithms to map raw sensory inputs directly to driving actuators, providing a streamlined and adaptable solution. while Modular Architectures employ a pipeline-based approach, dividing the system into distinct subsystems for perception, cognition, planning, and control. This paper presents a comprehensive comparative analysis of these paradigms, focusing on their strengths, limitations, and trade-offs to provide insights into their suitability for various autonomous driving applications. The study evaluates key factors such as interpretability, scalability, robustness, and real-world applicability. While End-to-End Learning emphasizes simplicity and adaptability in dynamic environments, it lacks transparency and is highly dependent on large datasets. Conversely, Modular Architectures offer superior interpretability and task-specific optimization, but face challenges related to integration complexity and scalability. To address these limitations, hybrid approaches that combine the strengths of both paradigms have emerged, offering a promising direction for overcoming these challenges. Beyond this comparative synthesis, following work proposes a Four-Dimensional Architecture Selection Framework, comprising twelve binary criteria across safety, operating environment, data/computational resources, and deployment context, and validate it against ten published autonomous driving systems, correctly recommending 7/10 deployed architectures. This work synthesizes existing literature to highlight key trade-offs between the paradigms and identifies hybrid architectures as a promising direction for future research.
0
cs.CVcs.LG Yuan Huang, Zirui Song, Xiuying Chen · Oct 1, 2026

The paper tackles a critical problem in automated image-editing evaluation: multimodal large language models (MLLMs) acting as judges may be swayed by irrelevant presentation cues rather than the edit itself. Because visual interventions can alter the very quality being assessed, the authors introduce EditJudgeBias, a counterfactual benchmark of 1,196 real samples where 13 cues are injected across four evaluation stages and rigorously verified to preserve underlying quality. They audit five judges along three dimensions—invariance to cues, agreement with humans, and pairwise stability—and show that every judge shifts beyond its own noise floor, with fabricated social proof inflating scores and display-order swaps reversing up to 60.9% of verdicts.

Multimodal large language models (MLLMs) are increasingly used as automated judges for instruction-based image editing and as reward signals for model training. However, systematically auditing whether these judges are influenced by cues irrelevant to editing quality is challenging because visual interventions may themselves alter the quality being evaluated. A judgment shift can therefore be attributed to bias only when the intervention is verified to preserve the underlying editing quality. To address this challenge, we introduce EditJudgeBias, a counterfactual benchmark with verified quality preservation, comprising 1,196 real editing samples and 13 cues injected across four evaluation sites. We verify quality preservation for the requested edit using calibrated multimodal validators, controls, and human inspection. We then audit five MLLM judges along three complementary dimensions: invariance to quality-preserving cues, agreement with human judgments, and stability of pairwise preferences. Importantly, observed shifts are evaluated against each judge's own zero-dose and re-query noise floors rather than against zero. Experiments show that quality-preserving cues move every judge beyond its own noise. Fabricated majority opinions increase ratings, irrelevant visual elements cause larger shifts than whole-image manipulations, and swapping candidate order reverses up to 60.9% of pairwise decisions. Edit-region cues also tend to reduce human agreement. The three measures characterize judges differently, showing that robustness cannot be captured by a single metric.
0
cs.CVcs.AIcs.LG Yuzhou Wang, Emile Anand, Ijay Narang · Oct 1, 2026

Hob-VL introduces a diagnostic benchmark for visually grounded Boolean reasoning, asking vision-language models to evaluate ten-literal Boolean combinations over images and to identify objects satisfying Boolean descriptions. The core idea is to pair each expression with a mechanically verified De Morgan equivalent and to test both symbolic and natural-language presentations, isolating compositional reasoning from surface memorization. It matters because real-world visual queries—warehouse checks, agricultural monitoring, medical imaging—depend on reliably combining multiple visual facts under logical constraints.

Reliable visual reasoning requires composing multiple visual observations and returning consistent answers to logically equivalent questions. We introduce Hob-VL, a benchmark for visually grounded Boolean reasoning. Hob-VL comprises two tasks: (1) evaluating whether a Boolean rule holds in an image, and (2) identifying the (unique) object satisfying a Boolean description. Hob-VL contains 6,000 human-verified balanced Yes/No questions, each defined by a Boolean combination of ten visual statements, across 1,000 generated scenes and 46 diverse labeled photographs, along with 1,000 object-identification questions over the same photographs. Our question families are deliberately constructed to challenge reasoning through misleading local cues and nested logical operations, and include symbolic and structured natural-language presentations. Across eight model configurations with thinking disabled or minimized, Boolean accuracy ranges from 48.52% to 50.57%, while the identification accuracy reaches at most 43.0%. A thinking-enabled GLM configuration achieves uneven gains while retaining substantial errors and inconsistencies. Hob-VL exposes these failures through executable reference answers and matched evaluations.
0
cs.CVcs.LG Ziqi Jiang, Zhenqi He, Long Chen · Oct 1, 2026

Flow Matching (FM) suffers from trajectory crossings that create high-frequency velocity targets and amplify numerical integration errors during few-step sampling. This paper proposes CoFlow, a framework that injects a repulsive contrastive drift into the forward SDE to push training trajectories away from negative samples, thereby smoothing the learned velocity field. The authors derive a simulation-free stochastic interpolant, prove that the transformation preserves the endpoint distributions when boundary terms vanish, and show consistent improvements on ImageNet 256x256 at 20 sampling steps without extra training cost.

Trajectory crossing remains a critical bottleneck in Flow Matching (FM), and previous works typically view these crossings from a theoretical optimization perspective causing velocity averaging. They attempt to address it indirectly by post-hoc distillation or endpoint coupling, without explicitly regulating the intermediate trajectories. In this paper, we introduce a new network learning perspective: crossing points inherently induce large local Lipschitz constants in the target velocity field, leading to two drawbacks. First, high Lipschitz constants correspond to high-frequency signals in the velocity field that neural networks struggle to fit due to spectral bias. Second, they also imply drastic velocity variations, leading to severe numerical integration errors in few-step inference. To alleviate this, we propose CoFlow, a framework that introduces the contrastive learning paradigm into FM to explicitly repel trajectories during training, thereby lowering the local Lipschitz constants of the velocity field. Specifically, we formulate CoFlow from a Stochastic Differential Equation (SDE) perspective by injecting a repulsive drift term. This drift actively guides the forward process of positive samples away from negative trajectories, effectively reducing the local Lipschitz constant. Furthermore, we derive an equivalent stochastic interpolant formulation from this SDE, providing a simple and tractable design space to control the influence of negative samples. Extensive experiments on ImageNet 256x256 demonstrate that CoFlow significantly reduces FID compared to standard FM in few-step inference (e.g., 20 steps), with no added training overhead. The code can be accessed at: https://github.com/HKUST-LongGroup/CoFlow
0
cs.CV Masaya Takabe, Hiroshi Watanabe, Sujun Hong et al. · Oct 1, 2026

The paper tackles misalignment in canonical Gaussian video representations caused by large global camera motion. The core idea is to precompute frame-wise affine transforms, align all GOP frames into a larger atlas space, and fit canonical Gaussians there before projecting back. This plug-in alignment step lowers the burden on temporal deformation models with essentially no extra parameters, yielding large PSNR gains on high-motion sequences.

Gaussian splatting has recently emerged as an efficient representation for images and videos due to its explicit structure and fast rendering capability. Existing Gaussian-based video representations often decompose a video into canonical Gaussians and temporal deformation. However, when a video contains large global motion such as camera movement, the canonical representation may become misaligned with individual frames, increasing the burden on the temporal deformation model. In this paper, we propose an affine-atlas canonical Gaussian representation, which constructs canonical Gaussians in a larger affine-aligned atlas space. Frame-wise affine transforms absorb global motion before canonical Gaussian construction, reducing the gap between the canonical representation and target frames. Since the proposed method only modifies the canonical construction stage, it can be integrated into existing canonical-Gaussian-based methods with negligible additional parameter cost. Experiments show that our method improves reconstruction quality especially for sequences with large camera motion.
0
cs.CV Hanyuan Xiao, Gonglin Chen, Haolin Xiong et al. · Oct 1, 2026

Doppelgangers—visually similar yet geometrically distinct surfaces—routinely corrupt structure-from-motion by creating false matches in large image collections. MVDG attacks this bottleneck by repurposing the feed-forward 3D foundation model VGGT to encode arbitrary multi-view image sets in a single forward pass, then applying lightweight per-layer decoders and a confidence-based early-exit gate to classify covisible pairs. The goal is to escape the quadratic $\mathcal{O}(n^2)$ inference cost of pairwise classifiers while preserving downstream reconstruction accuracy.

Illusory matches between distinct yet visually similar 3D surfaces--doppelgangers--remain a fundamental obstacle for large-scale, in-the-wild 3D reconstruction and visual localization. Prior work mitigates this issue with pairwise classifiers, but this design limits multi-view contextual reasoning and incurs O(n^2) inference complexity for downstream structure-from-motion (SfM). We present MVDG, a scalable multi-view disambiguation framework built on the 3D foundation model VGGT, which jointly reasons over an arbitrary number of multiview images. By incorporating 3D-aware multi-view features, our method reduces dependence on pairwise comparisons by encoding and decoding views in a single pass. We further observe that direct multi-view fine-tuning of VGGT can be unstable under noisy supervision; motivated by label ambiguity in Doppelgangers, we construct a pseudo-pairwise training set from AerialMegaDepth and show that fine-tuning on sampled subsets yields stable optimization and strong generalization to held-out scenes. Finally, because full SfM evaluation (even with faster pipelines such as GLOMAP) remains expensive, we process a pseudo-pairwise dataset for efficient validation; we derive a predictive relationship between regular SfM metrics and the classification accuracy on this pseudo-pairwise test. Experiments show that our method achieves comparable pairwise accuracy while improving both SfM accuracy and inference speed over baselines.
0
cs.LGcs.CV Donghoon Lee, Shinjin Kang · Oct 1, 2026

Post-hoc OOD detectors routinely tune hyperparameters or fit combining rules on held-out samples from the same OOD datasets used for final evaluation. This paper shows that the standard validation protocol only prevents memorization of individual images, not memorization of dataset identity, and that most reported gains vanish when the detector is instead evaluated on truly unseen OOD datasets. The authors isolate the effect with two elegant controls and derive a closed-form expression for the inflation.

A post-hoc out-of-distribution (OOD) detector reads the activations of a trained classifier and returns a score. It fits that score on in-distribution data, and the benchmarks that evaluate it supply a second piece of OOD data for the fitting itself. Some detectors tune a constant on it. Others fit a direction in feature space or train a flexible combiner and report the number that it reaches as the gain that is still available. Every such fit is validated on held-out samples of the same OOD dataset. That check rules out memorizing individual images. It says nothing about a fit that has instead learned which dataset it is looking at, and a direction that recognizes one OOD dataset rather than novelty passes it perfectly. The detector that a practitioner installs meets OOD data from a source that nobody fitted it on, so the difference decides what the reported number is worth. We measure it by holding out the whole OOD dataset rather than a sample of it, and we call that gap the inflation. We read it across a range of combiners on ImageNet and CIFAR-100 backbones. Most of the gain that the usual protocol reports turns out to be dataset identity rather than novelty. The size of the fit does not move what survives, so the effect is not ordinary overfitting. The share depends instead on whether the input exposes class identity, and two controls that vary that property alone separate the inflation on every backbone of both benchmarks. A closed form accounts for the effect and computes it from the fitting rows, so a practitioner can tell which fits will inflate without running the hold-out protocol. One of these fits survives, namely the single constant that the field already picks on a designated validation dataset. Anything above it reports a gain that the hold-out protocol does not return, and on one benchmark what survives falls while what is reported climbs.
0
cs.ROcs.CV Shota Kobayashi, Koki Seno, Daichi Yashima et al. · Oct 1, 2026

NarrativeFlow tackles language-conditioned robot manipulation by generating dense robot velocity fields through a flow-matching formulation, allowing models to train on heterogeneous cross-embodiment data without platform-specific action labels. It introduces a Narrative Delta loss that aligns intermediate representations with textual descriptions of task-relevant scene changes, along with dual subtask tokens to isolate this auxiliary objective from the primary flow-generation path. On standard benchmarks and real-world mobile manipulation tasks with an HSR robot, the method substantially outperforms sparse-keypoint baselines, though absolute success rates and reliance on large MLLM-generated captions leave room for refinement.

We focus on language-conditioned flow-based manipulation, where robot flows (robot velocity fields) serve as embodiment-agnostic, motion-centric representations for leveraging data collected from multiple robot platforms. This task is crucial because language-conditioned manipulation is essential for practical robotic systems, yet scaling robot foundation models remains limited by the labor-intensive collection of embodiment-specific data. Existing methods either coarsely approximate robot flows with sparse keypoint displacements, or cannot handle language-conditioned manipulation. To address this limitation, we propose NarrativeFlow, which models robot flows as continuous velocity fields using a flow-matching formulation conditioned on language. Accordingly, NarrativeFlow generates robot flows that are physically consistent with real-world manipulation. To validate NarrativeFlow, we have conducted experiments on standard datasets for language-conditioned manipulation. The experimental results show that NarrativeFlow outperforms representative baseline methods on standard evaluation metrics. Furthermore, through real-world experiments, we show that NarrativeFlow achieves higher success rates than baseline methods across multiple manipulation tasks. The project page is available at https://shota0520.github.io/NarrativeFlow-project-page/
0
cs.CV Patrick Amadeus Irawan, Iskandar Muda Rizky Parlambang, Rava Maulana et al. · Oct 1, 2026

Ego2Act introduces a benchmark and automated evaluator for goal-directed egocentric manipulation video generation. It tests whether models can plan and execute multi-step physical tasks from a single starting image and high-level goal, spanning 110 real-world cases. Experiments reveal severe limitations in current video generators, with even the best proprietary model scoring only 64.0 on human evaluation and frequently skipping prerequisite steps or violating physical continuity.

Video generation models are increasingly being explored as world simulators for embodied planning and learning. To do so effectively, these models must not only generate visually appealing frames, but also predict how environments dynamically evolve when executing goal-directed actions. While evaluating these capabilities is crucial, existing benchmarks focus mainly on single short actions or step-by-step instructions. This leaves multi-step physical reasoning underexplored, especially in egocentric video generation that requires planning to simulate proper execution to accomplish high-level goals by carrying out multiple real-world manipulations. We introduce Ego2Act, a goal-directed benchmark featuring 2,640 videos from 110 real-world tasks across day-to-day settings, varying object clutter and multi-step complexity. Given an initial scene image and a high-level goal, Ego2Act evaluates whether video generation models can produce realistic egocentric videos of a hand manipulating objects to carry out the task. To support scalable evaluation, we also introduce Ego2ActJudge, a reference-free evaluation pipeline that achieves better task completion and physics plausibility evaluation alignment with human consensus compared to relevant baselines. Our findings reveal that models' generated simulations often skip or partially execute steps, leaving later steps missing dependent states, which leads to unfulfilled goal. Furthermore, models consistently fail at fine-grained physical dynamics, particularly during complex object manipulation and persistent world modeling. We hope Ego2Act provides a rigorous testbed for advancing video models toward physically plausible, goal-directed simulation.
0
cs.CVphysics.ed-ph Haiming Zhao, Tai Wang, Kun Zhang et al. · Oct 1, 2026

Science teachers need to find documentary clips that illustrate abstract physics concepts like inertia or gravity, but existing retrieval systems only match literal scene descriptions. This paper formalizes concept-to-example video retrieval and proposes CDDA, a three-stage adaptation framework that anchors curriculum concepts between textual examples and sparse visual evidence from documentaries. By structuring the language space on educational texts before transferring to video, CDDA aims to bridge the abstraction gap without destroying concrete image-text alignment, offering a targeted tool for instructional video search.

Science teachers frequently search for documentary excerpts not by describing what appears on screen, but by querying the abstract concepts they intend to teach. This use case exposes a limitation of existing language-based video moment retrieval methods, which typically assume that queries describe observable events, whereas instructional search requires retrieving concrete visual phenomena that instantiate an underlying scientific principle. We study this setting as concept-to-example video retrieval, an abstract-needle-in-a-haystack problem where compact curriculum concepts must be grounded in temporally sparse documentary evidence. To bridge this abstraction gap, we propose Concept-Driven Domain Adaptation (CDDA), a three-stage framework for adapting two-tower vision-language models to concept-level retrieval. CDDA treats concepts as intermediate semantic anchors: it first structures the textual embedding space with textbook and teacher-handbook example-concept pairs, then transfers this concept-aware geometry to documentary visuals under a frozen visual encoder, and finally jointly adapts both encoders with sparse visual concept supervision. From a geometric perspective, this staged alignment reduces text-concept and vision-concept angular gaps, thereby encouraging concept-level adaptation while preserving the pretrained model's concrete image description alignment. On a curated middle-school physics retrieval benchmark, CDDA achieves stronger pedagogically oriented concept retrieval than several competitive multimodal baselines, including Qwen3-VL-Embedding-2B, while maintaining concrete image-text matching after adaptation.