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.

Artificial neural network - Wikipedia

Sensors, Free Full-Text

Full article: Performance Analysis of Fractional Fourier Domain Beam-Forming Methods for Sensor Arrays

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

Application-Driven Near-Data Processing for Similarity Search – arXiv Vanity

Deep learning applications in single-cell omics data analysis

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

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

PDF] Angular Quantization-based Binary Codes for Fast Similarity Search

ICIP2011-ProgramGuide.pdf

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