无示例类增量无线电频率指纹识别研究
Study of Class-Incremental Radio Frequency Fingerprint Recognition Without Storing Exemplars
AI总结:
本研究提出一种无需存储示例的类增量学习框架,用于改进无线电频率指纹识别的鲁棒性和存储效率。
摘要:
无线设备的快速普及使稳健的身份认证变得至关重要。无线电频率指纹识别(RFF)利用设备特有的、难以伪造的物理层退化特性进行识别,并在物联网和无人系统中具有应用前景。然而,在实践中,新设备不断加入已部署系统,而每类训练数据有限。传统静态训练和简单重复存储示例是不切实际的,因为类数量增加、存储成本和隐私问题。我们提出了一种无需示例的类增量学习框架,专门针对RFF识别。从预训练的特征提取器开始,在增量阶段冻结骨干网络,并仅训练分类器和轻量级适配模块,这些模块执行小任务特定的特征调整。对于每个类别,我们拟合对角高斯混合模型(GMM)到骨干特征,并从这些拟合分布中采样伪特征来复习过去类别,而无需存储原始信号。为了在少样本条件下提高鲁棒性,我们引入了时域随机遮蔽增强方法,并采用多教师蒸馏方案将阶段式适配器压缩为一个推理适配器,权衡准确性和运行时间效率。我们评估了该方法在大规模自收集的ADS-B数据集上的表现:骨干网络在2175个类别上预训练,增量实验在669个不相交类别上运行,多次轮次和步长。与多个代表性基线相比,我们的方法在平均准确率上更高,遗忘更低,同时存储需求显著减少,并避免了原始数据的保留。所提出的流水线可重复再现,并提供了一种在资源和隐私受限环境中部署RFF的实用、低存储解决方案。
英文摘要:
The rapid proliferation of wireless devices makes robust identity authentication essential. Radio Frequency Fingerprinting (RFF) exploits device-specific, hard-to-forge physical-layer impairments for identification, and is promising for IoT and unmanned systems. In practice, however, new devices continuously join deployed systems while per-class training data are limited. Conventional static training and naive replay of stored exemplars are impractical due to growing class cardinality, storage cost, and privacy concerns. We propose an exemplar-free class-incremental learning framework tailored to RFF recognition. Starting from a pretrained feature extractor, we freeze the backbone during incremental stages and train only a classifier together with lightweight Adapter modules that perform small task-specific feature adjustments. For each class we fit a diagonal Gaussian Mixture Model (GMM) to the backbone features and sample pseudo-features from these fitted distributions to rehearse past classes without storing raw signals. To improve robustness under few-shot conditions we introduce a time-domain random-masking augmentation and adopt a multi-teacher distillation scheme to compress stage-wise Adapters into a single inference Adapter, trading off accuracy and runtime efficiency. We evaluate the method on large, self-collected ADS-B datasets: the backbone is pretrained on 2,175 classes and incremental experiments are run on a disjoint set of 669 classes with multiple rounds and step sizes. Against several representative baselines, our approach consistently yields higher average accuracy and lower forgetting, while using substantially less storage and avoiding raw-data retention. The proposed pipeline is reproducible and provides a practical, low-storage solution for RFF deployment in resource- and privacy-constrained environments.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。