Efficient Nearest Neighbors via Robust Sparse Hashing

DOI10.1109/TIP.2014.2324280MaRDI QIDQ4592402zbMATH OpenOpenAlexWikidataFDO

Authors Anoop Cherian, Suvrit Sra, Vassilios Morellas, Nikolaos Papanikolopoulos

Publication date 20 November 2017

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

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

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
• A Sparse Embedding and Least Variance Encoding Approach to Hashing
• Neighborhood preserving hashing and approximate queries
• scientific article; zbMATH DE number 1003256
• Hypercube LSH for approximate near neighbors
• Discrete Spectral Hashing for Efficient Similarity Retrieval
• Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces
• scientific article; zbMATH DE number 1775451

Cited in

(1)

• Hash Bit Selection for Nearest Neighbor Search

This page was built for publication: Efficient Nearest Neighbors via Robust Sparse Hashing

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