Distance Encoded Product Quantization for Approximate K-Nearest Neighbor Search in High-Dimensional Space
Approximate K-nearest neighbor search is a fundamental problem in computer science. The problem is especially important for high-dimensional and large-scale data. Recently, many techniques encoding high-dimensional data to compact codes have been proposed. The product quantization and its variations...
| Publié dans: | IEEE transactions on pattern analysis and machine intelligence. - 1979. - 41(2019), 9 vom: 12. Sept., Seite 2084-2097 |
|---|---|
| Auteur principal: | |
| Autres auteurs: | , |
| Format: | Article en ligne |
| Langue: | English |
| Publié: |
2019
|
| Accès à la collection: | IEEE transactions on pattern analysis and machine intelligence |
| Sujets: | Journal Article Research Support, Non-U.S. Gov't |
| Accès en ligne |
Volltext |