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.

Fixed-length asymmetric binary hashing for fingerprint verification through GMM-SVM based representations - ScienceDirect

PDF] Iterative quantization: A procrustean approach to learning binary codes

Mathematics, Free Full-Text

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

Performance of two complementary machine-learned potentials in modelling chemically complex systems

Lensless inference camera: incoherent object recognition through a thin mask with LBP map generation

Full depth CNN classifier for handwritten and license plate characters recognition [PeerJ]

Invariant Node Representation Learning under Distribution Shifts with Multiple Latent Environments

Convolution neural network with batch normalization and inception-residual modules for Android malware classification

Sensors, Free Full-Text