Top Cited Papers
Open Access
- 20 February 2023
- journal article
- research article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Knowledge Discovery From Data
- Vol. 17 (1) , 1-50
Abstract
Nearest neighbor search aims at obtaining 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 introduce three related important topics including semi-supervised deep hashing, domain adaption deep hashing, and multi-modal deep hashing. Meanwhile, we present some commonly used public datasets and the scheme to measure the performance of deep hashing algorithms. Finally, we discuss some potential research directions in conclusion.Keywords
All Related Versions
Funding Information
- National Key Research and Development Program of China (2021YFF1200902)
- National Natural Science Foundation of China (31871342)
This publication has 60 references indexed in Scilit:
- Approximate nearest neighbor algorithm based on navigable small world graphsInformation Systems, 2014
- Optimal Lower Bounds for Locality-Sensitive Hashing (Except When q is Tiny)ACM Transactions on Computation Theory, 2014
- Explaining AdaBoost2013
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of MultipliersFoundations and Trends in Machine Learning, 2011
- Semantic hashingInternational Journal of Approximate Reasoning, 2009
- A Fast Learning Algorithm for Deep Belief NetsNeural Computation, 2006
- Fast hash table lookup using extended bloom filterACM SIGCOMM Computer Communication Review, 2005
- Gradient-based learning applied to document recognitionProceedings of the IEEE, 1998
- Syntactic clustering of the WebComputer Networks and ISDN Systems, 1997
- An Algorithm for Finding Best Matches in Logarithmic Expected TimeACM Transactions on Mathematical Software, 1977