跳到正文
研踪PaperTrail

论文库

检索计算机领域论文,按研究方向、作者或关键词筛选。

部分采集异常
正在读取账号与研究记录…

全站更新概况

+0新增论文
+0其中 AI 相关
+0已有论文修订
+93新增 AI 导读

arXiv 最近完成扫描:2026-11-16 01:34 · 全站最近入库:2026-11-14 15:09各信源进度 →

统计口径与数据新鲜度

统计 2026-11-15 08:18 — 2026-11-16 08:18(北京时间) · 点击数字查看对应简报;AI 相关包含在新增论文内。

最近完成检查:2026-11-16 01:34最近发现新增版本:2026-11-14 15:09库内论文最新更新时间:2026-11-13 02:59

每分钟刷新已保存的数据。空检查不代表采集异常;新收录可能包含历史论文。AI 导读按新增版本计数。

23,348 已收录论文19,580 AI 相关6,729 有修订112 HF 社区发现

浏览论文库

时间范围跟随排序:版本更新、本站收录或首次发表。最新收录可能包含历史论文。部分信源异常,查看状态 →

找到 3 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-16 01:33(北京时间)
版本更新 · v2arXiv:2610.24462

O-SCD++: Replay-Free Online Scene Change Detection via Recursive Evidence Fusion

Chamuditha Jayanga Galappaththige, Jason Lai, Lloyd Windrim, Timothy Patten, Donald G. Dansereau, Niko Suenderhauf, Dimity Miller

原文摘要

Online scene change detection requires an autonomous agent to detect what has changed in a previously mapped environment while it is still on site, observing from unconstrained viewpoints and without access to future observations. This causal setting is strictly harder than offline detection, and online methods have long trailed offline accuracy. Our earlier method, O-SCD, closed that gap at over 10 frames per second, but its multi-view fusion is an iterative optimization that refits a change field over a 3D Gaussian splatting map of the reference scene to all past observations at every frame. This step consumes over half of the per-frame budget and forces accuracy to be traded against speed. We present O-SCD++, a replay-free formulation that eliminates this trade-off. Because the reference map stays fixed, rendering the change field is a linear operation. Each new observation can therefore be carried onto the map's Gaussians by a single backward pass of the renderer and fused by a two-scalar recursion per Gaussian. Past observations are never stored or revisited. O-SCD++ also makes the change/no-change decision without labels or iterative optimization. It sets each frame's threshold to the exact minimizer of O-SCD's self-supervised objective over threshold masks, using one sort, and the distance to this threshold gives a per-pixel decision margin that predicts errors. On PASLCD, O-SCD++ improves change detection accuracy (mIoU) from $0.489$ to $0.575$ and throughput from $11.8$ to $25.6$ frames per second, exceeding O-SCD's offline result while remaining causal.

cs.CV

版本更新 · v2arXiv:2610.39416

Decoding Geometry, Not Tokens: Efficient VLMs for Robot Affordance and Trajectory Prediction

Akila Ayanthi, Darshana Priyasad, Tharindu Fernando, Dimity Miller, Sridha Sridharan, Clinton Fookes, Peyman Moghadam

原文摘要

Predicting where to grasp and how to move is fundamentally a geometry problem. Vision-language models treat it as language generation instead. They tokenize spatial coordinates into text and decode them autoregressively. This mechanism ignores spatial structure and truncates continuous precision. Errors compound across coordinate tokens during decoding. In this paper, we show that compact off-the-shelf VLMs with 0.5-2B parameters already encode rich spatial information in their intermediate hidden states. Autoregressive decoding is the dominant bottleneck for trajectory prediction, while affordance prediction depends additionally on feature depth and decoder architecture. We expose the latent spatial information with a lightweight, geometry-compatible prediction head that attaches to a frozen backbone. It reads features from an intermediate hidden layer, conditions a learned query on the task instruction and refines it via cross-attention over the visual tokens to regress affordance boxes and trajectory waypoints directly as continuous values, without modifying the backbone. We evaluate on ShareRobot-Bench and AGD20K. Our 2B variant reduces trajectory error by over 60% and improves ShareRobot-Bench affordance mAP by 85% relative to the autoregressive baseline. It approaches RoboBrain on trajectory prediction (0.251 vs 0.191 DFD) at 3.8x higher throughput. These results demonstrate a favorable accuracy-efficiency trade-off for instruction-conditioned 2D geometric prediction.

cs.RO · cs.CV

版本更新 · v2arXiv:2607.10575

Why Domain Matters: Domain-Aware Benchmarking of Underwater Object Detection and Annotation Quality

Melanie Wille, Dimity Miller, Tobias Fischer, Scarlett Raine

原文摘要

Underwater object detection is strongly affected by domain shift, where performance can vary significantly across different locations, habitats, and deployment conditions. However, detector performance is typically evaluated using aggregate metrics that hide failures in specific environments, while existing domain generalization benchmarks often rely on synthetic variations that do not reflect real-world conditions. To address these limitations we introduce a framework that characterizes underwater images by appearance, scene composition, and acquisition geometry to assign domain labels. Using this framework, we perform the first systematic study of how domain factors influence both human annotation quality in underwater object detection datasets and deep learning-based detector performance, revealing substantial domain-dependent discrepancies. By incorporating physically meaningful domain labels, domain shift becomes something we can characterize, measure, benchmark, and act on. We highlight how our framework can be used to guide data collection and annotation, design more informative benchmarks, and assess detector robustness across diverse underwater environments.

cs.CV