Sparse Isotropic Hashing

スポンサーリンク

概要

• 論文の詳細を見る

• 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.

著者

• Ambai Mitsuru

  Denso It Laboratory Inc.

• Suzuki Koichiro

  Denso IT Laboratory, Inc.

• Sato Ikuro

  Denso IT Laboratory, Inc.

関連論文

• Augmenting Training Samples with a Large Number of Rough Segmentation Datasets
• Dimensionality Reduction for Histogram Features Based on Supervised Non-negative Matrix Factorization
• Distance Computation Between Binary Code and Real Vector for Efficient Keypoint Matching
• Sparse Isotropic Hashing
• Sparse Isotropic Hashing
• Distance Computation Between Binary Code and Real Vector for Efficient Keypoint Matching

スポンサーリンク