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.

Kernel locality‐constrained sparse coding for head pose estimation - Kim - 2016 - IET Computer Vision - Wiley Online Library

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

Remote Sensing, Free Full-Text

Locality sensitive hashing with bit selection

Let's do the time-warp-attend: Learning topological invariants of dynamical systems – arXiv Vanity

Charting Nanocluster Structures via Convolutional Neural Networks

Population codes enable learning from few examples by shaping inductive bias

EC 624 Digital Image Processing (3 0 2 8) Class I Introduction

PDF) Drawbacks and Proposed Solutions for Real-time Processing on Existing State-of-the-art Locality Sensitive Hashing Techniques

Artificial neural network - Wikipedia

Frontiers Quantitative approaches for decoding the specificity of the human T cell repertoire

Sensors, Free Full-Text