arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1603.02844cs.CV
收藏

基于三元组的深度二进制嵌入网络的快速训练

Fast Training of Triplet-based Deep Binary Embedding Networks

The University of Adelaide(阿德莱德大学);Australian Centre for Robotic Vision(澳大利亚机器人视觉中心)

Bohan Zhuang, Guosheng Lin, Chunhua Shen, Ian Reid

摘要:

在本文中,我们的目标是学习一个映射(或嵌入)从图像到一个紧凑的二进制空间,其中汉明距离对应于图像检索任务的排名措施。我们使用三重损失,因为这已被证明是最有效的排名问题。然而,在以前的作品中的训练可能是昂贵的,由于优化是直接在三元组空间上执行的,其中用于训练的可能三元组的数量是训练样本的数量的立方。为了解决这个问题,我们建议将高阶二进制码学习明确地分为两个交错的阶段,将其作为多标签分类问题。为了解决第一阶段,我们设计了一个大规模的高阶二进制码推理算法,以减少高阶目标的一个标准的二进制二次问题,图割可以用来有效地推断二进制码,作为每个训练数据的标签。在第二阶段,我们建议通过精心设计的深度卷积神经网络(CNN)将原始图像映射到紧凑的二进制代码,并且可以通过训练二进制CNN分类器来解决哈希函数拟合。提出了一种增量/交错优化策略,以确保这两个步骤在训练过程中相互交互,以提高精度。我们在几个基准数据集上进行了实验,这些数据集证明了训练时间的改进(多达两个数量级)以及为各种检索任务产生最先进的哈希。

英文摘要:

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 datum. In the second stage we propose to map the original image to compact binary codes via carefully designed deep convolutional neural networks (CNNs) and the hashing function fitting can be solved by training binary CNN classifiers. An incremental/interleaved optimization strategy is proffered to ensure that these two steps are interactive with each other during training for better accuracy. We conduct experiments on several benchmark datasets, which demonstrate both improved training time (by as much as two orders of magnitude) as well as producing state-of-the-art hashing for various retrieval tasks.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑