Locality-sensitive binary codes from shift-invariant kernels
Locality-sensitive binary codes from shift-invariant kernels
复制标题
DOI：
--
复制
发表时间：
2009-12
期刊：
影响因子：
--
通讯作者：
M. Raginsky;Svetlana Lazebnik
中科院分区：
文献类型：
--
作者：
M. Raginsky;Svetlana Lazebnik
本文讨论了为高维数据设计二进制代码的问题，使得在原始空间中相似的向量映射到相似的二进制字符串。我们引入了一种基于随机投影的简单的无分布编码方案，使得两个向量的二进制码之间的预期汉明距离与移位不变核的值相关（例如，高斯核）之间的向量。我们提出了一个完整的理论分析所提出的方案的收敛性能，并报告有利的实验性能相比，最近的国家的最先进的方法，频谱哈希。
This paper addresses the problem of designing binary codes for high-dimensional data such that vectors that are similar in the original space map to similar binary strings. We introduce a simple distribution-free encoding scheme based on random projections, such that the expected Hamming distance between the binary codes of two vectors is related to the value of a shift-invariant kernel (e.g., a Gaussian kernel) between the vectors. We present a full theoretical analysis of the convergence properties of the proposed scheme, and report favorable experimental performance as compared to a recent state-of-the-art method, spectral hashing.