Abstract

The current unsupervised domain adaptation person re-identification (re-ID) method aims to solve the domain shift problem and applies prior knowledge learned from labelled data in the source domain to unlabelled data in the target domain for person re-ID. At present, the unsupervised domain adaptation person re-ID method based on pseudolabels has obtained state-of-the-art performance. This method obtains pseudolabels via a clustering algorithm and uses these pseudolabels to optimize a CNN model. Although it achieves optimal performance, the model cannot be further optimized due to the existence of noisy labels in the clustering process. In this paper, we propose a stable median centre clustering (SMCC) for the unsupervised domain adaptation person re-ID method. SMCC adaptively mines credible samples for optimization purposes and reduces the impact of label noise and outliers on training to improve the performance of the resulting model. In particular, we use the intracluster distance confidence measure of the sample and its K-reciprocal nearest neighbour cluster proportion in the clustering process to select credible samples and assign different weights according to the intracluster sample distance confidence of samples to measure the distances between different clusters, thereby making the clustering results more robust. The experiments show that our SMCC method can select credible and stable samples for training and improve performance of the unsupervised domain adaptation model. Our code is available at https://github.com/sunburst792/SMCC-method/tree/master.

Highlights

  • Person re-identification is an image retrieval task based on a given image of a person to identify the person in other images captured by different cameras [1, 2]

  • We propose a stable median centre clustering (SMCC) method to reduce the damage caused by potential label noise to the model and obtain more stable clustering results to ensure the accuracy of pseudolabel assignment

  • (1) We propose a stable median centre clustering (SMCC) method for unsupervised domain adaptation person re-ID, which uses the intracluster distances of samples and the cluster proportion of the K-reciprocal nearest samples as the criteria for obtaining credible samples

Read more

Summary

Introduction

Person re-identification (re-ID) is an image retrieval task based on a given image of a person to identify the person in other images captured by different cameras [1, 2]. Erefore, only by selecting credible samples can we reduce the amplification of label noise during the training process and effectively apply to person re-ID tasks in different datasets. To solve these problems, we propose a stable median centre clustering (SMCC) method to reduce the damage caused by potential label noise to the model and obtain more stable clustering results to ensure the accuracy of pseudolabel assignment. (1) We propose a stable median centre clustering (SMCC) method for unsupervised domain adaptation person re-ID, which uses the intracluster distances of samples and the cluster proportion of the K-reciprocal nearest samples as the criteria for obtaining credible samples. Our contributions are summarized as follows. (1) We propose a stable median centre clustering (SMCC) method for unsupervised domain adaptation person re-ID, which uses the intracluster distances of samples and the cluster proportion of the K-reciprocal nearest samples as the criteria for obtaining credible samples. (2) We design a credibility ranking list for the samples in a cluster according to the intracluster distance and assign different weights to the sample points according to the ranking order for intercluster distance calculation. (3) Our experiments prove the superiority of our SMCC method, which achieves state-of-the-art performance on two popular person re-ID datasets, Market1501 [24] and DukeMTMC-ReID [25, 26]

Related Work
Proposed Method
Experiment
Method
Findings
Conclusions
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.