Fast Training Of Triplet-based Deep Binary Embedding Networks

Abstract

In this paper, we aim to learn a mapping (or embedding) from images to a compact binary space in which Hamming distances correspond to a ranking measure for the image retrieval task. We make use of a triplet loss because this has been shown to be most effective for ranking problems. However, training in previous works can be prohibitively expensive due to the fact that optimization is directly performed on the triplet space, where the number of possible triplets for training is cubic in the number of training examples. To address this issue, we propose to formulate high-order binary codes learning as a multi-label classification problem by explicitly separating learning into two interleaved stages. To solve the first stage, we design a large-scale high-order binary codes inference algorithm to reduce the high-order objective to a standard binary quadratic problem such that graph cuts can be used to efficiently infer the binary code which serve as the label of each training datu

Stats

• citations88
• S2 citations—
• github stars0
• HF likes0
• heat score14.62
• arxiv keyzhuang2016fast

Related papers

• Improving Deep Binary Embedding Networks By Order-aware Reweighting Of Triplets (2018)8.60
• Compact Hash Code Learning With Binary Deep Neural Network (2017)9.03
• Deep Triplet Ranking Networks For One-shot Recognition (2018)0.00
• A Quadruplet Loss For Enforcing Semantically Coherent Embeddings In Multi-output Classification Problems (2020)6.77
• Binary Constrained Deep Hashing Network For Image Retrieval Without Manual Annotation (2018)5.84
• Improved Embeddings With Easy Positive Triplet Mining (2019)15.06
• Enhancing Remote Sensing Image Retrieval With Triplet Deep Metric Learning Network (2019)14.58
• Two-stage Triplet Loss Training With Curriculum Augmentation For Audio-visual Retrieval (2023)0.00