The poset metrics that allow binary codes of codimension m to be m-, (m - 1)-, or (m - 2)-perfect.
Hyun Kwang KimDenis S. KrotovPublished in: ISIT (2007)
Keyphrases
- binary codes
- hamming distance
- hamming space
- efficient similarity search
- similarity search
- hash functions
- locality sensitive hashing
- locality sensitive
- partial order
- image collections
- visual descriptors
- hashing methods
- neural network
- database
- pattern matching
- knn
- high dimensional
- support vector
- tag information
- computer vision
- machine learning