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...
Veröffentlicht in: | IEEE transactions on pattern analysis and machine intelligence. - 1979. - 41(2019), 9 vom: 12. Sept., Seite 2084-2097 |
---|---|
1. Verfasser: | |
Weitere Verfasser: | , |
Format: | Online-Aufsatz |
Sprache: | English |
Veröffentlicht: |
2019
|
Zugriff auf das übergeordnete Werk: | IEEE transactions on pattern analysis and machine intelligence |
Schlagworte: | Journal Article Research Support, Non-U.S. Gov't |
Online verfügbar |
Volltext |