PDF] Locality-sensitive binary codes from shift-invariant kernels
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] Kernel diff-hash
Deep learning in optical metrology: a review
A robust receptive field code for optic flow detection and decomposition during self-motion - ScienceDirect
ICIP2011-ProgramGuide.pdf
Full article: Performance Analysis of Fractional Fourier Domain Beam-Forming Methods for Sensor Arrays
Sensors, Free Full-Text
Lensless inference camera: incoherent object recognition through a thin mask with LBP map generation
PDF) Adaptive Hashing With Sparse Matrix Factorization
ASE 2023 - Tutorials - ASE 2023
PDF] Iterative quantization: A procrustean approach to learning binary codes
PDF] Breaking the waves: asymmetric random periodic features for low-bitrate kernel machines
Drought stress detection technique for wheat crop using machine learning [PeerJ]
PDF] Locality-sensitive binary codes from shift-invariant kernels
de
por adulto (o preço varia de acordo com o tamanho do grupo)