Bounds and constructions for binary codes of length less than 24 and asymmetric distance less than 6.
Jacobus H. WeberCornelis de VroedtDick E. BoekeePublished in: IEEE Trans. Inf. Theory (1988)
Keyphrases
- hamming distance
- binary codes
- hamming space
- distance measure
- efficient similarity search
- locality sensitive hashing
- euclidean distance
- pattern matching
- similarity search
- gray code
- edit distance
- hash functions
- distance function
- tag information
- pairwise
- training data
- image collections
- visual descriptors
- data sets
- image features
- high dimensional
- computer vision