Improving Deep Binary Embedding Networks By Order-aware Reweighting Of Triplets

Abstract

In this paper, we focus on triplet-based deep binary embedding networks for image retrieval task. The triplet loss has been shown to be most effective for the ranking problem. However, most of the previous works treat the triplets equally or select the hard triplets based on the loss. Such strategies do not consider the order relations, which is important for retrieval task. To this end, we propose an order-aware reweighting method to effectively train the triplet-based deep networks, which up-weights the important triplets and down-weights the uninformative triplets. First, we present the order-aware weighting factors to indicate the importance of the triplets, which depend on the rank order of binary codes. Then, we reshape the triplet loss to the squared triplet loss such that the loss function will put more weights on the important triplets. Extensive evaluations on four benchmark datasets show that the proposed method achieves significant performance compared with the state-of-the

Stats

• citations13
• S2 citations—
• github stars0
• HF likes0
• heat score8.60
• arxiv keychen2018improving

Related papers

• Fast Training Of Triplet-based Deep Binary Embedding Networks (2016)14.62
• Deep Triplet Ranking Networks For One-shot Recognition (2018)0.00
• Bayesian Triplet Loss: Uncertainty Quantification In Image Retrieval (2020)11.49
• Improved Embeddings With Easy Positive Triplet Mining (2019)15.06
• Enhancing Remote Sensing Image Retrieval With Triplet Deep Metric Learning Network (2019)14.58
• Learning Embeddings For Product Visual Search With Triplet Loss And Online Sampling (2018)0.00
• Informative And Representative Triplet Selection For Multilabel Remote Sensing Image Retrieval (2021)10.74
• A Quadruplet Loss For Enforcing Semantically Coherent Embeddings In Multi-output Classification Problems (2020)6.77