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] Breaking the waves: asymmetric random periodic features for low-bitrate kernel machines
NeuronMotif: Deciphering cis-regulatory codes by layer-wise demixing of deep neural networks
PDF] Kernel diff-hash
Let's do the time-warp-attend: Learning topological invariants of dynamical systems – arXiv Vanity
HYPERSPECTRAL IMAGERY CLASSIFICATION USING TECHNOLOGIES OF COMPUTATIONAL INTELLIGENCE
Kernel locality‐constrained sparse coding for head pose estimation - Kim - 2016 - IET Computer Vision - Wiley Online Library
Locality-sensitive binary codes from shift-invariant kernels
PDF) Unsupervised Ensemble Hashing: Boosting Minimum Hamming Distance
PDF] Angular Quantization-based Binary Codes for Fast Similarity Search
Machine learning methods for sign language recognition: A critical review and analysis - ScienceDirect
Evaluation of noise robustness for local binary pattern descriptors in texture classification, EURASIP Journal on Image and Video Processing
de
por adulto (o preço varia de acordo com o tamanho do grupo)