PDF] Locality-sensitive binary codes from shift-invariant kernels

This paper introduces 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 between the vectors. 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.

Locality sensitive hashing with bit selection

PDF] Locality-sensitive binary codes from shift-invariant kernels

Remote Sensing, Free Full-Text

PDF] Breaking the waves: asymmetric random periodic features for low-bitrate kernel machines

Resolving Transition Metal Chemical Space: Feature Selection for Machine Learning and Structure–Property Relationships

Population codes enable learning from few examples by shaping inductive bias

Locality sensitive hashing with bit selection

A Complete List of All Adversarial Example Papers

Quadra-Embedding: Binary Code Embedding with Low Quantization Error

A robust receptive field code for optic flow detection and decomposition during self-motion - ScienceDirect