Unsupervised Person Re-identification via Softened Similarity Learning

• URL: http://arxiv.org/abs/2004.03547v1
• Date: Tue, 7 Apr 2020 17:16:41 GMT
• Title: Unsupervised Person Re-identification via Softened Similarity Learning
• Authors: Yutian Lin, Lingxi Xie, Yu Wu, Chenggang Yan, Qi Tian
• Abstract summary: Person re-identification (re-ID) is an important topic in computer vision. This paper studies the unsupervised setting of re-ID, which does not require any labeled information. Experiments on two image-based and video-based datasets demonstrate state-of-the-art performance.
• Score: 122.70472387837542
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Person re-identification (re-ID) is an important topic in computer vision. This paper studies the unsupervised setting of re-ID, which does not require any labeled information and thus is freely deployed to new scenarios. There are very few studies under this setting, and one of the best approach till now used iterative clustering and classification, so that unlabeled images are clustered into pseudo classes for a classifier to get trained, and the updated features are used for clustering and so on. This approach suffers two problems, namely, the difficulty of determining the number of clusters, and the hard quantization loss in clustering. In this paper, we follow the iterative training mechanism but discard clustering, since it incurs loss from hard quantization, yet its only product, image-level similarity, can be easily replaced by pairwise computation and a softened classification task. With these improvements, our approach becomes more elegant and is more robust to hyper-parameter changes. Experiments on two image-based and video-based datasets demonstrate state-of-the-art performance under the unsupervised re-ID setting.

Related papers

• Mind Your Clever Neighbours: Unsupervised Person Re-identification via Adaptive Clustering Relationship Modeling [19.532602887109668]
  Unsupervised person re-identification (Re-ID) attracts increasing attention due to its potential to resolve the scalability problem of supervised Re-ID models. Most existing unsupervised methods adopt an iterative clustering mechanism, where the network was trained based on pseudo labels generated by unsupervised clustering. To generate high-quality pseudo-labels and mitigate the impact of clustering errors, we propose a novel clustering relationship modeling framework for unsupervised person Re-ID.
  arXiv  Detail & Related papers  (2021-12-03T10:55:07Z)
• Meta Clustering Learning for Large-scale Unsupervised Person Re-identification [124.54749810371986]
  We propose a "small data for big task" paradigm dubbed Meta Clustering Learning (MCL) MCL only pseudo-labels a subset of the entire unlabeled data via clustering to save computing for the first-phase training. Our method significantly saves computational cost while achieving a comparable or even better performance compared to prior works.
  arXiv  Detail & Related papers  (2021-11-19T04:10:18Z)
• Unsupervised Person Re-identification with Stochastic Training Strategy [29.639040901941726]
  State-of-the-art unsupervised re-ID methods usually follow a clustering-based strategy. Forcing images to get closer to the centroid emphasizes the result of clustering. Previous methods utilize features obtained at different training iterations to represent one centroid. We propose an unsupervised re-ID approach with a learning strategy.
  arXiv  Detail & Related papers  (2021-08-16T07:23:58Z)
• Cluster-guided Asymmetric Contrastive Learning for Unsupervised Person Re-Identification [10.678189926088669]
  Unsupervised person re-identification (Re-ID) aims to match pedestrian images from different camera views in unsupervised setting. Existing methods for unsupervised person Re-ID are usually built upon the pseudo labels from clustering. We propose a Cluster-guided Asymmetric Contrastive Learning (CACL) approach for unsupervised person Re-ID.
  arXiv  Detail & Related papers  (2021-06-15T02:40:22Z)
• You Never Cluster Alone [150.94921340034688]
  We extend the mainstream contrastive learning paradigm to a cluster-level scheme, where all the data subjected to the same cluster contribute to a unified representation. We define a set of categorical variables as clustering assignment confidence, which links the instance-level learning track with the cluster-level one. By reparametrizing the assignment variables, TCC is trained end-to-end, requiring no alternating steps.
  arXiv  Detail & Related papers  (2021-06-03T14:59:59Z)
• Learning from Self-Discrepancy via Multiple Co-teaching for Cross-Domain Person Re-Identification [12.106894735305714]
  We propose a multiple co-teaching framework for domain adaptive person re-ID. Our method achieves competitive performance compared with the state-of-the-arts.
  arXiv  Detail & Related papers  (2021-04-06T03:12:11Z)
• Unsupervised Person Re-identification via Simultaneous Clustering and Consistency Learning [22.008371113710137]
  We design a pretext task for unsupervised re-ID by learning visual consistency from still images and temporal consistency during training process. We optimize the model by grouping the two encoded views into same cluster, thus enhancing the visual consistency between views.
  arXiv  Detail & Related papers  (2021-04-01T02:10:42Z)
• Camera-aware Proxies for Unsupervised Person Re-Identification [60.26031011794513]
  This paper tackles the purely unsupervised person re-identification (Re-ID) problem that requires no annotations. We propose to split each single cluster into multiple proxies and each proxy represents the instances coming from the same camera. Based on the camera-aware proxies, we design both intra- and inter-camera contrastive learning components for our Re-ID model.
  arXiv  Detail & Related papers  (2020-12-19T12:37:04Z)
• Improving Face Recognition by Clustering Unlabeled Faces in the Wild [77.48677160252198]
  We propose a novel identity separation method based on extreme value theory. It greatly reduces the problems caused by overlapping-identity label noise. Experiments on both controlled and real settings demonstrate our method's consistent improvements.
  arXiv  Detail & Related papers  (2020-07-14T12:26:50Z)
• Automatically Discovering and Learning New Visual Categories with Ranking Statistics [145.89790963544314]
  We tackle the problem of discovering novel classes in an image collection given labelled examples of other classes. We learn a general-purpose clustering model and use the latter to identify the new classes in the unlabelled data. We evaluate our approach on standard classification benchmarks and outperform current methods for novel category discovery by a significant margin.
  arXiv  Detail & Related papers  (2020-02-13T18:53:32Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.