Fast Exact Search in Hamming Space With Multi-Index Hashing
There is growing interest in representing image data and feature descriptors using compact binary codes for fast near neighbor search. Although binary codes are motivated by their use as direct indices (addresses) into a hash table, codes longer than 32 bits are not being used as such, as it was tho...
Veröffentlicht in: | IEEE transactions on pattern analysis and machine intelligence. - 1979. - 36(2014), 6 vom: 01. Juni, Seite 1107-19 |
---|---|
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 |