让冻结的DINO模型学会看双时相图像,高效检测遥感变化。
AdaDINO: Pair-Aware In-Backbone Adaptation of Frozen DINO for Efficient Remote Sensing Change Detection

- 在冻结的DINO主干中加入跨时相交互机制,让模型从编码阶段就感知时间差异。
- 在SYSU-CD数据集上以62.5%更窄的网络宽度,仍达85.29%的F1分数。
- 适合需要高效、高精度遥感变化检测的研究者和应用开发者。
视觉基础模型(如DINO)预训练用于单图表征,而遥感变化检测需对双时相图像进行推理。现有基于VFM的方法通常独立编码两张图后再比较,使主干网络无法感知时序关联。为此,本文提出AdaDINO,一种面向冻结DINO编码器的配对感知式主干适配框架,实现高效变化检测。其核心组件CGLA在选定冻结模块后耦合两路特征,并注入符号相反的共享时序残差,增强真实变化响应同时保持双图中点。BSCS通过保留批次共享的通道块子集,将前馈网络计算量降低62.5%,实现紧凑密集前馈。CPGR解码器复用编码器侧变化响应,完成粗到精预测。在四个遥感变化检测基准上,AdaDINO性能优于或媲美现有基线,尤其在类别无关的SYSU-CD上提升显著。该模型在保持85.29% F1得分的同时,实现1.41倍吞吐速度提升。代码将公开。
原文摘要 · Abstract (English)
Vision foundation models (VFMs) such as DINO are pretrained for single-image representation, whereas remote sensing change detection requires reasoning over a bi-temporal pair. Existing VFM-based methods usually encode the two images independently and compare them only afterward, leaving the VFM backbone unaware of cross-temporal relations. To bridge this mismatch, we present AdaDINO, a pair-aware in-backbone adaptation framework that equips a frozen DINO encoder with bi-temporal interaction for efficient change detection. Its core component, Change-aware Gated Local Adaptation (CGLA), couples the two streams after selected frozen blocks and injects a shared temporal residual into them with opposite signs, enhancing genuine change responses while preserving the pair midpoint. Batch-Shared Chunk Selection (BSCS) further reduces feed-forward network (FFN) computation by retaining a batch-shared subset of channel chunks that can be executed as a compact dense FFN. A CGLA-Prior-Guided Refinement (CPGR) decoder reuses encoder-side change responses for coarse-to-fine prediction. Experiments on four remote sensing change detection benchmarks show that AdaDINO achieves competitive or superior performance against VFM-based baselines, with the largest gain on the category-agnostic SYSU-CD dataset. With 62.5% of the FFN hidden width removed, AdaDINO still achieves an F1 score of 85.29% on SYSU-CD while delivering a 1.41$\times$ throughput speedup. The code will be released.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。