将陨石坑分析转为实例级检索,提升行星尺度科研效率
CraterBench-R: Instance-Level Crater Retrieval for Planetary Scale

- 将陨石坑识别视为实例检索问题,构建多尺度高质量数据集
- 自监督ViT模型在行星尺度检索中表现最优,小模型胜过大模型
- 提出无需训练的聚类聚合方法,存储量减少90%仍保持高精度
撞击坑是行星表面分析的核心。尽管多数深度学习流程仅将其视为检测任务,但科学工作流中的目录去重、跨观测匹配和形态学类比发现本质上是检索问题。为此,我们提出将陨石坑分析建模为实例级图像检索,并构建了CraterBench-R基准数据集,包含约2.5万个人工验证的陨石坑实例,涵盖多尺度图库视图与多样化场景查询。基线评估显示,经过领域内预训练的自监督视觉变换器(ViTs)显著优于通用大模型。进一步发现,保留多个ViT块令牌进行后期交互匹配可大幅提升准确率,但全量存储不具可扩展性。为此提出实例令牌聚合:选取K个种子令牌,按余弦相似度分配其余令牌并聚合成代表向量。当K=16时,该方法相比原始令牌选择提升mAP 17.9点;当K=64时,仅用少量存储即可达到使用全部196个令牌的精度。最后证明,两阶段流水线(单向量粗筛+实例令牌重排序)仅搜索小候选集,即可恢复89-94%的全晚交互精度。数据集已公开于hf.co/datasets/jfang/CraterBench-R。
原文摘要 · Abstract (English)
Impact craters are a cornerstone of planetary surface analysis. However, while most deep learning pipelines treat craters solely as a detection problem, critical scientific workflows such as catalog deduplication, cross-observation matching, and morphological analog discovery are inherently retrieval tasks. To address this, we formulate crater analysis as an instance-level image retrieval problem and introduce CraterBench-R, a curated benchmark featuring about 25,000 crater identities with multi-scale gallery views and manually verified queries spanning diverse scales and contexts. Our baseline evaluations across various architectures reveal that self-supervised Vision Transformers (ViTs), particularly those with in-domain pretraining, dominate the task, outperforming generic models with significantly more parameters. Furthermore, we demonstrate that retaining multiple ViT patch tokens for late-interaction matching dramatically improves accuracy over standard single-vector pooling. However, storing all tokens per image is operationally inefficient at a planetary scale. To close this efficiency gap, we propose instance-token aggregation, a scalable, training-free method that selects K seed tokens, assigns the remaining tokens to these seeds via cosine similarity, and aggregates each cluster into a single representative token. This approach yields substantial gains: at K=16, aggregation improves mAP by 17.9 points over raw token selection, and at K=64, it matches the accuracy of using all 196 tokens with significantly less storage. Finally, we demonstrate that a practical two-stage pipeline, with single-vector shortlisting followed by instance-token reranking, recovers 89-94% of the full late-interaction accuracy while searching only a small candidate set. The benchmark is publicly available at hf.co/datasets/jfang/CraterBench-R.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。