Lower bounds on almost-separating binary codes.
José MoreiraGrigory KabatianskyMarcel FernandezPublished in: WIFS (2011)
Keyphrases
- binary codes
- lower bound
- hamming distance
- upper bound
- efficient similarity search
- hamming space
- similarity search
- objective function
- locality sensitive hashing
- hash functions
- optimal solution
- locality sensitive
- image collections
- high dimensional data
- low dimensional
- image understanding
- pattern matching
- machine learning
- multi dimensional
- data points
- high dimensional
- pairwise
- similarity measure