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...
Ausführliche Beschreibung
Bibliographische Detailangaben
| Veröffentlicht in: | IEEE transactions on image processing : a publication of the IEEE Signal Processing Society. - 1992. - 31(2022) vom: 07., Seite 472-484
|
|---|
| 1. Verfasser: |
Cao, Yuan
(VerfasserIn) |
|---|
| Weitere Verfasser: |
Liu, Junwei,
Qi, Heng,
Gui, Jie,
Li, Keqiu,
Ye, Jieping,
Liu, Chao |
|---|
| Format: | Online-Aufsatz
|
|---|
| Sprache: | English |
|---|
| Veröffentlicht: |
2022
|
|---|
| Zugriff auf das übergeordnete Werk: | IEEE transactions on image processing : a publication of the IEEE Signal Processing Society
|
|---|
| Schlagworte: | Journal Article |
|---|