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

PDF] Kernel diff-hash

PDF] Breaking the waves: asymmetric random periodic features for low-bitrate kernel machines

HDRNet: High‐Dimensional Regression Network for Point Cloud Registration - Gao - 2023 - Computer Graphics Forum - Wiley Online Library

Lensless inference camera: incoherent object recognition through a thin mask with LBP map generation

PDF) A deep locality-sensitive hashing approach for achieving optimal ‎image retrieval satisfaction

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

Mathematics, Free Full-Text

CausalBank

Deep learning in optical metrology: a review

PDF) Unsupervised Ensemble Hashing: Boosting Minimum Hamming Distance

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