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.

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

Locality-sensitive binary codes from shift-invariant kernels

Methods and tools for causal discovery and causal inference - Nogueira - 2022 - WIREs Data Mining and Knowledge Discovery - Wiley Online Library

Remote Sensing, Free Full-Text

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

Charting Nanocluster Structures via Convolutional Neural Networks

Locality sensitive hashing with bit selection

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

ASE 2023 - Tutorials - ASE 2023

Invariant Node Representation Learning under Distribution Shifts with Multiple Latent Environments

Neighbourhood Preserving Quantisation for LSH SIGIR Poster

A spatiotemporal mechanism of visual attention: Superdiffusive motion and theta oscillations of neural population activity patterns

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

PDF) A deep locality-sensitive hashing approach for achieving optimal ‎image retrieval satisfaction

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