Tree-based compact hashing for approximate nearest neighbor search
2015
Hashing methods map high-dimensional data onto compact binary codes for efficient retrieval. These methods focus on preserving the data similarity in Hamming distance between the mapped hash codes....
Keywords:
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
0
References
0
Citations
NaN
KQI