Threshold-Based Hierarchical Clustering for Person Re-Identification

• Main Authors: Minhui Hu, Kaiwei Zeng, Yaohua Wang, Yang Guo
• Format: Article
• Language: English
• Published: MDPI AG 2021-04-01
• Series: Entropy
• Subjects: person re-identification; threshold-based hierarchical clustering; unsupervised domain adaptation; fully unsupervised method
• Online Access: https://www.mdpi.com/1099-4300/23/5/522

Unsupervised domain adaptation is a challenging task in person re-identification (re-ID). Recently, cluster-based methods achieve good performance; clustering and training are two important phases in these methods. For clustering, one major issue of existing methods is that they do not fully exploit the information in outliers by either discarding outliers in clusters or simply merging outliers. For training, existing methods only use source features for pretraining and target features for fine-tuning and do not make full use of all valuable information in source datasets and target datasets. To solve these problems, we propose a <b>T</b>hreshold-based <b>H</b>ierarchical clustering method with <b>C</b>ontrastive loss (THC). There are two features of THC: (1) it regards outliers as single-sample clusters to participate in training. It well preserves the information in outliers without setting cluster number and combines advantages of existing clustering methods; (2) it uses contrastive loss to make full use of all valuable information, including source-class centroids, target-cluster centroids and single-sample clusters, thus achieving better performance. We conduct extensive experiments on Market-1501, DukeMTMC-reID and MSMT17. Results show our method achieves state of the art.