Construct Informative Triplet with Two-stage Hard-sample Generation
Not on the map. Why?
Abstract (arXiv)
In this paper, we propose a robust sample generation scheme to construct informative triplets. The proposed hard sample generation is a two-stage synthesis framework that produces hard samples through effective positive and negative sample generators in two stages, respectively. The first stage stretches the anchor-positive pairs with piecewise linear manipulation and enhances the quality of generated samples by skillfully designing a conditional generative adversarial network to lower the risk of mode collapse. The second stage utilizes an adaptive reverse metric constraint to generate the final hard samples. Extensive experiments on several benchmark datasets verify that our method achieves superior performance than the existing hard-sample generation algorithms. Besides, we also find that our proposed hard sample generation method combining the existing triplet mining strategies can further boost the deep metric learning performance.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 28 of its 44 references that are in the map. First posted on arXiv 4 Dec 2021.
Builds on
28 of 44 references.
References · 28
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2014ImageNet Large Scale Visual Recognition Challengecited by 8,441
- 2014Going Deeper with Convolutionscited by 4,231
- 2015FaceNet: A Unified Embedding for Face Recognition and Clusteringcited by 2,833
- 2014Conditional Generative Adversarial Netscited by 2,152
- 2016Understanding deep learning requires rethinking generalizationcited by 1,657
- 2015NetVLAD: CNN architecture for weakly supervised place recognitioncited by 935
- 2017In Defense of the Triplet Loss for Person Re-Identificationcited by 784
- 2017Fine-tuning CNN Image Retrieval with No Human Annotationcited by 497
- 2015Deep Metric Learning via Lifted Structured Feature Embeddingcited by 449
- 2014Deep metric learning using Triplet networkcited by 421
- 2017Sampling Matters in Deep Embedding Learningcited by 285
16 more
- 2018Revisiting Oxford and Paris: Large-Scale Image Retrieval Benchmarkingcited by 189
- 2017Beyond triplet loss: a deep quadruplet network for person re-identificationcited by 172
- 2015Particular object retrieval with integral max-pooling of CNN activationscited by 160
- 2018Deep Metric Learning with Hierarchical Triplet Losscited by 112
- 2020Revisiting Training Strategies and Generalization Performance in Deep Metric Learningcited by 99
- 2015Aggregating Deep Convolutional Features for Image Retrievalcited by 63
- 2016CNN Image Retrieval Learns from BoW: Unsupervised Fine-Tuning with Hard Examplescited by 58
- 2019Hardness-Aware Deep Metric Learningcited by 55
- 2016Hard-Aware Deeply Cascaded Embeddingcited by 44
- 2019Signal-to-Noise Ratio: A Robust Distance Metric for Deep Metric Learningcited by 32
- 2020Embedding Expansion: Augmentation in Embedding Space for Deep Metric Learningcited by 27
- 2015Fine-grained Categorization and Dataset Bootstrapping using Deep Metric Learning with Humans in the Loopcited by 25
- 2014Factors of Transferability for a Generic ConvNet Representationcited by 14
- 2020Symmetrical Synthesis for Deep Metric Learningcited by 14
- 2018Hard-Aware Point-to-Set Deep Metric for Person Re-identificationcited by 12
- 2019Mode Collapse and Regularity of Optimal Transportation Mapscited by 5
Built on by
Citing papers per year: 2022: 1; 2023: 0; 2024: 1.
2 papers.