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.

Group sparse based locality – sensitive dictionary learning for video semantic analysis

Current progress and open challenges for applying deep learning across the biosciences

Population codes enable learning from few examples by shaping inductive bias

Remote Sensing, Free Full-Text

Machine learning methods for sign language recognition: A critical review and analysis - ScienceDirect

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

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

Evaluation of noise robustness for local binary pattern descriptors in texture classification – topic of research paper in Medical engineering. Download scholarly article PDF and read for free on CyberLeninka open science

References - Sampling Theory

Neighbourhood Preserving Quantisation for LSH SIGIR Poster

John McCalpin's blog