Abstract
Unsupervised domain adaptive person re-identification aims to solve the problem of poor performance caused by transferring an unlabeled target domain from the labeled source domain in the re-identification task. The clustering pseudo-labels method in unsupervised learning is widely used in unsupervised adaptive person re-identification tasks, and it maintains state-of-the-art performance. However, pseudo-labels obtained through clustering often have much noise, and the use of a single network model structure and a single clustering algorithm can easily cause model learning to stagnate, making the model not generalizable. To solve this problem, this paper proposes an asymmetric mutual mean-teaching method for unsupervised adaptive person re-identification. In terms of feature extraction, two asymmetric network models with different structures are used for mutual mean-teaching on the target domain, making the features extracted by the network more robust. In terms of feature clustering, two clustering methods are used for mutual teaching to dynamically update the centroid of clusters to improve the confidence of clustering pseudo-labels. Finally, the triplet loss is improved based on the updated cluster centroid to improve the clustering effect. The proposed method is used to perform a large number of verification experiments on three public datasets. The experimental results show that the proposed method has better accuracy than other unsupervised person re-identification based on clustering pseudo-labels.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.