Sparse Ternary Codes for similarity search have higher coding gain than dense binary codes.
Sohrab FerdowsiSlava VoloshynovskiyDimche KostadinovTaras HolotyakPublished in: CoRR (2017)
Keyphrases
- binary codes
- similarity search
- coding gain
- high dimensional
- efficient similarity search
- image coding
- distance function
- metric space
- locality sensitive hashing
- similarity measure
- query processing
- hash functions
- high dimensional data
- knn
- hashing methods
- indexing techniques
- coding efficiency
- hamming space
- similarity queries
- nearest neighbor search
- sparse representation
- low dimensional
- computational complexity
- training data
- dimensionality reduction