The DOI matches its Crossref record; 34 of the 34 references it cites were found in a registry or an index.
Column Sampling Based Discrete Supervised Hashing
Open accessAbstract
By leveraging semantic (label) information, supervised hashing has demonstrated better accuracy than unsupervised hashing in many real applications. Because the hashing-code learning problem is essentially a discrete optimization problem which is hard to solve, most existing supervised hashing methods try to solve a relaxed continuous optimization problem by dropping the discrete constraints. However, these methods typically suffer from poor performance due to the errors caused by the relaxation. Some other methods try to directly solve the discrete optimization problem. However, they are typically time-consuming and unscalable. In this paper, we propose a novel method, called column sampling based discrete supervised hashing (COSDISH), to directly learn the discrete hashing code from semantic information. COSDISH is an iterative method, in each iteration of which several columns are sampled from the semantic similarity matrix and then the hashing code is decomposed into two parts which can be alternately optimized in a discrete way. Theoretical analysis shows that the learning (optimization) algorithm of COSDISH has a constant-approximation bound in each step of the alternating optimization procedure. Empirical results on datasets with semantic labels illustrate that COSDISH can outperform the state-of-the-art methods in real applications like image retrieval.
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
Learning Multiple Layers of Features from Tiny Images
Krizhevsky, A. (2024) · doi:10.57702/zp44cu3g · Cited by 23,395
Approximate nearest neighbors: towards removing the curse of dimensionality
Indyk, P., & Motwani, R. (1998) · Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC '98 · doi:10.1145/276698.276876 · Cited by 4,188
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
Weiss, Y., Torralba, A. B., & Fergus, R. (2008) · neural information processing systems · Cited by 2,767
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
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
Minimal Loss Hashing for Compact Binary Codes
Norouzi, M., & Blei, D. M. (2011) · International Conference on Machine Learning · Cited by 765
Large-Scale Supervised Multimodal Hashing with Semantic Correlation Maximization
Zhang, D., & Li, W.-J. (2014) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v28i1.8995 · Cited by 616
Self-citationLDAHash: Improved Matching with Smaller Descriptors
Strecha, C., Bronstein, A. M., Bronstein, M. M., & Fua, P. (2012) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2011.103 · Cited by 605
Semi-supervised hashing for scalable image retrieval
Wang, J., Kumar, S., & Chang, S.-F. (2010) · 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2010.5539994 · Cited by 601
Liu, W., Mu, C., Kumar, S., & Chang, S. (2014) · neural information processing systems · Cited by 598
Approximate Nearest Neighbors: Towards Removing the Curse of Dimensionality
Indyk, P., & Motwani, R. (1998) · Cited by 486
Latent semantic sparse hashing for cross-modal similarity search
Zhou, J., Ding, G., & Guo, Y. (2014) · Proceedings of the 37th international ACM SIGIR conference on Research & development in information retrieval · doi:10.1145/2600428.2609610 · Cited by 467
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
Sequential Projection Learning for Hashing with Compact Codes
Wang, J., Kumar, S., & Chang, S. (2010) · International Conference on Machine Learning · Cited by 307
Kong, W., & Li, W.-J. (2012) · neural information processing systems · Cited by 306
Self-citationLinear cross-modal hashing for efficient multimedia search
Zhu, X., Huang, Z., Shen, H. T., & Zhao, X. (2013) · Proceedings of the 21st ACM international conference on Multimedia · doi:10.1145/2502081.2502107 · Cited by 282
Supervised 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-citationComposite hashing with multiple information sources
Zhang, D., Wang, F., & Si, L. (2011) · Proceedings of the 34th international ACM SIGIR conference on Research and development in Information Retrieval · doi:10.1145/2009916.2009950 · Cited by 211
A probabilistic model for multimodal hash function learning
Zhen, Y., & Yeung, D.-Y. (2012) · Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/2339530.2339678 · Cited by 197
Discriminative coupled dictionary hashing for fast cross-media retrieval
Zhou, Y., Wu, F. Q., Yang, Y., Tian, Q., Luo, J., & Zhuang, Y. (2014) · International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR) · doi:10.1145/2600428.2609563 · Cited by 152
Rastegari, M., Choi, J., Fakhraei, S., Daumé, H., & Davis, L. S. (2013) · Seoul National University Open Repository (Seoul National University) · Cited by 115
Complementary Projection Hashing
Jin, Z., Hu, Y., Lin, Y., Zhang, D., Lin, S., Cai, D., & Li, X. (2013) · IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2013.39 · Cited by 72
Graph Cuts for Supervised Binary Coding
Ge, T., He, K., & Sun, J. Z. (2014) · Lecture notes in computer science · doi:10.1007/978-3-319-10584-0_17 · Cited by 70
Lin, Y., Jin, R., Cai, D., Yan, S., & Li, X. (2013) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr.2013.64 · Cited by 64
Semantic hashing using tags and topic modeling
Wang, Q., Zhang, D., & Si, L. (2013) · International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR) · doi:10.1145/2484028.2484037 · Cited by 56
Learning hash codes for efficient content reuse detection
Zhang, Q., Wu, Y. X., Ding, Z., & Huang, X. (2012) · International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR) · doi:10.1145/2348283.2348339 · Cited by 15
New results on some quadratic programming problems
Yang, R. (2013) · Illinois Digital Environment for Access to Learning and Scholarship (University of Illinois at Urbana-Champaign) · Cited by 13
Cited by
Radisic, A. (2025) · Zenodo (CERN European Organization for Nuclear Research) · doi:10.5281/zenodo.17117444 · Cited by 462
Unsupervised Deep Hashing with Similarity-Adaptive and Discrete Optimization
Shen, F., Xu, Y., Liu, L., Yang, Y., Huang, Z., & Shen, H. T. (2018) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2018.2789887 · Cited by 407
Large-Scale Remote Sensing Image Retrieval by Deep Hashing Neural Networks
Li, Y., Zhang, Y., Huang, X., Zhu, H., & Ma, J. (2018) · IEEE Transactions on Geoscience and Remote Sensing · doi:10.1109/tgrs.2017.2756911 · Cited by 276
Asymmetric Deep Supervised Hashing
Jiang, Q.-Y., & Li, W.-J. (2018) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v32i1.11814 · Cited by 266
Self-citationDeep 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
Metadata
- Authors
- Kang, W.-C., Li, W.-J., & Zhou, Z.-H.
- Venue
- Proceedings of the AAAI Conference on Artificial Intelligence
- Published
- 2016-02-21
- Volume
- 30
- Issue
- 1
- ISSN
- 2159-5399 (ISSN-L)
- 2374-3468
- OpenAlex
- W2510911086
- Cited by
- 295
- References
- 34
- FWCI
- 17.15
- 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.