A Survey On Deep Hashing Methods

Abstract

Nearest neighbor search aims to obtain the samples in the database with the smallest distances from them to the queries, which is a basic task in a range of fields, including computer vision and data mining. Hashing is one of the most widely used methods for its computational and storage efficiency. With the development of deep learning, deep hashing methods show more advantages than traditional methods. In this survey, we detailedly investigate current deep hashing algorithms including deep supervised hashing and deep unsupervised hashing. Specifically, we categorize deep supervised hashing methods into pairwise methods, ranking-based methods, pointwise methods as well as quantization according to how measuring the similarities of the learned hash codes. Moreover, deep unsupervised hashing is categorized into similarity reconstruction-based methods, pseudo-label-based methods and prediction-free self-supervised learning-based methods based on their semantic learning manners. We also i

Stats

• citations175
• S2 citations—
• github stars0
• HF likes0
• heat score16.84
• arxiv keyluo2020a

Related papers

• A Survey On Learning To Hash (2016)21.62
• Deep Discrete Supervised Hashing (2017)15.06
• Improved Deep Hashing With Soft Pairwise Similarity For Multi-label Image Retrieval (2018)16.82
• Deep Hashing With Semantic Hash Centers For Image Retrieval (2025)2.26
• A Survey On Deep Text Hashing: Efficient Semantic Text Retrieval With Binary Representation (2025)3.83
• Deep Self-adaptive Hashing For Image Retrieval (2021)8.35
• Unsupervised Semantic Deep Hashing (2018)10.48
• A Revisit Of Hashing Algorithms For Approximate Nearest Neighbor Search (2016)11.19