The DOI matches its Crossref record; 36 of the 36 references it cites were found in a registry or an index.
Asymmetric Deep Supervised Hashing
Open accessAbstract
Hashing has been widely used for large-scale approximate nearest neighbor search because of its storage and search efficiency. Recent work has found that deep supervised hashing can significantly outperform non-deep supervised hashing in many applications. However, most existing deep supervised hashing methods adopt a symmetric strategy to learn one deep hash function for both query points and database (retrieval) points. The training of these symmetric deep supervised hashing methods is typically time-consuming, which makes them hard to effectively utilize the supervised information for cases with large-scale database. In this paper, we propose a novel deep supervised hashing method, called asymmetric deep supervised hashing (ADSH), for large-scale nearest neighbor search. ADSH treats the query points and database points in an asymmetric way. More specifically, ADSH learns a deep hash function only for query points, while the hash codes for database points are directly learned. The training of ADSH is much more efficient than that of traditional symmetric deep supervised hashing methods. Experiments show that ADSH can achieve state-of-the-art performance in real applications.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
ImageNet classification with deep convolutional neural networks
Krizhevsky, A., Sutskever, I., & Hinton, G. E. (2017) · Communications of the ACM · doi:10.1145/3065386 · Cited by 112,155
Microsoft COCO: Common Objects in Context
Lin, T.-Y., Maire, M., Belongie, S., Hays, J., Perona, P., Ramanan, D., Dollár, P., & Zitnick, C. L. (2014) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-10602-1_48 · Cited by 45,460
Learning Multiple Layers of Features from Tiny Images
Krizhevsky, A. (2024) · doi:10.57702/zp44cu3g · Cited by 23,395
Return of the Devil in the Details: Delving Deep into Convolutional Nets
Chatfield, K., Simonyan, K., Vedaldi, A., & Zisserman, A. (2014) · Proceedings of the British Machine Vision Conference 2014 · doi:10.5244/c.28.6 · Cited by 3,335
(1999) · Cited by 3,186
NUS-WIDE: a real-world web image database from National University of Singapore
Chua, T.-S., Tang, J., Hong, R., Li, H., Luo, Z., & Zheng, Y. (2009) · Proceedings of the ACM International Conference on Image and Video Retrieval · doi:10.1145/1646396.1646452 · Cited by 3,025
Locality-sensitive hashing scheme based on p-stable distributions
Datar, M., Immorlica, N., Indyk, P., & Mirrokni, V. S. (2004) · Proceedings of the twentieth annual symposium on Computational geometry · doi:10.1145/997817.997857 · Cited by 2,936
Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions
Andoni, A., & Indyk, P. (2008) · Communications of the ACM · doi:10.1145/1327452.1327494 · Cited by 1,437
Supervised hashing with kernels
Liu, W., Wang, J., Ji, R., Jiang, Y.-G., & Chang, S.-F. (2012) · 2012 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2012.6247912 · Cited by 1,351
Shen, F., Shen, C., Liu, W., & Shen, H. T. (2015) · 2015 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2015.7298598 · Cited by 1,231
Near-Optimal Hashing Algorithms for Approximate Nearest Neighbor in High Dimensions
Andoni, A., & Indyk, P. (2006) · 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06) · doi:10.1109/focs.2006.49 · Cited by 1,067
Iterative quantization: A procrustean approach to learning binary codes
Gong, Y., & Lazebnik, S. (2011) · CVPR 2011 · doi:10.1109/cvpr.2011.5995432 · Cited by 1,038
Supervised Hashing for Image Retrieval via Image Representation Learning
Xia, R., Pan, Y., Lai, H., Liu, C., & Yan, S. (2014) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v28i1.8952 · Cited by 952
Deep Supervised Hashing for Fast Image Retrieval
Liu, H., Wang, R., Shan, S., & Chen, X. (2016) · 2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2016.227 · Cited by 933
Kernelized locality-sensitive hashing for scalable image search
Kulis, B., & Grauman, K. (2009) · 2009 IEEE 12th International Conference on Computer Vision · doi:10.1109/iccv.2009.5459466 · Cited by 890
Simultaneous feature learning and hash coding with deep neural networks
Lai, H., Pan, Y., Liu, Y., & Yan, S. (2015) · 2015 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2015.7298947 · Cited by 884
Feature Learning based Deep Supervised Hashing with Pairwise LabelsPreprint
Li, W.-J., Wang, S., & Kang, W.-C. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1511.03855 · Cited by 741
Self-citationHamming Distance Metric Learning
Norouzi, M., Fleet, D. J., & Salakhutdinov, R. (2012) · neural information processing systems · Cited by 701
Deep Hashing Network for Efficient Similarity Retrieval
Zhu, H., Long, M., Wang, J., & Cao, Y. (2016) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v30i1.10235 · Cited by 664
Liu, W., Mu, C., Kumar, S., & Chang, S. (2014) · neural information processing systems · Cited by 598
MatConvNet - Convolutional Neural Networks for MATLAB
Vedaldi, A., & Lenc, K. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1412.4564 · Cited by 578
Deep semantic ranking based hashing for multi-label image retrieval
Zhao, F., Huang, Y., Wang, L., & Tan, T. (2015) · 2015 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2015.7298763 · Cited by 564
Radisic, A. (2025) · Zenodo (CERN European Organization for Nuclear Research) · doi:10.5281/zenodo.17117444 · Cited by 462
Fast Supervised Hashing with Decision Trees for High-Dimensional Data
Lin, G., Shen, C., Shi, Q., van den Hengel, A., & Suter, D. (2014) · 2014 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2014.253 · Cited by 422
Self-taught hashing for fast similarity search
Zhang, D., Wang, J., Cai, D., & Lu, J. (2010) · Proceedings of the 33rd international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/1835449.1835455 · Cited by 347
Column Sampling Based Discrete Supervised Hashing
Kang, W.-C., Li, W.-J., & Zhou, Z.-H. (2016) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v30i1.10176 · Cited by 295
Self-citationSupervised hashing with latent factor models
Zhang, P., Zhang, W., Li, W.-J., & Guo, M. (2014) · Proceedings of the 37th international ACM SIGIR conference on Research & development in information retrieval · doi:10.1145/2600428.2609600 · Cited by 271
Self-citationA neural algorithm for a fundamental computing problem
Dasgupta, S., Stevens, C. F., & Navlakha, S. (2017) · Science · doi:10.1126/science.aam9868 · Cited by 220
Optimal Data-Dependent Hashing for Approximate Near Neighbors
Andoni, A., & Razenshteyn, I. (2015) · Proceedings of the forty-seventh annual ACM symposium on Theory of Computing · doi:10.1145/2746539.2746553 · Cited by 185
Learning Hash Codes with Listwise Supervision
Wang, J., Liu, W., Sun, X. A., & Jiang, Y. (2013) · IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2013.377 · Cited by 159
Learning Binary Codes for Maximum Inner Product Search
Shen, F., Liu, W., Zhang, S., Yang, Y., & Shen, H. T. (2015) · IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2015.472 · Cited by 142
Deep Asymmetric Pairwise Hashing
Shen, F., Gao, X., Liu, L., Yang, Y., & Shen, H. T. (2017) · ACM International Conference on Multimedia (ACM MM) · doi:10.1145/3123266.3123345 · Cited by 133
The Power of Asymmetry in Binary HashingPreprint
Neyshabur, B., Yadollahpour, P., Makarychev, Y., Salakhutdinov, R., & Srebro, N. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1311.7662 · Cited by 77
Top Rank Supervised Binary Coding for Visual Search
Song, D., Liu, W., Ji, R., Meyer, D., & Smith, J. R. (2015) · IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2015.223 · Cited by 76
Asymmetric Discrete Graph Hashing
Shi, X., Xing, F., Xu, K., Sapkota, M., & Yang, L. (2017) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v31i1.10831 · Cited by 51
Towards Optimal Binary Code Learning via Ordinal Embedding
Liu, H., Ji, R., Wu, Y., & Liu, W. (2016) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v30i1.10167 · Cited by 41
Cited by
A Decade Survey of Content Based Image Retrieval Using Deep Learning
Dubey, S. R. (2022) · IEEE Transactions on Circuits and Systems for Video Technology · doi:10.1109/tcsvt.2021.3080920 · Cited by 356
A Survey on Deep Hashing Methods
Luo, X., Wang, H., Wu, D., Chen, C., Deng, M., Huang, J., & Hua, X.-S. (2023) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/3532624 · Cited by 241
Deep balanced discrete hashing for image retrieval
Zheng, X., Zhang, Y., & Lu, X. (2020) · Neurocomputing · doi:10.1016/j.neucom.2020.04.037 · Cited by 83
Deep Perceptual Hash Based on Hash Center for Image Copyright Protection
Sun, X., & Zhou, J. (2022) · IEEE Access · doi:10.1109/access.2022.3221980 · Cited by 20
“The representative ones are DSH [29], DPSH [30], HashNet [31], ADSH [32] etc.”
BackgroundMachine Unlearning for Image Retrieval: A Generative Scrubbing Approach
Zhang, P.-F., Bai, G., Huang, Z., & Xu, X.-S. (2022) · Proceedings of the 30th ACM International Conference on Multimedia · doi:10.1145/3503161.3548378 · Cited by 18
Metadata
- Authors
- Jiang, Q.-Y., & Li, W.-J.
- Venue
- Proceedings of the AAAI Conference on Artificial Intelligence
- Published
- 2018-04-29
- Volume
- 32
- Issue
- 1
- ISSN
- 2159-5399 (ISSN-L)
- 2374-3468
- OpenAlex
- W2962786441
- Cited by
- 266
- References
- 36
- FWCI
- 9.31
- Type
- conference paper
- Language
- en
- Open access
- diamond
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.