文章基本信息

标题：Sparse Isotropic Hashing
本地全文：下载
作者：Ikuro Sato ; Mitsuru Ambai ; Koichiro Suzuki 等
期刊名称：Information and Media Technologies
电子版ISSN：1881-0896
出版年度：2013
卷号：8
期号：4
页码：1031-1035
DOI：10.11185/imt.8.1031
出版社：Information and Media Technologies Editorial Board
摘要：This paper address the problem of binary coding of real vectors for efficient similarity computations. It has been argued that orthogonal transformation of center-subtracted vectors followed by sign function produces binary codes which well preserve similarities in the original space, especially when orthogonally transformed vectors have covariance matrix with equal diagonal elements. We propose a simple hashing algorithm that can orthogonally transform an arbitrary covariance matrix to the one with equal diagonal elements. We further expand this method to make the projection matrix sparse, which yield faster coding. It is demonstrated that proposed methods have comparable level of similarity preservation to the existing methods.
关键词：binary codes;nearest neighbor search;local descriptors;sparse matrix