Hash Bit Selection for Nearest Neighbor Search

DOI10.1109/TIP.2017.2695895MaRDI QIDQ4619111zbMATH OpenOpenAlexWikidataFDO

Authors Xiang-Long Liu, Shih-Fu Chang, Jun-Feng He

Publication date 5 February 2019

Published in IEEE Transactions on Image Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tip.2017.2695895

Mathematics Subject Classification ID

Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)

Recommendations

• Optimal hashing-based time-space trade-offs for approximate near neighbors
• Optimal data-dependent hashing for approximate near neighbors
• Query-Adaptive Reciprocal Hash Tables for Nearest Neighbor Search
• Neighborhood preserving hashing and approximate queries
• scientific article; zbMATH DE number 1003256
• Bit selection hashing for large scale image retrieval
• Efficient Nearest Neighbors via Robust Sparse Hashing
• A hierarchical hashing scheme for nearest neighbor search and broad-phase collision detection
• The self-indexed search algorithm: a bit-level approach to minimal perfect hashing

Cited in

(1)

• Weakly-supervised semantic guided hashing for social image retrieval

This page was built for publication: Hash Bit Selection for Nearest Neighbor Search

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4619111)