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

基于学习的散列算法的两步通用方法

A General Two-Step Approach to Learning-Based Hashing

University of Adelaide(阿德莱德大学)

Guosheng Lin, Chunhua Shen, David Suter, Anton van den Hengel

摘要:

大多数现有的散列方法应用单一形式的散列函数,以及通常与这种特定形式深度耦合的优化过程。这种紧密耦合限制了方法响应数据的灵活性,并可能导致难以解决的复杂优化问题。在这里,我们提出了一个灵活而简单的框架,能够适应不同类型的损失函数和哈希函数。该框架允许将许多现有的散列方法置于上下文中,并简化了新的特定于问题的散列方法的开发。我们的框架将哈希学习问题分解为两个步骤:哈希位学习和基于学习位的哈希函数学习。第一步通常可以用公式表示为二进制二次问题,第二步可以通过训练标准的二进制分类器来完成。这两个问题在文献中都得到了广泛的研究。我们广泛的实验表明,该框架是有效的,灵活的,优于国家的最先进的。

英文摘要:

Most existing approaches to hashing apply a single form of hash function, and an optimization process which is typically deeply coupled to this specific form. This tight coupling restricts the flexibility of the method to respond to the data, and can result in complex optimization problems that are difficult to solve. Here we propose a flexible yet simple framework that is able to accommodate different types of loss functions and hash functions. This framework allows a number of existing approaches to hashing to be placed in context, and simplifies the development of new problem-specific hashing methods. Our framework decomposes hashing learning problem into two steps: hash bit learning and hash function learning based on the learned bits. The first step can typically be formulated as binary quadratic problems, and the second step can be accomplished by training standard binary classifiers. Both problems have been extensively studied in the literature. Our extensive experiments demonstrate that the proposed framework is effective, flexible and outperforms the state-of-the-art.

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

↑