Discrete Spectral Hashing for Efficient Similarity Retrieval

DOI10.1109/TIP.2018.2875312MaRDI QIDQ4617987zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Di Hu, Feiping Nie, Xuelong Li

Publication date 7 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.2018.2875312

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)

Cited in

(6)

• Global similarity preserving hashing
• Efficient Nearest Neighbors via Robust Sparse Hashing
• Sequential Discrete Hashing for Scalable Cross-Modality Similarity Retrieval
• Uncorrelated Component Analysis-Based Hashing
• Strongly Constrained Discrete Hashing
• Deep asymmetric hashing with dual semantic regression and class structure quantization

This page was built for publication: Discrete Spectral Hashing for Efficient Similarity Retrieval

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