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

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

PDF] Kernel diff-hash

NeuronMotif: Deciphering cis-regulatory codes by layer-wise demixing of deep neural networks

Locality sensitive hashing with bit selection

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

Locality sensitive hashing with bit selection

Frontiers BitBrain and Sparse Binary Coincidence (SBC) memories: Fast, robust learning and inference for neuromorphic architectures

Neighbourhood Preserving Quantisation for LSH SIGIR Poster

PDF) Graph PCA Hashing for Similarity Search (2017), Xiaofeng Zhu

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

References - Sampling Theory

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