Strongly Constrained Discrete Hashing

DOI10.1109/TIP.2020.2963952WikidataQ92659832 ScholiaQ92659832MaRDI QIDQ5105241

Author name not available (Why is that?)

Publication date: 16 September 2022

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

Mathematics Subject Classification ID

Information and communication theory, circuits (94-XX)

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Strengthening hash families and compressive sensing 👍 👎
• Hash-based algorithms for discretized data 👍 👎
• Optimal hashing 👍 👎
• Quasi-perfect Hashing 👍 👎
• Hadamard Coding for Supervised Discrete Hashing 👍 👎
• Discrete Spectral Hashing for Efficient Similarity Retrieval 👍 👎
• Fast hashing with strong concentration bounds 👍 👎
• Nearly optimal property preserving hashing 👍 👎

This page was built for publication: Strongly Constrained Discrete Hashing

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