提出新模型平衡跨域一致性和域内区分度,提升持续学习下的人重识别效果。
Domain Consistency Representation Learning for Lifelong Person Re-Identification
- 用全局与属性级表示的互补性增强同类个体区分能力
- 在多个数据集上超越现有最先进方法,显著降低跨域差异
- 适合长期学习场景中需兼顾记忆保持与新知识融合的研究者
持续人重识别(LReID)在持续学习过程中面临域内区分性与跨域差异之间的矛盾:域内区分性关注个体细节(如服饰、配饰等),而跨域一致性强调不同场景下的统一表征。如何在最大化域内区分性的同时最小化跨域差异,是提升性能的关键挑战。现有方法多通过知识蒸馏减少跨域差异,但常忽略域内区分性。为此,我们提出一种新的域一致性表征学习(DCR)模型,利用全局与属性级表示作为桥梁,平衡两者关系。在域内层面,探索全局与属性级表示的互补性以增强相似身份间的区分;为防止过度学习导致灾难性遗忘,设计属性导向的抗遗忘(AF)策略,通过属性级表示强化跨域一致性,并提出知识巩固(KC)策略促进知识迁移。大量实验表明,我们的DCR在多个基准上优于当前最先进的LReID方法。代码已开源:https://github.com/LiuShiBen/DCR。
原文摘要 · Abstract (English)
Lifelong person re-identification (LReID) exhibits a contradictory relationship between intra-domain discrimination and inter-domain gaps when learning from continuous data. Intra-domain discrimination focuses on individual nuances (i.e., clothing type, accessories, etc.), while inter-domain gaps emphasize domain consistency. Achieving a trade-off between maximizing intra-domain discrimination and minimizing inter-domain gaps is a crucial challenge for improving LReID performance. Most existing methods strive to reduce inter-domain gaps through knowledge distillation to maintain domain consistency. However, they often ignore intra-domain discrimination. To address this challenge, we propose a novel domain consistency representation learning (DCR) model that explores global and attribute-wise representations as a bridge to balance intra-domain discrimination and inter-domain gaps. At the intra-domain level, we explore the complementary relationship between global and attribute-wise representations to improve discrimination among similar identities. Excessive learning intra-domain discrimination can lead to catastrophic forgetting. We further develop an attribute-oriented anti-forgetting (AF) strategy that explores attribute-wise representations to enhance inter-domain consistency, and propose a knowledge consolidation (KC) strategy to facilitate knowledge transfer. Extensive experiments show that our DCR achieves superior performance compared to state-of-the-art LReID methods. Our code is available at https://github.com/LiuShiBen/DCR.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。