Annotation Efficient Person Re-Identification with Diverse Cluster-Based Pair Selection

• URL: http://arxiv.org/abs/2203.05395v1
• Date: Thu, 10 Mar 2022 14:37:07 GMT
• Title: Annotation Efficient Person Re-Identification with Diverse Cluster-Based Pair Selection
• Authors: Lantian Xue, Yixiong Zou, Peixi Peng, Yonghong Tian, Tiejun Huang
• Abstract summary: Person Re-identification (Re-ID) has attracted great attention due to its promising real-world applications. It is always costly to annotate the training data to train a Re-ID model, and it still remains challenging to reduce the annotation cost while maintaining the performance for the Re-ID task. We propose the Efficient Person Re-identification method to select image pairs from an alternative pair set according to the fallibility and diversity of pairs, and train the Re-ID model based on the annotation.
• Score: 39.61651209527681
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Person Re-identification (Re-ID) has attracted great attention due to its promising real-world applications. However, in practice, it is always costly to annotate the training data to train a Re-ID model, and it still remains challenging to reduce the annotation cost while maintaining the performance for the Re-ID task. To solve this problem, we propose the Annotation Efficient Person Re-Identification method to select image pairs from an alternative pair set according to the fallibility and diversity of pairs, and train the Re-ID model based on the annotation. Specifically, we design an annotation and training framework to firstly reduce the size of the alternative pair set by clustering all images considering the locality of features, secondly select images pairs from intra-/inter-cluster samples for human to annotate, thirdly re-assign clusters according to the annotation, and finally train the model with the re-assigned clusters. During the pair selection, we seek for valuable pairs according to pairs' fallibility and diversity, which includes an intra-cluster criterion to construct image pairs with the most chaotic samples and the representative samples within clusters, an inter-cluster criterion to construct image pairs between clusters based on the second-order Wasserstein distance, and a diversity criterion for clusterbased pair selection. Combining all criteria above, a greedy strategy is developed to solve the pair selection problem. Finally, the above clustering-selecting-annotating-reassigning-training procedure will be repeated until the annotation budget is reached. Extensive experiments on three widely adopted Re-ID datasets show that we can greatly reduce the annotation cost while achieving better performance compared with state-of-the-art works.

Related papers

• Efficient Bilateral Cross-Modality Cluster Matching for Unsupervised Visible-Infrared Person ReID [56.573905143954015]
  We propose a novel bilateral cluster matching-based learning framework to reduce the modality gap by matching cross-modality clusters. Under such a supervisory signal, a Modality-Specific and Modality-Agnostic (MSMA) contrastive learning framework is proposed to align features jointly at a cluster-level. Experiments on the public SYSU-MM01 and RegDB datasets demonstrate the effectiveness of the proposed method.
  arXiv  Detail & Related papers  (2023-05-22T03:27:46Z)
• Implicit Sample Extension for Unsupervised Person Re-Identification [97.46045935897608]
  Clustering sometimes mixes different true identities together or splits the same identity into two or more sub clusters. We propose an Implicit Sample Extension (OurWholeMethod) method to generate what we call support samples around the cluster boundaries. Experiments demonstrate that the proposed method is effective and achieves state-of-the-art performance for unsupervised person Re-ID.
  arXiv  Detail & Related papers  (2022-04-14T11:41:48Z)
• Hybrid Contrastive Learning with Cluster Ensemble for Unsupervised Person Re-identification [8.345677436382193]
  We propose a Hybrid Contrastive Learning (HCL) approach for unsupervised person ReID. We also present a Multi-Granularity Clustering Ensemble based Hybrid Contrastive Learning (MGCE-HCL) approach.
  arXiv  Detail & Related papers  (2022-01-28T09:15:20Z)
• 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)
• Clustering by Maximizing Mutual Information Across Views [62.21716612888669]
  We propose a novel framework for image clustering that incorporates joint representation learning and clustering. Our method significantly outperforms state-of-the-art single-stage clustering methods across a variety of image datasets.
  arXiv  Detail & Related papers  (2021-07-24T15:36:49Z)
• 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)
• Graph Contrastive Clustering [131.67881457114316]
  We propose a novel graph contrastive learning framework, which is then applied to the clustering task and we come up with the Graph Constrastive Clustering(GCC) method. Specifically, on the one hand, the graph Laplacian based contrastive loss is proposed to learn more discriminative and clustering-friendly features. On the other hand, a novel graph-based contrastive learning strategy is proposed to learn more compact clustering assignments.
  arXiv  Detail & Related papers  (2021-04-03T15:32:49Z)
• 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)
• Unsupervised Person Re-identification via Softened Similarity Learning [122.70472387837542]
  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.
  arXiv  Detail & Related papers  (2020-04-07T17:16:41Z)

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.