The DOI matches its Crossref record; 37 of the 37 references it cites were found in a registry or an index.
Supervised Discrete Hashing
Open accessAbstract
Recently, learning based hashing techniques have attracted broad research interests because they can support efficient storage and retrieval for high-dimensional data such as images, videos, documents, etc. However, a major difficulty of learning to hash lies in handling the discrete constraints imposed on the pursued hash codes, which typically makes hash optimizations very challenging (NP-hard in general). In this work, we propose a new supervised hashing framework, where the learning objective is to generate the optimal binary hash codes for linear classification. By introducing an auxiliary variable, we reformulate the objective such that it can be solved substantially efficiently by employing a regularization algorithm. One of the key steps in this algorithm is to solve a regularization sub-problem associated with the NP-hard binary optimization. We show that the sub-problem admits an analytical solution via cyclic coordinate descent. As such, a high-quality discrete solution can eventually be obtained in an efficient computing manner, therefore enabling to tackle massive datasets. We evaluate the proposed approach, dubbed Supervised Discrete Hashing (SDH), on four large image datasets and demonstrate its superiority to the state-of-the-art hashing methods in large-scale image retrieval.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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: A large-scale hierarchical image database
Deng, J., Dong, W., Socher, R., Li, L.-J., Li, K., & Fei-Fei, L. (2009) · 2009 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2009.5206848 · Cited by 65,333
(2008) · Journal of Machine Learning Research · Cited by 33,051
Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
Belkin, M., & Niyogi, P. (2003) · Neural Computation · doi:10.1162/089976603321780317 · Cited by 7,621
Modeling the Shape of the Scene: A Holistic Representation of the Spatial Envelope
Oliva, A., & Torralba, A. (2001) · International Journal of Computer Vision · doi:10.1023/a:1011139631724 · Cited by 6,319
(1999) · Cited by 3,186
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
Weiss, Y., Torralba, A. B., & Fergus, R. (2008) · neural information processing systems · Cited by 2,389
On the algorithmic implementation of multiclass kernel-based vector machines
Crammer, K., & Singer, Y. (2002) · Journal of Machine Learning Research · Cited by 2,310
80 Million Tiny Images: A Large Data Set for Nonparametric Object and Scene Recognition
Torralba, A., Fergus, R., & Freeman, W. T. (2008) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2008.128 · Cited by 1,921
Gong, Y., Lazebnik, S., Gordo, A., & Perronnin, F. (2013) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2012.193 · Cited by 1,834
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
Self-citationKernelized 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
On the algorithmic implementation of multiclass kernel-based vector machines
CrammerKoby, & SingerYoram (2002) · Journal of Machine Learning Research · doi:10.5555/944790.944813 · Cited by 874
Semi-Supervised Hashing for Large-Scale Search
Wang, J., Kumar, S., & Chang, S.-F. (2012) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2012.48 · Cited by 810
Learning to Hash with Binary Reconstructive Embeddings
Kulis, B., & Darrell, T. (2009) · Cited by 806
Minimal Loss Hashing for Compact Binary Codes
Norouzi, M., & Blei, D. M. (2011) · International Conference on Machine Learning · Cited by 765
Locality-sensitive binary codes from shift-invariant kernels
Raginsky, M., & Lazebnik, S. (2009) · Cited by 673
Inter-media hashing for large-scale retrieval from heterogeneous data sources
Song, J., Yang, Y., Yang, Y., Huang, Z., & Shen, H. T. (2013) · Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data · doi:10.1145/2463676.2465274 · Cited by 620
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
Liu, W., Mu, C., Kumar, S., & Chang, S. (2014) · neural information processing systems · Cited by 597
Self-citationHamming Distance Metric Learning
Norouzi, M., Fleet, D. J., & Salakhutdinov, R. (2012) · neural information processing systems · Cited by 562
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-citationSelf-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
LIBLINEAR: A Library for Large Linear Classification
FanRong-En, ChangKai-Wei, HsiehCho-Jui, WangXiang-Rui, & LinChih-Jen (2008) · Journal of Machine Learning Research · doi:10.5555/1390681.1442794 · Cited by 328
Kong, W., & Li, W.-J. (2012) · neural information processing systems · Cited by 306
Fast Similarity Search for Learned Metrics
Kulis, B., Jain, P., & Grauman, K. (2009) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2009.151 · Cited by 256
Inductive Hashing on Manifolds
Shen, F., Shen, C., Shi, Q., van den Hengel, A., & Tang, Z. (2013) · Cited by 198
Self-citationInductive Hashing on Manifolds
Shen, F., Shen, C., Shi, Q., van den Hengel, A., & Tang, Z. (2013) · 2013 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2013.205 · Cited by 186
Self-citationLearning Binary Codes for High-Dimensional Data Using Bilinear Projections
Gong, Y., Kumar, S., Rowley, H. A., & Lazebnik, S. (2013) · 2013 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2013.69 · Cited by 164
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
Self-citationMultidimensional Spectral Hashing
Weiss, Y., Fergus, R., & Torralba, A. B. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-33715-4_25 · Cited by 157
Joly, A., & Buisson, O. (2011) · 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.2011.5995709 · Cited by 150
Learning Hash Functions Using Column GenerationPreprint
Li, X., Lin, G., Shen, C., van den Hengel, A., & Dick, A. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1303.0339 · Cited by 129
Self-citationSparse hashing for fast multimedia search
Zhu, X., Huang, Z. H., Cheng, H., Cui, J., & Shen, H. T. (2013) · ACM Transactions on Information Systems · doi:10.1145/2457465.2457469 · Cited by 125
Self-citationGraph 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
Compact Hyperplane Hashing with Bilinear FunctionsPreprint
Liu, W., Wang, J., Mu, Y., Kumar, S., & Chang, S. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1206.4618 · Cited by 69
Self-citationThe Role of Dimensionality Reduction in Classification
Wang, W., & Carreira-Perpiñán, M. Á. (2014) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v28i1.8975 · Cited by 44
Cited by
SCA-CNN: Spatial and Channel-Wise Attention in Convolutional Networks for Image Captioning
Chen, L., Zhang, H., Xiao, J., Nie, L., Shao, J., Liu, W., & Chua, T.-S. (2017) · 2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2017.667 · Cited by 1,992
Self-citationWang, J., Zhang, T., Song, J., Sebe, N., & Shen, H. T. (2018) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2017.2699960 · Cited by 971
Self-citationDeep 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
Xiao, J., Ye, H., He, X., Zhang, H., Wu, F., & Chua, T.-S. (2017) · Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence · doi:10.24963/ijcai.2017/435 · Cited by 912
Jiang, Q.-Y., & Li, W.-J. (2017) · 2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2017.348 · Cited by 880
Metadata
- Authors
- Shen, F., Shen, C., Liu, W., & Shen, H. T.
- Venue
- 2015 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)
- Publisher
- IEEE
- Published
- 2015-06
- Pages
- 37-45
- ISSN
- 1063-6919 (ISSN-L)
- OpenAlex
- W1910300841
- Cited by
- 1,231
- References
- 37
- FWCI
- 55.98
- Type
- conference paper
- Language
- en
- Open access
- green
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.