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

Por um escritor misterioso

Descrição

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

A robust receptive field code for optic flow detection and decomposition during self-motion - ScienceDirect

AI, Free Full-Text

Locality sensitive hashing with bit selection

HYPERSPECTRAL IMAGERY CLASSIFICATION USING TECHNOLOGIES OF COMPUTATIONAL INTELLIGENCE

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

Defect detection in atomic-resolution images via unsupervised learning with translational invariance

John McCalpin's blog

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

PDF) Adaptive Hashing With Sparse Matrix Factorization

de por adulto (o preço varia de acordo com o tamanho do grupo)

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

Sugerir pesquisas

você pode gostar