提出新框架,让模型更新时无需重索引旧图库,避免遗忘且保持检索兼容性。
Bi-C2R: Bidirectional Continual Compatible Representation for Re-indexing Free Lifelong Person Re-identification
- 双向持续学习框架,动态适配新旧特征表示以实现兼容
- 在无重索引条件下,性能超越传统方法,关键指标提升显著
- 适合隐私敏感、数据量大的长期身份识别场景
长期行人重识别(L-ReID)通过连续学习新数据来持续更新模型,核心挑战是避免对旧知识的灾难性遗忘。现有方法需在每次更新后重新提取所有历史图库特征进行推理,即“重索引”,但因数据隐私与大规模重提取成本高,难以实施。这导致更新后查询特征与旧图库特征不兼容,严重损害识别性能。为此,本文提出“免重索引长期行人重识别”(RFL-ReID)新任务,要求在不重索引历史图库的前提下完成持续学习。为此,我们设计了双向持续兼容表征(Bi-C2R)框架,持续更新旧模型生成的图库特征,实现高效且兼容的持续学习。通过理论分析与多基准测试验证,该方法在引入的RFL-ReID任务和传统L-ReID任务上均达到领先性能。
原文摘要 · Abstract (English)
Lifelong person Re-IDentification (L-ReID) exploits sequentially collected data to continuously train and update a ReID model, focusing on the overall performance of all data. Its main challenge is to avoid the catastrophic forgetting problem of old knowledge while training on new data. Existing L-ReID methods typically re-extract new features for all historical gallery images for inference after each update, known as "re-indexing". However, historical gallery data typically suffers from direct saving due to the data privacy issue and the high re-indexing costs for large-scale gallery images. As a result, it inevitably leads to incompatible retrieval between query features extracted by the updated model and gallery features extracted by those before the update, greatly impairing the re-identification performance. To tackle the above issue, this paper focuses on a new task called Re-index Free Lifelong person Re-IDentification (RFL-ReID), which requires performing lifelong person re-identification without re-indexing historical gallery images. Therefore, RFL-ReID is more challenging than L-ReID, requiring continuous learning and balancing new and old knowledge in diverse streaming data, and making the features output by the new and old models compatible with each other. To this end, we propose a Bidirectional Continuous Compatible Representation (Bi-C2R) framework to continuously update the gallery features extracted by the old model to perform efficient L-ReID in a compatible manner. We verify our proposed Bi-C2R method through theoretical analysis and extensive experiments on multiple benchmarks, which demonstrate that the proposed method can achieve leading performance on both the introduced RFL-ReID task and the traditional L-ReID task.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。