Plug-and-Play Pseudo Label Correction Network for Unsupervised Person Re-identification
Not on the map. Why?
Abstract (arXiv)
Clustering-based methods, which alternate between the generation of pseudo labels and the optimization of the feature extraction network, play a dominant role in both unsupervised learning (USL) and unsupervised domain adaptive (UDA) person re-identification (Re-ID). To alleviate the adverse effect of noisy pseudo labels, the existing methods either abandon unreliable labels or refine the pseudo labels via mutual learning or label propagation. However, a great many erroneous labels are still accumulated because these methods mostly adopt traditional unsupervised clustering algorithms which rely on certain assumptions on data distribution and fail to capture the distribution of complex real-world data. In this paper, we propose the plug-and-play graph-based pseudo label correction network (GLC) to refine the pseudo labels in the manner of supervised clustering. GLC is trained to perceive the varying data distribution at each epoch of the self-training with the supervision of initial pseudo labels generated by any clustering method. It can learn to rectify the initial noisy labels by means of the relationship constraints between samples on the k Nearest Neighbor (kNN) graph and early-stop training strategy. Specifically, GLC learns to aggregate node features from neighbors and predict whether the nodes should be linked on the graph. Besides, GLC is optimized with 'early stop' before the noisy labels are severely memorized to prevent overfitting to noisy pseudo labels. Consequently, GLC improves the quality of pseudo labels though the supervision signals contain some noise, leading to better Re-ID performance. Extensive experiments in USL and UDA person Re-ID on Market-1501 and MSMT17 show that our method is widely compatible with various clustering-based methods and promotes the state-of-the-art performance consistently.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 22 of its 32 references that are in the map. First posted on arXiv 14 Jun 2022.
Builds on
22 of 32 references.
References · 22
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
- 2017Inductive Representation Learning on Large Graphscited by 6,284
- 2019DeepGCNs: Can GCNs Go as Deep as CNNs?cited by 527
- 2017Person Transfer GAN to Bridge Domain Gap for Person Re-Identificationcited by 479
- 2020Early-Learning Regularization Prevents Memorization of Noisy Labelscited by 414
- 2020Mutual Mean-Teaching: Pseudo Label Refinery for Unsupervised Domain Adaptation on Person Re-identificationcited by 214
- 2020Self-paced Contrastive Learning with Hybrid Memory for Domain Adaptive Object Re-IDcited by 212
- 2019Graph Convolutional Label Noise Cleaner: Train a Plug-and-play Action Classifier for Anomaly Detectioncited by 171
- 2021ICE: Inter-instance Contrastive Encoding for Unsupervised Person Re-identificationcited by 69
- 2020Camera-aware Proxies for Unsupervised Person Re-Identificationcited by 59
- 2021Group-aware Label Transfer for Domain Adaptive Person Re-identificationcited by 58
- 2019Linkage Based Face Clustering via Graph Convolution Networkcited by 55
10 more
- 2021Intra-Inter Camera Similarity for Unsupervised Person Re-Identificationcited by 52
- 2021IDM: An Intermediate Domain Module for Domain Adaptive Person Re-IDcited by 51
- 2020Exploiting Sample Uncertainty for Domain Adaptive Person Re-Identificationcited by 50
- 2020Learning to Cluster Faces via Confidence and Connectivity Estimationcited by 42
- 2019Asymmetric Co-Teaching for Unsupervised Cross Domain Person Re-Identificationcited by 36
- 2021Structure-Aware Face Clustering on a Large-Scale Graph with bf107 Nodescited by 21
- 2021Towards Discriminative Representation Learning for Unsupervised Person Re-identificationcited by 20
- 2021Uncertainty-aware Clustering for Unsupervised Domain Adaptive Object Re-identificationcited by 15
- 2021MGH: Metadata Guided Hypergraph Modeling for Unsupervised Person Re-identificationcited by 9
- 2020Learn to Propagate Reliably on Noisy Affinity Graphscited by 4
Built on by
Citing papers per year: 2024: 1; 2025: 1.
2 papers.