Triplet loss has been widely employed in a wide range of computer vision tasks, including local descriptor learning. The effectiveness of the triplet loss heavily relies on the triplet selection, in which a common practice is to first sample intra-class patches (positives) from the dataset for batch construction and then mine in-batch negatives to form triplets. For high-informativeness triplet collection, researchers mostly focus on mining hard negatives in the second stage, while paying relatively less attention to constructing informative batches. To alleviate this issue, we propose AdaSample, an adaptive online batch sampler, in this paper. Specifically, hard positives are sampled based on their informativeness. In this way, we formulate a hardness-aware positive mining pipeline within a novel maximum loss minimization training protocol. The efficacy of the proposed method is evaluated on several standard benchmarks, where it demonstrates a significant and consistent performance gain on top of the existing strong baselines.
@article{arxiv.1911.12110,
title = {AdaSample: Adaptive Sampling of Hard Positives for Descriptor Learning},
author = {Xin-Yu Zhang and Le Zhang and Zao-Yi Zheng and Yun Liu and Jia-Wang Bian and Ming-Ming Cheng},
journal= {arXiv preprint arXiv:1911.12110},
year = {2019}
}