Information and Media Technologies
Online ISSN : 1881-0896
ISSN-L : 1881-0896
Media (processing) and Interaction
Sparse Isotropic Hashing
Ikuro SatoMitsuru AmbaiKoichiro Suzuki
著者情報
ジャーナル フリー

2013 年 8 巻 4 号 p. 1031-1035

詳細
抄録
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.
著者関連情報
© 2013 Information Processing Society of Japan
前の記事 次の記事
feedback
Top