New Lower Bounds on Aperiodic Crosscorrelation of Binary Codes.
Vladimir I. LevenshteinPublished in: IEEE Trans. Inf. Theory (1999)
Keyphrases
- binary codes
- lower bound
- hamming distance
- upper bound
- similarity search
- efficient similarity search
- hamming space
- locality sensitive hashing
- hash functions
- optimal solution
- objective function
- visual descriptors
- image collections
- low dimensional
- hyperplane
- image set
- image understanding
- hashing methods
- locality sensitive
- pattern recognition
- data sets