Sparse ternary codes for similarity search have higher coding gain than dense binary codes.
Sohrab FerdowsiSlava VoloshynovskiyDimche KostadinovTaras HolotyakPublished in: ISIT (2017)
Keyphrases
- binary codes
- similarity search
- coding gain
- high dimensional
- efficient similarity search
- image coding
- distance function
- metric space
- locality sensitive hashing
- hashing methods
- hash functions
- indexing techniques
- query processing
- similarity measure
- coding efficiency
- hamming space
- similarity queries
- high dimensional data
- dimensionality reduction
- hamming distance
- knn
- neural network
- low dimensional
- distance computation
- computational complexity
- sparse representation
- rate distortion
- image features
- multiscale
- decision trees
- image processing
- machine learning