mlsanityData to 7 Oct 2026

HBReID: Harder Batch for Re-identification

arXiv 2112.04761 ↗First posted 9 Dec 2021cs.CVcited by 0

Not on the map. Why?

Abstract (arXiv)

Triplet loss is a widely adopted loss function in ReID task which pulls the hardest positive pairs close and pushes the hardest negative pairs far away. However, the selected samples are not the hardest globally, but the hardest only in a mini-batch, which will affect the performance. In this report, a hard batch mining method is proposed to mine the hardest samples globally to make triplet harder. More specifically, the most similar classes are selected into a same mini-batch so that the similar classes could be pushed further away. Besides, an adversarial scene removal module composed of a scene classifier and an adversarial loss is used to learn scene invariant feature representations. Experiments are conducted on dataset MSMT17 to prove the effectiveness, and our method surpasses all of the previous methods and sets state-of-the-art result.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 28 of its 35 references that are in the map. First posted on arXiv 9 Dec 2021.

Builds on

28 of 35 references.

References · 28

  1. 2015Domain-Adversarial Training of Neural Networkscited by 3,023
  2. 2017Adversarial Discriminative Domain Adaptationcited by 1,309
  3. 2017Random Erasing Data Augmentationcited by 1,235
  4. 2017In Defense of the Triplet Loss for Person Re-Identificationcited by 784
  5. 2017Person Transfer GAN to Bridge Domain Gap for Person Re-Identificationcited by 479
  6. 2021TransReID: Transformer-based Object Re-Identificationcited by 432
  7. 2019Contrastive Adaptation Network for Unsupervised Domain Adaptationcited by 407
  8. 2020Circle Loss: A Unified Perspective of Pair Similarity Optimizationcited by 402
  9. 2019Multi-Similarity Loss with General Pair Weighting for Deep Metric Learningcited by 368
  10. 2016Unsupervised Pixel-Level Domain Adaptation with Generative Adversarial Networkscited by 307
  11. 2017Sampling Matters in Deep Embedding Learningcited by 285
  12. 2017Re-ranking Person Re-identification with k-reciprocal Encodingcited by 260
16 more
  1. 2015Simultaneous Deep Transfer Across Domains and Taskscited by 205
  2. 2020Proxy Anchor Loss for Deep Metric Learningcited by 195
  3. 2016Correlation Alignment for Unsupervised Domain Adaptationcited by 146
  4. 2018Partial Adversarial Domain Adaptationcited by 127
  5. 2019Why Can't I Dance in the Mall? Learning to Mitigate Scene Bias in Action Recognitioncited by 117
  6. 2018An introduction to domain adaptation and transfer learningcited by 112
  7. 2020ProxyNCA++: Revisiting and Revitalizing Proxy Neighborhood Component Analysiscited by 107
  8. 2019Ranked List Loss for Deep Metric Learningcited by 77
  9. 2016Learning Deep Embeddings with Histogram Losscited by 52
  10. 2020The Devil is in the Details: Self-Supervised Attention for Vehicle Re-Identificationcited by 39
  11. 2017Fine-grained Recognition in the Wild: A Multi-Task Domain Adaptation Approachcited by 27
  12. 2021Towards Discriminative Representation Learning for Unsupervised Person Re-identificationcited by 20
  13. 2021FlipReID: Closing the Gap between Training and Inference in Person Re-Identificationcited by 16
  14. 2021A Person Re-identification Data Augmentation Method with Adversarial Defense Effectcited by 13
  15. 2021OH-Former: Omni-Relational High-Order Transformer for Person Re-Identificationcited by 10
  16. 2021Graph Convolution for Re-ranking in Person Re-identificationcited by 6

Built on by

Not cited yet.