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.
Fixed-length asymmetric binary hashing for fingerprint verification through GMM-SVM based representations - ScienceDirect
Frontiers BitBrain and Sparse Binary Coincidence (SBC) memories: Fast, robust learning and inference for neuromorphic architectures
Population codes enable learning from few examples by shaping inductive bias
Evaluation of noise robustness for local binary pattern descriptors in texture classification, EURASIP Journal on Image and Video Processing
Full depth CNN classifier for handwritten and license plate characters recognition [PeerJ]
PDF) Drawbacks and Proposed Solutions for Real-time Processing on Existing State-of-the-art Locality Sensitive Hashing Techniques
ICIP2011-ProgramGuide.pdf
A spatiotemporal mechanism of visual attention: Superdiffusive motion and theta oscillations of neural population activity patterns
AI, Free Full-Text
de
por adulto (o preço varia de acordo com o tamanho do grupo)