Scalable Distributed Hashing for Approximate Nearest Neighbor Search

Hashing has been widely applied to the large-scale approximate nearest neighbor search problem owing to its high efficiency and low storage requirement. Most investigations concentrate on learning hashing methods in a centralized setting. However, in existing big data systems, data is often stored a...

Description complète

Détails bibliographiques
Publié dans:IEEE transactions on image processing : a publication of the IEEE Signal Processing Society. - 1992. - 31(2022) vom: 15., Seite 472-484
Auteur principal: Cao, Yuan (Auteur)
Autres auteurs: Liu, Junwei, Qi, Heng, Gui, Jie, Li, Keqiu, Ye, Jieping, Liu, Chao
Format: Article en ligne
Langue:English
Publié: 2022
Accès à la collection:IEEE transactions on image processing : a publication of the IEEE Signal Processing Society
Sujets:Journal Article