Extremely Low Bit-Rate Nearest Neighbor Search Using a Set Compression Tree
The goal of this work is a data structure to support approximate nearest neighbor search on very large scale sets of vector descriptors. The criteria we wish to optimize are: (i) that the memory footprint of the representation should be very small (so that it fits into main memory); and (ii) that th...
| Veröffentlicht in: | IEEE transactions on pattern analysis and machine intelligence. - 1979. - 36(2014), 12 vom: 14. Dez., Seite 2396-406 |
|---|---|
| 1. Verfasser: | |
| Weitere Verfasser: | |
| Format: | Online-Aufsatz |
| Sprache: | English |
| Veröffentlicht: |
2014
|
| 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 |